On the congruence $2^ {n-k}\equiv 1\;(\textrm {mod} n)$
HTML articles powered by AMS MathViewer
- by Mok-Kong Shen PDF
- Math. Comp. 46 (1986), 715-716 Request permission
Abstract:
It is shown that there are infinitely many positive integers k such that the congruence ${2^{n - k}} \equiv 1\;\pmod n$ has infinitely many solutions n.References
- A. Rotkiewicz, On the congruence $2^{n-2}\equiv 1(\textrm {mod\,}n)$, Math. Comp. 43 (1984), no. 167, 271–272. MR 744937, DOI 10.1090/S0025-5718-1984-0744937-1 L. E. Dickson, History of the Theory of Numbers, Vol. 1, Chelsea, New York, 1971, p. 93.
Additional Information
- © Copyright 1986 American Mathematical Society
- Journal: Math. Comp. 46 (1986), 715-716
- MSC: Primary 11A07
- DOI: https://doi.org/10.1090/S0025-5718-1986-0829641-5
- MathSciNet review: 829641