Content deleted Content added
Tags: Mobile edit Mobile app edit Android app edit |
IznoRepeat (talk | contribs) m →References: cleaning Category:CS1 maint: multiple names: authors list, genfixes |
||
(5 intermediate revisions by 4 users not shown) | |||
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''. It states that, for every ''n'' there is at least one other integer ''m'' ≠ ''n'' such that ''φ''(''m'') = ''φ''(''n'').
Line 143:
==Other results==
Ford also proved that if there exists a counterexample to the
Although the conjecture is widely believed, [[Carl Pomerance]] gave a sufficient condition for an integer ''n'' to be a counterexample to the conjecture {{harv|Pomerance|1974}}. According to this condition, ''n'' is a counterexample if for every prime ''p'' such that ''p'' − 1 divides ''φ''(''n''), ''p''<sup>2</sup> divides ''n''. However Pomerance showed that the existence of such an integer is highly improbable. Essentially, one can show that if the first ''k'' primes ''p'' congruent to 1 (mod ''q'') (where ''q'' is a prime) are all less than ''q''<sup>''k''+1</sup>, then such an integer will be divisible by every prime and thus cannot exist. In any case, proving that Pomerance's counterexample does not exist is far from proving Carmichael's
Another way of stating Carmichael's conjecture is that, if
Line 177:
}}.
*{{citation
| last = Ford | first = K. | author-link = Kevin Ford (mathematician)
| doi = 10.2307/121103
| issue = 1
Line 189:
* {{citation |last=Guy | first=Richard K. | authorlink=Richard K. Guy | title=Unsolved problems in number theory | publisher=[[Springer-Verlag]] |edition=3rd | year=2004 |isbn=978-0-387-20860-2 | zbl=1058.11001 | at=B39 }}.
*{{citation
| last = Klee | first = V. L.
| doi = 10.1090/S0002-9904-1947-08940-0
| journal = [[Bulletin of the American Mathematical Society]]
Line 225:
==External links==
*{{mathworld|title=Carmichael's Totient Function Conjecture|urlname=CarmichaelsTotientFunctionConjecture|mode=cs2}}
[[Category:Multiplicative functions]]
|