加载中…
We investigate the additive theory of the set when is a real number. In the language of additive combinatorics, we determine the asymptotic behaviour of the additive energy of . When is rational, this is either known, or follows from existing results, and our contribution is a resolution of the irrational case. We deduce that for all , the cardinality of the sumset asymptotically attains its natural upper bound , as . We show that there are infinitely many, effectively computable numbers such that the set \{p^c : \textrm{pprime}\} is additively dissociated (actually linearly independent over ), and we provide an effective procedure to compute the digits of such .

生成讲解博客的中文版本

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