Hi Brian,
You want to be astonished? You will be !
First, the factorization code that I have made, has
NOTHING DIRECTLY RELATED to do with my new theory,
I have only build and use it to CHECK my theory.
Secondly, you say that mprime/Prime95 made a "single
division" in about one microsecond, yes, I agree with
you, but what you FORGET to say, is that BEFORE making
only one division it take MANY hours (I have forget
exactly how many) to build a basis and made a FFT
(You correct me if it's not the case, because I'm
not a specialist to build codes of factorization
using FFT method).
NOTHING DIRECTLY RELATED to do with my new theory,
I have only build and use it to CHECK my theory.
Secondly, you say that mprime/Prime95 made a "single
division" in about one microsecond, yes, I agree with
you, but what you FORGET to say, is that BEFORE making
only one division it take MANY hours (I have forget
exactly how many) to build a basis and made a FFT
(You correct me if it's not the case, because I'm
not a specialist to build codes of factorization
using FFT method).
Factorization codes with FFT are interesting when
you made a LOT of divisions for the SAME Mersenne
number. Factorization codes with traditionnal
boolean aritmetic of division is interesting when
you are making only a FEW divisions (or only one)
for a given Mersenne number.
The use of one or the other of these two kind of
codes DEPEND what you want to do.
you made a LOT of divisions for the SAME Mersenne
number. Factorization codes with traditionnal
boolean aritmetic of division is interesting when
you are making only a FEW divisions (or only one)
for a given Mersenne number.
The use of one or the other of these two kind of
codes DEPEND what you want to do.
My theory, to say with certainty if a number CANNOT
divide or is a POTENTIAL divisor, take only a fraction
of a second (WITHOUT ANY LONG TIME OF PREPARATION)
divide or is a POTENTIAL divisor, take only a fraction
of a second (WITHOUT ANY LONG TIME OF PREPARATION)
But as I have already say, this time to make the
<<test>> is really not important, compare to the
HUGE theoretical importance of what I have found.
Now, You will to be astonished?
I CAN SOLVED IN A FULLY DETERMINISTIC WAY THE STEP 3
(see my previous mail of the 2 september for explainations)
for SPECIFIC conditions (and these conditions are
frequently verified).
<<test>> is really not important, compare to the
HUGE theoretical importance of what I have found.
Now, You will to be astonished?
I CAN SOLVED IN A FULLY DETERMINISTIC WAY THE STEP 3
(see my previous mail of the 2 september for explainations)
for SPECIFIC conditions (and these conditions are
frequently verified).
SO:
IF I HAVE A PRIME NUMBER VERIFYING STEP 1
AND IF STEP 2 IS ALSO VERIFIED
AND IF STEP 3 IS ALSO VERIFIED (UNDER SPECIFIC
RESTRICTIONS)
AND IF STEP 2 IS ALSO VERIFIED
AND IF STEP 3 IS ALSO VERIFIED (UNDER SPECIFIC
RESTRICTIONS)
THEN, THIS NUMBER DIVIDE WITH ABSOLUTE CERTAINTY
THE CORRESPONDING MERSENNE NUMBER !!!!!!
(of course without making any division of
the Mersenne number)
THE CORRESPONDING MERSENNE NUMBER !!!!!!
(of course without making any division of
the Mersenne number)
Sorry to have omit to say that, but the less I say about
my theory the less clues I give to avoid a preliminary
disclosure.
I can give hundred of million of such divisors for Mersenne
number M(p) corresponding to prime p up to 10^13 (I insisted
that this limitation, is only due to the fact that I'm TOO LAZI
to build a program in arbitrary precision for the test.
I don't want to spent my precious time to do that, because
it seems to me not very interesting.
my theory the less clues I give to avoid a preliminary
disclosure.
I can give hundred of million of such divisors for Mersenne
number M(p) corresponding to prime p up to 10^13 (I insisted
that this limitation, is only due to the fact that I'm TOO LAZI
to build a program in arbitrary precision for the test.
I don't want to spent my precious time to do that, because
it seems to me not very interesting.
If you want to be even more astonished, give me a very
interesting reward (attention, I am really very greedy!).
The theory that I have found could be the ultimate one for
Mersenne numbers (I have a lot of indications of that)
Most of the basics conditions (divisors are of the form 2pj+1,
mod(divisor,8)=1,7 for 2^p+1 ...) are know for centuries,
and we have made no really breaktrougth since that.
Of course (to be a little more serious, now), for a reward,
as I have already say, I aggree to FULLY disclosed my
theory BEFORE.
I will analyse the rest of your e-mail during this week-end.
Regards,
interesting reward (attention, I am really very greedy!).
The theory that I have found could be the ultimate one for
Mersenne numbers (I have a lot of indications of that)
Most of the basics conditions (divisors are of the form 2pj+1,
mod(divisor,8)=1,7 for 2^p+1 ...) are know for centuries,
and we have made no really breaktrougth since that.
Of course (to be a little more serious, now), for a reward,
as I have already say, I aggree to FULLY disclosed my
theory BEFORE.
I will analyse the rest of your e-mail during this week-end.
Regards,
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]
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]
Cr�ez gratuitement votre Yahoo! Mail avec 100 Mo de stockage !
Cr�ez votre Yahoo! Mail
Le nouveau Yahoo! Messenger est arriv� ! D�couvrez toutes les nouveaut�s pour dialoguer instantan�ment avec vos amis. T�l�chargez GRATUITEMENT ici !
_______________________________________________ Prime mailing list [EMAIL PROTECTED] http://hogranch.com/mailman/listinfo/prime
