Bits of \(3^n\) in binary, Wieferich primes and a conjecture of Erdős

DOI10.1016/J.JNT.2015.05.022zbMath1339.11006OpenAlexW1244140038WikidataQ123356640 ScholiaQ123356640MaRDI QIDQ495292

David E. Weirich, Taylor Dupuy

Publication date: 9 September 2015

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

Full work available at URL: https://doi.org/10.1016/j.jnt.2015.05.022

zbMATH Keywords

Erdős conjectureWieferich primes

Mathematics Subject Classification ID

Radix representation; digital problems (11A63)

Related Items (4)

Pseudorandom sequences derived from automatic sequences ⋮ Digit expansions of numbers in different bases ⋮ On subwords in the base-$q$ expansion of polynomial and exponential functions ⋮ ABC implies there are infinitely many non-Fibonacci-Wieferich primes

Cites Work

• Unnamed Item
• Unnamed Item
• Wieferich's criterion and the abc-conjecture
• Wieferich past and future
• Old and new conjectured diophantine inequalities
• Ternary expansions of powers of 2
• Some unconventional problems in number theory
• A search for Wieferich and Wilson primes

This page was built for publication: Bits of \(3^n\) in binary, Wieferich primes and a conjecture of Erdős