Diophantine equations involving the Euler totient function

DOI10.1016/j.jnt.2019.09.001zbMath1454.11041arXiv1902.01638OpenAlexW2981109243MaRDI QIDQ2288317

J. C. Saunders

Publication date: 17 January 2020

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

Full work available at URL: https://arxiv.org/abs/1902.01638

zbMATH Keywords

integer sequencesFibonacci sequencesDiophantine equationsEuler totient function

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Exponential Diophantine equations (11D61) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (2)

Power savings for counting solutions to polynomial-factorial equations ⋮ The Euler totient function on Lucas sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit bounds for primes in arithmetic progressions
• Fibonacci numbers at most one away from a perfect power
• Approximate formulas for some functions of prime numbers
• Common values of the arithmetic functions ϕ and σ
• On the Diophantine equation $ax^{2t}+bx^ty+cy^2=d$ and pure powers in recurrence sequences.
• On Divisors of Fermat, Fibonacci, Lucas, and Lehmer Numbers
• The Little Book of Bigger Primes
• On polynomial-factorial diophantine equations

This page was built for publication: Diophantine equations involving the Euler totient function