

A290560


Generalized LucasCarmichael numbers for D=9697.


0



1, 35, 143, 323, 385, 455, 595, 665, 899, 935, 1045, 1295, 1547, 1729, 2639, 2737, 2821, 2915, 3289, 3689, 4355, 4465, 5005, 5183, 5291, 6479, 6721, 8855, 8911, 9215, 9361, 10153, 10439, 10465, 11305, 11663, 11951, 15841, 17119, 18095, 19981, 20909, 22607
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

On the set Lc(Z/NZ,D) = {(x,y) in (Z/NZ)^2 : x^2  Dy^2 = 1 (mod N)}, define an operation as follows: (x,y)x(z,w) = (xz+Dyw, xw+zy) (mod N). The set Lc(Z/NZ, D) endowed with this operation is a group. Moreover, the set of Lucas numbers endowed with this operation is a subgroup of Lc(Z/NZ, D).
The following results appear in Babinkostova, et al.: If q is a prime, then #Lc(Z/(q^e)Z, D) = (q(Dq))q^(e1).
The group Lc(Z/(q^e)Z, D) is cyclic for e > 0. This result was proven in Hinkel, 2007 for the case when e = 1. We showed that the statement is true for e > 1 (Babinkostova, et al.).
The following notions are introduced in Babinkostova, et al.: A composite integer N is a generalized Lucas pseudoprime (or Lucas pseudoprime in Babinkostova, et al.) to base P in Lc(Z/NZ, D) and integer D if (N(DN))P = O, where O is the identity of the group.
We define a composite integer N to be a generalized LucasCarmichael number if for all P in Lc(Z/NZ, D) it is true that (N(DN))P = O.
The following Korseltlike criterion holds for a generalized LucasCarmichael number: A composite number N is a generalized LucasCarmichael number if and only if N is squarefree and for every prime factor q of N, (q(Dq)) divides (N(DN)).
This sequence is a list of generalized LucasCarmichael numbers for D=9697.
For prime values of D less than 10000 and odd nonprime values of N less than 1000000, this is the longest sequence of generalized LucasCarmichael numbers.
The resulting sequence of generalized LucasCarmichael numbers is based on work done by L. Babinkostova, B. Bentz, M. I. Hassan, and H. Kim.


LINKS

Table of n, a(n) for n=1..43.
L. Babinkostova, B. Bentz, M. Hassan, A. HernándezEspiet, and H. J. Kim, Anomalous Primes and the Elliptic Korselt Criterion. (poster presentation)
R. Baillie and S. S. Wagstaff, Lucas Pseudoprimes, Mathematics of Computation, Vol. 35, (1980), 13911417.
D. M. Gordon and C. Pomerance, The distribution of Lucas and elliptic pseudoprimes, Mathematics of Computation, Vol. 57: 196, 825838.
D. E. Hinkel,An investigation of Lucas sequences, Master's theses, Boise State University (2007).
J. Smith, Solvability characterizations of Pell like equations, Master's theses, Boise State University (2009).
Sage program that computes the terms of the sequence: Generalized Lucas Pseudoprime Program


EXAMPLE

We will illustrate an example using the Korselt criterion for generalized Lucas pseudoprimes. Let us observe the second term, 35. Note that 35 = 5*7, so that it is squarefree. Now note that (5(96975)) = 6 and (7(96977)) = 6, both of which divide (35(969735)) = 36. Therefore, by the Korselt criterion for generalized Lucas pseudoprimes, we have that 35 is a generalized Lucas Carmichael number for D = 9697.


PROG

A program in Sage is given in the links section.


CROSSREFS

Cf. A005845, A164824, A217120, A217255, A217719, A227905.
Sequence in context: A157286 A324072 A327901 * A136017 A048628 A048629
Adjacent sequences: A290557 A290558 A290559 * A290561 A290562 A290563


KEYWORD

nonn


AUTHOR

André HernándezEspiet, Aug 06 2017


STATUS

approved



