Squares with Three Nonzero Digits

DOI10.1007/978-3-319-55357-3_4zbMath1414.11046arXiv1610.09830OpenAlexW2545066301MaRDI QIDQ4581320

Michael A. Bennett, Adrian-Maria Scheerer

Publication date: 17 August 2018

Published in: Number Theory – Diophantine Problems, Uniform Distribution and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Diophantine inequalities (11J25) Radix representation; digital problems (11A63) Exponential Diophantine equations (11D61)

Related Items (1)

A note on the Diophantine equation \(x^2 =4p^n -4p^m +\ell^2\)

Cites Work

• The sum of digits of squares
• On a problem of Gelfond: the sum of digits of prime numbers
• Sur la fonction sommatoire de la fonction 'somme des chiffres'
• Applications of the hypergeometric method to the generalized Ramanujan-Nagell equation
• The equations \(2^N\pm 2^M\pm 2^L=z^2\)
• Finiteness of odd perfect powers with four nonzero binary digits
• Stolarsky’s conjecture and the sum of digits of polynomial values
• THE SUM OF DIGITS OF n AND n²
• PERFECT POWERS WITH THREE DIGITS
• Mordell’s equation: a classical approach
• Products of Prime Powers in Binary Recurrence Sequences Part I: The Hyperbolic Case, with an Application to the Generalized Ramanujan-Nagell Equation
• On the generalized Ramanujan-Nagell equation I
• On the generalized Ramanujan-Nagell equation, II
• The Binary Digits of a Power
• On the diophantine equation $f(a^m,y)=b^n$
• Perfect powers with few binary digits and related Diophantine problems, II
• The diophantine equation x²=p^a±p^b+1
• Perfect Powers with Few Ternary Digits
• Perfect powers with few binary digits and related Diophantine problems

This page was built for publication: Squares with Three Nonzero Digits