arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.05974math.NTmath.CO
收藏

几乎所有的素数都有小汉明重量的倍数

Almost all primes have a multiple of small Hamming weight

Christian Elsholtz

摘要:

Bourgain和Shparlinski最近的研究结果表明,对于几乎所有的素数$p$,都存在一个多重的$mp$,它可以用二进制写成$mp= 1+2^{m_1}+ \cdots +2^{m_k}, \quad 1\leq m_1 < \cdots < m_k,$和$k=66$或$k=16$。我们表明,$k=6$(对应于汉明重量$7$)足够。我们还证明了存在无穷多个素数$p$,其乘法子群$A=<g>\subset \mathbb{F}_p^*$,对于某些$g \in \{2,3,5\}$,大小为$|A|\gg p/(\log p)^3$,其中和积集$A\cdot A+ A\cdot A$不完全覆盖$\mathbb{F}_p$.

英文摘要:

Recent results of Bourgain and Shparlinski imply that for almost all primes $p$ there is a multiple $mp$ that can be written in binary as $mp= 1+2^{m_1}+ \cdots +2^{m_k}, \quad 1\leq m_1 < \cdots < m_k,$ with $k=66$ or $k=16$, respectively. We show that $k=6$ (corresponding to Hamming weight $7$) suffices. We also prove there are infinitely many primes $p$ with a multiplicative subgroup $A=<g>\subset \mathbb{F}_p^*$, for some $g \in \{2,3,5\}$, of size $|A|\gg p/(\log p)^3$, where the sum-product set $A\cdot A+ A\cdot A$ does not cover $\mathbb{F}_p$ completely.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑