Carmichael's totient function conjecture: Difference between revisions

Revision as of 19:01, 21 April 2013

Revision as of 19:02, 21 April 2013

Line 20:

Another way of stating Carmichael's conjecture is that, if

A(''f'') denotes the number of positive integers ''n'' for which &phi;(''n'')&nbsp;=&nbsp;''f'', then A(''f'') can never equal 1. Relatedly, [[Wacław Sierpiński]] conjectured that every positive integer other than 1 occurs as a value of A(''f''), a conjecture that was proven in 1999 by Kevin Ford.<ref name=HBII228/>

==Notes==]

{{reflist}}

==References==