Carmichael's totient function conjecture: Difference between revisions

Revision as of 19:49, 29 January 2022

Revision as of 20:00, 29 January 2022

Line 1:

{{Short description|MathematicsProblem conceptin number theory on equal totients}}

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''. It states that, for every ''n'' there is at least one other integer ''m'' ≠ ''n'' such that ''φ''(''m'') = ''φ''(''n'').