1
$\begingroup$

Starting with the fascinating question of Sebastien Palcoux Unexpected behavior involving √2 and parity let now $\alpha \not= \sqrt 2$ and consider the map

$$f: n \mapsto \left\{ \begin{array}{ll} \left \lfloor{n/\alpha} \right \rfloor \text{ if } n \text{ even,} \\ \left \lfloor{n \cdot \alpha} \right \rfloor \text{ if } n \text{ odd.} \end{array} \right.$$ As in the question of Palcoux let $f^{k+1} := f \circ f^k$ and consider the sequence $(f^k(73) \colon k \in \mathbb{N})$. As noted in the comments to Palcoux questions the sequence with $\alpha = \sqrt 2$ does not seem to be bounded. I tried some randomly chosen $\alpha = \sqrt {1.9}, \sqrt 3, \sqrt {2.1}, \ldots$. In all these cases the sequence was bounded and ended sometimes with $1$.

Is there any reason why the case $\alpha = \sqrt 2$ is so special?

$\endgroup$
1
  • 2
    $\begingroup$ Thanks! You should have a look to my previous post: mathoverflow.net/q/353434/34538 which asks this question in general, and to my next one: mathoverflow.net/q/353524/34538 showing that such unboundedness happens (and is proved by Lucia in comment) with the golden ratio (and a family of quadratic algebraic integers), but much more strongly. What is mysterious with √2 is that it provides something intermediate. $\endgroup$ Feb 26, 2020 at 19:12

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.