Perfect powers with few binary digits and related Diophantine problems, II

DOI10.1017/S0305004112000345MaRDI QIDQ4649449zbMATH OpenFDO

Authors Michael A. Bennett, Maurice Mignotte, Yann Bugeaud

Publication date 22 November 2012

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0305004112000345

zbMATH Keywords

digital expansionslinear forms in logarithmsperfect powers

Mathematics Subject Classification ID

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

Recommendations

• Perfect powers with few binary digits and related Diophantine problems
• A diophantine equation concerning finite groups
• On the equation y^x x^y=z^2
• On some exponential equations of S. S. Pillai
• A note on the diophantine equation x² + 7 = yⁿ
• On the diophantine equations x² + 74 = y⁵ and x² + 86 = y⁵
• scientific article; zbMATH DE number 1182982
• On the Diophantine equation \(a\frac{x^n-1}{x-1}=y^q\).
• A note on the diophantine equation $x² + b^y = c^z$
• A note on the equation $ax^n - by^n = c$

Cites work

• Applications of the hypergeometric method to the generalized Ramanujan-Nagell equation
• Linear forms in p-adic logarithms and the Diophantine equation formula here
• Linear forms in two logarithms and interpolation determinants
• Linear forms in two logarithms and interpolation determinants II
• The diophantine equation x²=p^a±p^b+1
• The equations 2N 2M 2L=z^2
• Two exponential Diophantine equations

Cited in

(18)

• The polynomial-exponential equation \(1 + 2^a + 6^b = y^q\)
• On the digital representation of integers with bounded prime factors
• On sparse perfect powers
• On the binary digits of \(n\) and \(n^2\)
• Products of integers with few nonzero digits
• On a conjecture of Schäffer concerning the equation \(1^k + \ldots + x^k = y^n\)
• Finiteness of odd perfect powers with four nonzero binary digits
• Bennett's Pillai theorem with fractional bases and negative exponents allowed
• A Hasse-type principle for exponential Diophantine equations and its applications
• Perfect powers in q-binomial coefficients
• Perfect powers with three digits
• On the digital representation of smooth numbers
• Squares with Three Nonzero Digits
• Effective irrationality measures for real and p-adic roots of rational numbers close to 1, with an application to parametric families of Thue–Mahler equations
• Perfect powers with few ternary digits
• Perfect powers with few binary digits and related Diophantine problems
• Powers of 3 with few nonzero bits and a conjecture of Erdős
• On the Diophantine equation 1 + 2a + x^b = y^n

This page was built for publication: Perfect powers with few binary digits and related Diophantine problems, II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649449)