The minimal number of solutions to $\phi(n)=\phi(n+k)$

DOI10.1090/S0025-5718-03-01509-6zbMath1057.11003MaRDI QIDQ4417178

Jeffrey J. Holt

Publication date: 28 July 2003

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

computationEuler's totient function

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Values of arithmetic functions; tables (11Y70)

Related Items (3)

Unnamed Item ⋮ Diophantine equations involving Euler’s totient function ⋮ On the equations ϕ(n) = ϕ(n + k) and ϕ(p − 1) = ϕ(q − 1)

Cites Work

• Sur l'équation φ (x+k)=φ (k)
• Sur l'équation φ (x+k)=φ (x). II

This page was built for publication: The minimal number of solutions to $\phi(n)=\phi(n+k)$