![]() The square root of 30 is 5.477, so you only actually need to test the numbers 2, 3, and 5. ![]() If you know your primes, you can slip a few steps by only testing primes less than or equal to the square root of n. You may notice that for the last few steps, the set remained unchanged. Next, delete any multiples of three from the list:Įuler’s totient for n = 30 is the last set (8).In other words, it’s the simple count of how many totatives are in the set. Feel like "cheating" at Calculus? Check out our Practically Cheating Calculus Handbook, which gives you hundreds of easy-to-follow answers in a convenient e-book.Įuler’s Totient Function (also called the phi function) counts the totatives of n: positive integers less than or equal to n that are relatively prime to n.
0 Comments
Leave a Reply. |