Carmichael's totient function conjecture: Difference between revisions

Content deleted Content added
Other results: fixed typo
Tags: Mobile edit Mobile web edit
Changing short description from "mathematics concept" to "Mathematics concept" (Shortdesc helper)
Line 1:
{{shortShort description|mathematicsMathematics concept}}
 
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'').