Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T11:38:29.403Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  16 August 2012

MICHAEL A. BENNETT
Affiliation:
Department of Mathematics, University of British Columbia, Vancouver, B.C. Canada V6T 1Z6. e-mail: bennett@math.ubc.ca
YANN BUGEAUD
Affiliation:
Mathématiques, Université de Strasbourg, 7, rue René Descartes, 67084 Strasbourg, France. e-mail: yann.bugeaud@math.unistra.fr, maurice.mignotte@math.unistra.fr
MAURICE MIGNOTTE
Affiliation:
Mathématiques, Université de Strasbourg, 7, rue René Descartes, 67084 Strasbourg, France. e-mail: yann.bugeaud@math.unistra.fr, maurice.mignotte@math.unistra.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We prove that if q ≥ 5 is an integer, then every qth power of an integer contains at least 5 nonzero digits in its binary expansion. This is a particular instance of one of a collection of rather more general results, whose proofs follow from a combination of refined lower bounds for linear forms in Archimedean and non-Archimedean logarithms with various local arguments.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 2012