21812Re: generalised 6-selfridge double fermat+lucas
- Sep 14, 2010--- In firstname.lastname@example.org, "paulunderwooduk" <paulunderwood@...> wrote:
>Back to the drawing board:
> I will use capital letters to represent 2 by 2 matrices and lower case for integers.
> I call this "trivial" if r=0 (mod d) or r=+-1 (mod d) for some proper divisor "d" of a given "n", because the equation is cyclic.
> Now on to the double equations:
> I do not want x=+-y (mod d) because they will be identical for that divisor of "n".
> The composite test for "n" is:
> First find x and y:
> Secondly, check
> x^(n-1) == 1 (mod n)
> y^(n-1) == 1 (mod n)
> M^(n+1) == I (mod n)
> N^(n+1) == I (mod n)
> I have checked n<2*10^4 with gcd(30,n)==1,
- << Previous post in topic Next post in topic >>