On the congruence 2ⁿ⁻²≡1(𝑚𝑜𝑑𝑛)

On the congruence $2^{n-2}\equiv 1(\textrm {mod }n)$
HTML articles powered by AMS MathViewer

by A. Rotkiewicz PDF

Math. Comp. 43 (1984), 271-272 Request permission

There exist infinitely many positive integers n such that ${2^{n - 2}} \equiv 1\;\pmod n$.

References

Old and New Problems and Results in Combinatorial Number Theory

Richard K. Guy, Unsolved problems in number theory, Problem Books in Mathematics, Springer-Verlag, New York-Berlin, 1981. MR 656313
A. Mąkowski, Generalization of Morrow’s $D$ numbers, Simon Stevin 36 (1962/63), 71. MR 146136
D. C. Morrow, Mathematical Notes: Some Properties of D Numbers, Amer. Math. Monthly 58 (1951), no. 5, 329–330. MR 1527863, DOI 10.2307/2307722
A. Rotkiewicz, Pseudoprime numbers and their generalizations, University of Novi Sad, Student Association of the Faculty of Sciences, Novi Sad, 1972. MR 0330034
A. Rotkiewicz, Un problème sur les nombres pseudo-premiers, Nederl. Akad. Wetensch. Proc. Ser. A 75=Indag. Math. 34 (1972), 86–91 (French). MR 0302545, DOI 10.1016/1385-7258(72)90033-9
K. Zsigmondy, Zur Theorie der Potenzreste, Monatsh. Math. Phys. 3 (1892), no. 1, 265–284 (German). MR 1546236, DOI 10.1007/BF01692444