50
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

A Fancy Way to Obtain the Binary Digits of 759250125√2

Pages 611-617 | Published online: 13 Dec 2017
 

Abstract

R. L. Graham and H. O. Pollak observed that the sequence has the curious property that the sequence of numbers (u2n+1 − 2u2n-1)n ≥ 1 gives the binary digits of √2. We present an extension of the Graham-Pollak sequence which allows us to get—in a fancy way—the binary digits of 759250125√2 and other numbers.

Additional information

Notes on contributors

Thomas Stoll

THOMAS STOLL received his Ph.D. from Graz University of Technology (Austria) in 2004. Currently, he is Maître de Conférences at the Université de la Méditerranée, Marseille (France). When he is not doing mathematics, he is playing the bassoon and enjoying foreign languages.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.