Carmichael's totient function conjecture, in number theory, concerns the multiplicity of values of Euler's totient function. It asserts that for every n there is at least one other integer m, not equal to n, such that the totient of m equals the totient of n. Robert Carmichael first presented the claim in 1907 as a theorem, but his proof contained errors, and he retracted it in 1922, restating it as an open conjecture rather than a proven result. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
StatementFor every n there is at least one other integer m not equal to n such that the totient of m equals the totient of n. 1 Proposed Year Progress Toward ResolutionOpen; any counterexample must exceed 10^(10^10), a bound determined by Kevin Ford in 1998. 1 Classification
Resolution Status Prize Status
Prize Status (category) Sources
1. Carmichael's Totient Function Conjecture (Wikipedia)
Wikimedia FoundationLead section
Robert Carmichael first stated this conjecture in 1907, but as a theorem rather than as a conjecture.
Lead section, first sentence
concerns the multiplicity of values of Euler's totient function
Lower bounds
was determined by Kevin Ford in 1998
View the Source Wikipedia: Carmichael Totient Function Conjecture
WikipediaLead section, resolution statusQuote, Lead section, resolution status
However, his proof was faulty, and in 1922, he retracted his claim and stated the conjecture as an open problem.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.