加载中…
It is well known that is the generating function of the Prouhet-Thue-Morse sequence , where is the sum of (binary) digits of . Let be an integer. In 2018, Gawron, Miska and Ulas initiated the study of arithmetic properties of power series expansion of the function and proposed a conjecture stating that for any given integer , the sequence is unbounded. In this paper, we introduce a new method to investigate this conjecture. In fact, by making use of algebraic, -adic and analytic methods, we show that the Gawron-Miska-Ulas conjecture is true.

生成讲解博客的中文版本

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