No label defined (Q3024031)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2186909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2186909 |
Statements
11 July 2005
0 references
Graham-Pollak sequence
0 references
nonlinear recurrence
0 references
digits
0 references
0.9241726398468018
0 references
0.9236292839050292
0 references
0.8651543855667114
0 references
0.8174490332603455
0 references
0.7781462073326111
0 references
Let \(d_n\) be the \(n\)th digit in the binary expansion of \(\sqrt{2}\). Let \((u_n)\) be the sequence defined by \(u_1= 1\), and \(\forall n\geq 1\), \(u_{n+1}= \lfloor\sqrt{2}(u_n+{1\over 2})\rfloor\). \textit{R. L. Graham} and \textit{H. O. Pollak} proved in [Math. Mag. 43, 143--145 (1970; Zbl 0201.04705)] that \(d_n= u_{2n+1}- 2u_{2n-1}\). Several authors studied generalizations of this curious property. In the paper under review the author proves the following nice result: let \(w>0\) be a real number and \(g\geq 2\) be an integer. Let \(t= w/g^m\), where \(m= \lfloor\log_g w\rfloor\), and \(a= {g\over (g-1)(t+ g)}\), \(b={g\over a}\). Define the sequence \((u_n)_{n\geq 1}\), by \(u_1= 1\) and \[ u_{n+1}= \begin{cases} \lfloor a(u_n+ \varepsilon)\rfloor\quad &\text{if }n\text{ is odd}\\ \lfloor b(u_n+ 1/(g-1))\rfloor\quad &\text{if }n\text{ is even},\end{cases} \] where \(-1/g\leq\varepsilon< (g+1)(g-2)/g\). Then \(u_{2n+1}- gu_{2n-1}\) is the \(n\)th digit base \(g\) of \(w\).
0 references