On the binary digits of 2
From MaRDI portal
Publication:5384240
Abstract: We show that the number of 's in the first digits of the binary expansion of is at least and show that this bound can be improved to around infinitely often.
Recommendations
Cites work
- Distribution modulo one and Diophantine approximation
- Non-zero digits in the expansion of irrational algebraic numbers in an integer base
- On the b-ary expansions of algebraic irrational numbers (survey)
- ON THE BINARY DIGITS OF ALGEBRAIC NUMBERS
- On the binary expansions of algebraic numbers
- ON THE BITS COUNTING FUNCTION OF REAL NUMBERS
Cited in
(9)- Ordering of nested square roots of 2 according to the Gray code
- On simultaneous binary expansions of \(n\) and \(n^2\)
- scientific article; zbMATH DE number 2186909 (Why is no real title available?)
- A fancy way to obtain the binary digits of 759250125 2
- A Nonlinear Recurrence Yielding Binary Digits
- scientific article; zbMATH DE number 38424 (Why is no real title available?)
- The googol-th bit of the Erdős-Borwein constant
- On the size of a restricted sumset with application to the binary expansion of \(\sqrt{d}\)
- Sparse binary cyclotomic polynomials
This page was built for publication: On the binary digits of \(\sqrt{2}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384240)