On the equations ϕ(n) = ϕ(n + k) and ϕ(p − 1) = ϕ(q − 1)

DOI10.1142/S1793042121500366zbMath1479.11024MaRDI QIDQ5001851

Sungjin Kim

Publication date: 23 July 2021

Published in: International Journal of Number Theory (Search for Journal in Brave)

zbMATH Keywords

coincidenceEuler functionprimeshifted prime

Mathematics Subject Classification ID

Applications of sieve methods (11N36) Arithmetic functions; related numbers; inversion formulas (11A25) Primes (11A41)

Related Items (2)

SOMEWHAT gp-CONTINUOUS AND SOMEWHAT gp-IRRESOLUTE FUNCTIONS ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Variants of the Selberg sieve, and bounded intervals containing many primes
• Number of prime divisors of \(\varphi_ k(n)\), where \(\varphi_ k\) is the \(k\)-fold iterative of \(\varphi\)
• On the normal number of prime factors of \(\phi(n)\)
• Sets of monotonicity for Euler's totient function
• Primes in progressions to moduli with a large power factor
• Popular subsets for Euler's \(\varphi \)-function
• Bounded gaps between primes
• Remarks on Fibers of the Sum-of-Divisors Function
• Some problems of Erdős on the sum-of-divisors function
• Dense clusters of primes in subsets
• Sur l'équation φ (x+k)=φ (k)
• ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
• Shifted primes without large prime factors
• The minimal number of solutions to $\phi(n)=\phi(n+k)$
• A remark on the Lang-Trotter and Artin conjectures
• On equations $\sigma(n)=\sigma(n+k)$ and $\varphi(n)=\varphi(n+k)$
• Consecutive primes in tuples
• Primes in intervals of bounded length
• On the Equation φ(n) = φ(n + k)
• Small gaps between primes

This page was built for publication: On the equations ϕ(n) = ϕ(n + k) and ϕ(p − 1) = ϕ(q − 1)