加载中…
Let , , and denote the counting functions of cyclic, abelian, and nilpotent numbers not exceeding , respectively. Their asymptotic formulas have been established in recent work by Pollack and Just. In this paper, by adapting the methods of Pollack and Just, we study the distribution of these numbers in Beatty sequences , where is an irrational number of finite type and is a fixed real number. We prove that the counting functions , , and for cyclic, abelian, and nilpotent numbers in Beatty sequences satisfy asymptotic formulas that differ from those of Pollack and Just only by a factor .

生成讲解博客的中文版本

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