Re: Exhaustive Search

From: Doug Goncz (dgoncz_at_aol.com.bat.exe)
Date: 07/20/04 

Date: Tue, 20 Jul 2004 15:00:03 +0000 (UTC)

Errata:

>For N = some minimum n,
>C.n = c,

C.N=c

>I also found that for a v > N,
>
>C.v = C.0 = 2 and that that v was a factor of c-1.

On closer inspection of the out table, this is shown not to be the case. That
would imply that a^(c-1) mod c = 1 which is only true by Fermat's Little
Theorem and the Euler Totient Theorem for prime c.

Also I note that 17% of the triples tested were pairwise coprime and therefore
candidates. This is related to Ape'ry's constant, but doesn't seem meaningful
to me.

I also notice but have not veryified

N = v - k*N

relating v and N, but without the link to c, this is not of interest.

A search to lim = 100 has been running 15 minutes as I write this.

>http://users.aol.com/DGoncz/Publications/Exhaustive.bmp

After the run, I'll post the latest version as Exhaustive2.bmp

Yours,

Doug Goncz ( ftp://users.aol.com/DGoncz/ )
Student member SAE for one year.
Loves in my life: Dona, Jeff, Kim, Mom, Neelix, Tasha, and Teri.