Hi Dan,
I understand perfectly you are skeptic. To announce a so big
theoretical breakthrough when so many people have try to find it,
it is really difficult to understand that. In my previous mail I
have explain probably why nobody has find this theory to this date:
> The new Mersenne numbers theory need to be found:
> - to have time (a lot).
> - to have good knowledge of mathematics.
> - to be an expert in advance fortran or C programation.
> - to have a HUGE amount of supercomputer time ( I took approximately
> 20 year CPU time).
> - and of course never give up and be VERY VERY lucky.
I took about 9 year to find that, I have a Phd in theoretical atomic
physics, my Phd consisted essentialy to build huge and fast fortran codes
executed on supercomputer. I work actually on a meteorological institute
where I have a tremendous big amount of computer time. And finaly I believed
9 year ago, that a <<super theory>> of Mersenne number exist, it was a
bet for me.
Now I will answer precisely at your specific questions:
>
> 1.Can your theory support all known Mersenne numbers found to date?
My theory is completely general, for 2^p-1 and 2^p+1, I can prove and
there is of course no exceptions. Because I'm also a skeptic, I have
build, for instance, a specific ultrafast program (of factorization) and
I have check for p up to 1000 billion. I have pushed all the sub-relations
that I have found to date, to very very large values of parameters with
never an exception.
>
> 2.Can it compute faster than current methods to prove these numbers?
I suppose you mean that the new tests I have found are faster than the
Lucas-Lehmer test?
Right now, I have no idea! It's because I'm concentrate essentially
on the FUNDAMENTAL theoretical interest of what I have found.
>
> 3.Does it offer some hope of speed in factoring known composites?
Again the same answer, I have no idea! Most probably yes. But this is a very
promising way to construct HUGE prime number, wich are not of the Mersenne
form in an easy way (cheap computer time costly).
What I have found is very basic and give also an ADDITIONAL restriction
to the traditionnal restrictions: div=2*p*j+1 for 2^p-1 and mod(div,8)=1,7;
a prime number divides at most one prime-exponent Mersenne ...
It as a BIG theoretical impact.
>
> 4.Can it predict and confirm a new Mersenne prime in advance of those being
tested?
If you mean faster, again I have no idea.
Actually I found nearly daily new sub-relations. And It's becomming to much
for me alone to investigate fully all of them.
I'm searching a group at a university where I can continue on contract,
or if there is an interesting proposition of reward I will disclosed what
I have found, or any other good propositions are welcome.
Of course, I fully accept that my theory will be peer-reviewed before, as
all international publications I have made to date.
Dr Olivier LATINNE
Departement of Applied Meteorology,
Royal Institute of Meteorology of Belgium,
Belgium
Tel: + 32 2 373 67 45 (work)
Mobile: + 32 478 344 340
e-mail [EMAIL PROTECTED]
_______________________________________________
Prime mailing list
[EMAIL PROTECTED]
http://hogranch.com/mailman/listinfo/prime
