The large-prime threshold in Erdős Problem 770(iii)
An expository proof of Erdős Problem 770(iii). For each fixed ε > 0, the first index at which the collective greatest common divisor of aⁿ − 1 (starting at a = 2) equals 1 is P(n) for all sufficiently large n with P(n) > n^ε, where P(n) is the largest prime p with p − 1 dividing n. The argument uses Dirichlet GRH and a count of products of small primes.
Authors
- Dillon MacKenzie
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24409349
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint