Carmichael's totient function conjecture: Difference between revisions

Revision as of 08:50, 14 August 2009

Revision as of 23:08, 1 April 2010

Line 1:

In mathematics, '''Carmichael's totient function conjecture''' concerns the [[Multiplicity (mathematics)|multiplicity]] of values of [[Euler's totient function]] φ(''n''), which counts the number of integers less than and [[coprime]] to ''n''.

This function φ(''n'') is equal to 2 when ''n'' is one of the three values 3, 4, and 6. It is equal to 4 when ''n'' is one of the four values 5, 8, 10, and 12. It is equal to 6 when ''n'' is one of the four values 7, 9, 14, and 18. In each case, there is more than one value of ''n'' having the same value of φ(''n'').