A Nonlinear Recurrence Yielding Binary Digits
Among others the following nice theorem is proved: For a given positive real number \(w\) let \(b=(2^{m+1}+w)/(2^ m+w)\) and \(a=2/b\), where \(m=[\log_ 2w]\). Define a sequence \(u_ n\) by the recurrence \(u_ 1=1\), \(u_{n+1}=[a(u_ n+1/2)]\) if \(n\) is odd and \(u_{n+1}=[b(u_ n+1/2)]\) if \(n\) is even. Then \(u_{2n+1}-u_{2n}=2^{n-1}\) and \(u_{2n+1}-2u_{2n-1}\) is the \(n\)-th digit in the binary expansion of \(w\). This is a generalization of a result of \textit{R. L. Graham} and \textit{H. O. Pollak} [Math. Mag. 43, 143--145 (1970; Zbl 0201.04705)], they proved the above theorem for \(w=\sqrt 2\).
This page was built for publication: A Nonlinear Recurrence Yielding Binary Digits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984190)