|
%I #43 Nov 08 2019 18:17:25
%S 561,1105,1729,1905,2047,2465,3277,4033,4681,6601,8321,8481,10585,
%T 12801,15841,16705,18705,25761,29341,30121,33153,34945,41041,42799,
%U 46657,49141,52633,62745,65281,74665,75361,80581,85489,87249,88357,90751,104653
%N Euler-Jacobi pseudoprimes: 2^((n-1)/2) == (2 / n) mod n, where (2 / n) is a Jacobi symbol.
%C Odd composite numbers n such that 2^((n-1)/2) == (-1)^((n^2-1)/8) mod n. - _Thomas Ordowski_, Dec 21 2013
%C Most terms are congruent to 1 mod 8 (cf. A006971). Among the first 1000 terms, the number of terms congruent to 1, 3, 5 and 7 mod 8 are 764, 47, 125 and 64, respectively. - _Jianing Song_, Sep 05 2018
%D R. K. Guy, Unsolved Problems in Number Theory, A12.
%D H. Riesel, Prime numbers and computer methods for factorization, Progress in Mathematics, Vol. 57, Birkhauser, Boston, 1985.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes the subsequence A006971).
%H Amiram Eldar, <a href="/A047713/b047713.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from T. D. Noe)
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Euler-JacobiPseudoprime.html">Euler-Jacobi Pseudoprime.</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Pseudoprime.html">Pseudoprime.</a>
%H <a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>
%t Select[ Range[ 3, 105000, 2 ], Mod[ 2^((# - 1)/2) - JacobiSymbol[ 2, # ], # ] == 0 && ! PrimeQ[ # ] & ]
%o (PARI) is(n)=n%2 && Mod(2,n)^(n\2)==kronecker(2,n) && !isprime(n) \\ _Charles R Greathouse IV_, Dec 20 2013
%Y Cf. A002997, A001567, A048950.
%Y Terms in this sequence satisfying certain congruence: A270698 (congruent to 1 mod 4), A270697 (congruent to 3 mod 4), A006971 (congruent to +-1 mod 8), A244628 (congruent to 3 mod 8), A244626 (congruent to 5 mod 8).
%K nonn,nice
%O 1,1
%A _N. J. A. Sloane_, _Richard Pinch_ and _Robert G. Wilson v_
%E Corrected by _Eric W. Weisstein_; more terms from _David W. Wilson_
|
