Euler Totient ACT 3
This activity is part of the module "Code by Numbers" which can be downloaded as a complete booklet from the STEM section of the website. In this activity students explore the Euler Totient function, it sounds complicated, it's not, just really neat! The function determines the quantity of numbers that are co-prime up to the selected number (n). Students write some relatively simple code, chunking previous code to simplify the algorithm. There are so many observable patterns when studying the Euler Totient function for a set of numbers. Finally, students see a short cut method to perform the calculation. It's absolutely brilliant.