The prime factors of an integer
n |

The following applet computes the prime factors of an integer, as well as
the Euler phi function *φ*(*n*)
and the Carmichael function *λ*(*n*), here denoted by
*f*(*n*) and *l*(*n*).

Please type in an integer and press the return-key. (Note: Factorization of a 10-digit number lasts some seconds, greater numbers need considerably more time...)

© de Vries 2001 |