首页 | 本学科首页   官方微博 | 高级检索  
    按 检索      


Solutions of the congruence
Authors:Wilfrid Keller  Jö  rg Richstein
Institution:Universität Hamburg, 20146 Hamburg, Germany ; Department of Mathematics and Statistics, Dalhousie University, Halifax, Nova Scotia B3H 3J5, Canada
Abstract:To supplement existing data, solutions of $a^{p-1} \equiv 1 \pmod {p^2}$ are tabulated for primes $a, p$with $100 < a < 1000$ and $10^4 < p < 10^{11}$. For $a < 100$, five new solutions $p > 2^{32}$ are presented. One of these, $p = 188748146801$ for $a = 5$, also satisfies the ``reverse' congruence $p^{a-1} \equiv 1 \pmod {a^2}$. An effective procedure for searching for such ``double solutions' is described and applied to the range $a < 10^6$, $p <\max\, (10^{11}, a^2)$. Previous to this, congruences $a^{p-1} \equiv 1 \pmod {p^r}$ are generally considered for any $r \ge 2$ and fixed prime $p$ to see where the smallest prime solution $a$ occurs.

Keywords:Fermat quotient  Diophantine equation  primitive roots  large primes
点击此处可从《Mathematics of Computation》浏览原始摘要信息
点击此处可从《Mathematics of Computation》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号