Proceedings of the American Mathematical Society

			Journals Home Search Author Info Subscribe Tech Support Help
ISSN 1088-6826 (e) ISSN 0002-9939 (p)

Previous issue \| Table of contents \| Next issue Articles in press \| Recently posted articles \| Most recent issue \| All issues Next Article

On the solutions of the congruence $n^{2}\equiv 1~(mod~\phi ^{2}(n))$

Author(s): Florian Luca; Michal Krizek
Journal: Proc. Amer. Math. Soc. 129 (2001), 2191-2196.
MSC (2000): Primary 11A07, 11A25, 11D09
Posted: January 17, 2001
Retrieve article in: PDF
This article is available free of charge

Abstract | References | Similar articles | Additional information

Abstract:

In this note, we show that if is a positive integer satisfying the congruence $n^{2}\equiv 1~ (mod~\phi ^{2}(n))$ , then $n\le 3$ .

References:

1.: R.D. Carmichael: On the numerical factors of the arithmetic forms $\alpha ^{n}+\beta ^{n}$ , Ann. of Math. 2 (15) (1913), 30-70.
2.: R.K. Guy: Unsolved problems in number theory, Springer-Verlag, 1994. MR 96e:11002
3.: L.K. Hua: Introduction to number theory, Springer-Verlag, 1982. MR 83f:10001
4.: H.L. Montgomery, R.C. Vaughan: On the large sieve, Mathematika 20 (1973), 119-134. MR 51:10260
5.: C. Pomerance: On composite for which $\phi (n) \vert n-1$ , Acta Arith. 28 (1976), 387-389; II Pacific J. Math. 69 (1977), 177-186. MR 52:13608; MR 55:7901
6.: J.B. Rosser, L. Schoenfeld: Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64-94. MR 25:1139


	Comments: webmaster@ams.org © Copyright 2009, American Mathematical Society Privacy Statement		Search the AMS