TOPICS
Search

Euler-Jacobi Pseudoprime


An Euler-Jacobi pseudoprime to an integer base a is an odd composite number n such that a and n are relatively prime and the Jacobi symbol (a/n) satisfies

 (a/n)=a^((n-1)/2) (mod n)

(Guy 1994; but note that Guy calls these simply "Euler pseudoprimes"). No odd composite number is an Euler-Jacobi pseudoprime for all bases a relatively prime to it. This class includes some Carmichael numbers and all strong pseudoprimes to base a. Every Euler-Jacobi pseudoprime to base a is an Euler pseudoprime to that base, but the converse need not hold. For each fixed n, at most half of the bases a with 1<=a<n and GCD(a,n)=1 pass the defining congruence.

The first few base-2 Euler-Jacobi pseudoprimes are 561, 1105, 1729, 1905, 2047, 2465, ... (OEIS A047713), and the first few base-3 Euler-Jacobi pseudoprimes are 121, 703, 1729, 1891, 2821, 3281, 7381, ... (OEIS A048950). The numbers of base-2 Euler-Jacobi pseudoprimes less than 10^2, 10^3, ... are 0, 1, 12, 36, 114, ... (OEIS A055551).


See also

Euler Pseudoprime, Pseudoprime

Explore with Wolfram|Alpha

References

Guy, R. K. "Pseudoprimes. Euler Pseudoprimes. Strong Pseudoprimes." §A12 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 27-30, 1994.Pinch, R. G. E. "The Pseudoprimes up to 10^(13)." In Algorithmic Number Theory. Proceedings of the 4th International Symposium (ANTS-IV) Held at the Universiteit Leiden, Leiden, July 2-7, 2000 (Ed. W. Bosma). Berlin, Germany: Springer-Verlag, pp. 459-473, 2000. https://doi.org/10.1007/10722028_30.Riesel, H. Prime Numbers and Computer Methods for Factorization, 2nd ed. Boston, MA: Birkhäuser, 1994.Sloane, N. J. A. Sequences A047713, A048950, and A055551 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Euler-Jacobi Pseudoprime

Cite this as:

Weisstein, Eric W. "Euler-Jacobi Pseudoprime." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Euler-JacobiPseudoprime.html

Subject classifications