In this paper, our main focus is expressing real numbers on the non-integer bases. We denote those bases as ’s, which is also a real number and . This project has 3 main parts. The study of expansions of real numbers in such bases and algorithms for generating them will contribute to the first part of the paper. In this part, firstly, we will define those expansions as the sums of fractions with ’s or ’s in the nominator and powers of in the denominator. Then we will focus on the sequences of ’s and ’s generated by the nominators of in the sums we mentioned above. Such sequences will be called throughout the paper. In the second half, we will study the results in the first chapter of \cite{erdos1990characterization}, namely the greedy and lazy -expansions . The last part of the paper will be on the characterisation of lazy expansion of 1, which was the first open question at the end of . I still don’t know if that problem has been solved already. However, the solution that was presented here is the original work of mine.

生成讲解博客的中文版本

生成AI智能校验的中文版本