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.