PERFECT POWERS WITH THREE DIGITS

DOI10.1112/S0025579313000107zbMath1372.11009MaRDI QIDQ3191155

Michael A. Bennett, Yann Bugeaud

Publication date: 24 September 2014

Published in: Mathematika (Search for Journal in Brave)

zbMATH Keywords

effective Diophantine approximationalgorithmic resolution of Thue equationsapplied \(p\)-adically, local methodshypergeometric method of Thue and Siegellower bounds for linear forms in complex and \(p\)-adic logarithms

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Exponential Diophantine equations (11D61) Linear forms in logarithms; Baker's method (11J86)

Related Items (7)

Products of integers with few nonzero digits ⋮ Squares with Three Nonzero Digits ⋮ Unnamed Item ⋮ On sparsity of representations of polynomials as linear combinations of exponential functions ⋮ On the digital representation of integers with bounded prime factors ⋮ On the Diophantine equation \(1 + 2^a + x^b = y^n\) ⋮ On the binary digits of \(n\) and \(n^2\)

Cites Work

• Unnamed Item
• On the method of Thue-Siegel
• On the Diophantine equation \({x^ n-1\over x-1}=y^ q\).
• The equations \(2^N\pm 2^M\pm 2^L=z^2\)
• Finiteness of odd perfect powers with four nonzero binary digits
• The equation xⁿ−1/x−1= y^q with x square
• Perfect powers with few binary digits and related Diophantine problems, II
• The diophantine equation x²=p^a±p^b+1
• The equation formula here has no solution with x square

This page was built for publication: PERFECT POWERS WITH THREE DIGITS