Author:
Katre S. A.,Rajwade A. R.
Abstract
Let e be an integer ≧ 2, and p a prime = 1 (mod e). Euler's criterion states that for D ∊ Z,(1.1)if and only if D is an e-th power residue (mod p). If D is not an e-th power (mod p), one has(1.2)for some e-th root α(≠1) of unity (mod p). Sometimes expressions for roots of unity (mod p) can be given in terms of quadratic partitions of p. For example,(1.3)are the four distinct fourth roots of unity (mod p) for a prime p ≡ 1 (mod 4) in terms of a solution (a, b) of the diophantine system(a, b unique), whereas for p ≡ 1 (mod 3), a solution (L, M) of the systemgives(1.4)as the three distinct cuberoots of unity (mod p).
Publisher
Canadian Mathematical Society
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Euler’s criterion for prime order in the PID case;Acta Arithmetica;2020
2. Euler’s criterion for eleventh power nonresidues;Proceedings - Mathematical Sciences;2019-04-25
3. EULER'S CRITERION FOR SEPTIC NONRESIDUES;International Journal of Number Theory;2010-09
4. An indeterminate in number theory;Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics;1989-06