Bignum Euler's Totient

Sorry, this page is not working for certain browsers, and I'm not sure why. If it doesn't work for you, my apologies.

This is the result of a barter between Edward Martin III and me, in which I am contributing some routines to his High Precision JavaScript calculator. I have also written a radix conversion function for it.

Euler's Totient, for some positive integer n, is how many positive integers there are less than n which share no common factors with it. (In math-speak, numbers with no common factors are called relatively prime, or coprime, to each other.)


      Monitor Calls to IsPrime*?


*The IsPrime function in the calculator is pretty slow for large numbers, but so is any other way I can think of to calculate the function without it. So this checkbox is provided to inform you when the IsPrime function is being called and when it returns, to verify when you are waiting for IsPrime to be checked.