Re: Lucas super-pseudoprimes for Q <> 1
- Mike had difficulty posting and asked me to post this for him:
> Is the above, in essence, your conjectural method?Yes.
Here is my function of 3Nov10:-
if(f[ind,2]>1,res=0;break(1)); \\not squarefree
); \\end if
); \\end for ind
Now, how to prove this is kosher?...
I have already posted the "sufficient" part of the proof.
The "necessary" part is awaited ...
David (pp Mike)
- --- In firstname.lastname@example.org,
"mikeoakes2" <mikeoakes2@...> wrote:
> > My revised count up to 2*10^10 is 116.http://physics.open.ac.uk/~dbroadhu/cert/dbmo116.out
> My (original) count up to 2*10^10 was 105.
> So it must have missed 11, i.e. a bigger proportion.
gives my 116, in the format [n, factors, number of solutions]
With n < 2*10^10, the record-holder for the number of solutions is
[2214495361, [13, 17, 23, 29, 83, 181], 147407]
which googles quite nicely, linking to