All Questions

Let $M \ge 2$. Inspired by the Collatz iteration / algorithm ($M=2$), I tried the following function: $$C_M(n) = n/M, \text{ if } n \equiv 0 \mod M, \text{ otherwise } (M+1)n+\{(M-n) \mod M \}$$ We ...

Above the Comments in the article continued fraction of algebraic numbers, there are some words on the unboundedness/cycle of coefficients of continued fraction of algebraic numbers "Thus, ...