Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T16:25:54.814Z Has data issue: false hasContentIssue false

ON THE BITS COUNTING FUNCTION OF REAL NUMBERS

Published online by Cambridge University Press:  01 August 2008

TANGUY RIVOAL*
Affiliation:
Institut Fourier, CNRS UMR 5582/Université Grenoble 1, 100 rue des Maths, BP 74, 38402 Saint-Martin d’Hères cedex, France (email: rivoal@ujf-grenoble.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.

Let Bn(x) denote the number of 1’s occurring in the binary expansion of an irrational number x>0. A difficult problem is to provide nontrivial lower bounds for Bn(x) for interesting numbers such as $\sqrt {2}$, e or π: their conjectural simple normality in base 2 is equivalent to Bn(x)∼n/2. In this article, amongst other things, we prove inequalities relating Bn(x+y), Bn(xy) and Bn(1/x) to Bn(x) and Bn(y) for any irrational numbers x,y>0, which we prove to be sharp up to a multiplicative constant. As a by-product, we provide an answer to a question raised by Bailey et al. (D. H. Bailey, J. M. Borwein, R. E. Crandall and C. Pomerance, ‘On the binary expansions of algebraic numbers’, J. Théor. Nombres Bordeaux16(3) (2004), 487–518) concerning the binary digits of the square of a series related to the Fibonacci sequence. We also obtain a slight refinement of the main theorem of the same article, which provides a nontrivial lower bound for Bn(α) for any real irrational algebraic number. We conclude the article with effective or conjectural lower bounds for Bn(x) when x is a transcendental number.

Information

Type
Research Article
Copyright
Copyright © 2008 Australian Mathematical Society