Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


Carmichael’s conjecture on the Euler function is valid below $10^ {10,000,000}$
HTML articles powered by AMS MathViewer

by Aaron Schlafly and Stan Wagon PDF
Math. Comp. 63 (1994), 415-419 Request permission


Carmichael’s conjecture states that if $\phi (x) = n$, then $\phi (y) = n$ for some $y \ne x$ ($\phi$ is Euler’s totient function). We show that the conjecture is valid for all x under ${10^{10,900,000}}$. The main new idea is the application of a prime-certification technique that allows us to very quickly certify the primality of the thousands of large numbers that must divide a counterexample.
Similar Articles
Additional Information
  • © Copyright 1994 American Mathematical Society
  • Journal: Math. Comp. 63 (1994), 415-419
  • MSC: Primary 11A25; Secondary 11A51, 11Y11
  • DOI:
  • MathSciNet review: 1226815