关于十二素数基的强伪素数
Strong Pseudoprimes to Twelve Prime Bases
摘要:
设$ψ_m$是第一个$m$素基的最小强伪素数.该值是$1 \leq m \leq 11$的已知值。我们通过发现$ψ_{12}$和$ψ_{13}$来扩展这一点。我们还提出了一个算法,以找到所有的整数$n\le B$是强伪素数的第一$m$素数基地,一个合理的启发式假设,我们可以证明,它需要在最多$B^{2/3+o(1)}$时间。
英文摘要:
Let $ψ_m$ be the smallest strong pseudoprime to the first $m$ prime bases. This value is known for $1 \leq m \leq 11$. We extend this by finding $ψ_{12}$ and $ψ_{13}$. We also present an algorithm to find all integers $n\le B$ that are strong pseudoprimes to the first $m$ prime bases; with a reasonable heuristic assumption we can show that it takes at most $B^{2/3+o(1)}$ time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。