mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 14 of 14
Search took 0.01 seconds.
Search: Posts Made By: boldi
Forum: Miscellaneous Math 2014-04-15, 18:39
Replies: 74
Views: 5,533
Posted By boldi
Please, please, please. Calm down. Please...

Please, please, please.

Calm down. Please realize, that there is no counterexample.

The conjecture is still valid.

In the data that Mayer has posted, you will not find a counterexample. He...
Forum: Miscellaneous Math 2014-04-15, 10:19
Replies: 74
Views: 5,533
Posted By boldi
Interesting topic, and you have done a good job...

Interesting topic, and you have done a good job to find this little piece in
the net (seriously), but please recognize, that the exponent n=193949641
is not a prime, it is composite 3863*50207. (My...
Forum: Miscellaneous Math 2014-04-14, 20:29
Replies: 74
Views: 5,533
Posted By boldi
Sure. But what I would like to demonstrate is: By...

Sure. But what I would like to demonstrate is: By LL there is no further optimization possible. You can square and substract, thats all. But if conjecture holds, we can do modular exponentation, and...
Forum: Miscellaneous Math 2014-04-14, 20:11
Replies: 74
Views: 5,533
Posted By boldi
@Mayer @Silverman @Batalov thank You for...

@Mayer
@Silverman
@Batalov

thank You for Your replies, but please calm down. It is not necessary to attack me. Let us be constructive. All I have done is, to give a conjecture, I have also shown...
Forum: Miscellaneous Math 2014-04-14, 19:46
Replies: 74
Views: 5,533
Posted By boldi
To Your surprise, I know Fermats little theorem. ...

To Your surprise, I know Fermats little theorem.

As I can see, You make the same mistake as M. and S. -- You misunderstood the conjecture as Fermat test. This is not the case.

Greetings
boldi
Forum: Miscellaneous Math 2014-04-14, 19:41
Replies: 74
Views: 5,533
Posted By boldi
Thank You for Your constructive post. You have to...

Thank You for Your constructive post. You have to change only

b == M1 to b == m1


So the correct code is:

/*--------------------------------------------------------------
New...
Forum: Miscellaneous Math 2014-04-14, 18:34
Replies: 74
Views: 5,533
Posted By boldi
Where are Your facts? I can only see unproved...

Where are Your facts? I can only see unproved claims.


Code the routines and run a test: You will see, it is faster. Please also remember what I have said: The conjecture leads to a faster...
Forum: Miscellaneous Math 2014-04-14, 17:25
Replies: 74
Views: 5,533
Posted By boldi
Hi folks, as I have said, if the conjecture...

Hi folks,

as I have said, if the conjecture holds, it leads to a faster Mersenne prime test. So it is worth to think about it. Here I give the proof that the algorithm I have shown, is faster than...
Forum: Miscellaneous Math 2014-04-14, 17:00
Replies: 74
Views: 5,533
Posted By boldi
Far from it. Please give me a little time,...

Far from it.

Please give me a little time, You will get the answer. First I have to show a proof for something other. I think, You know what I mean. ;-)

Greetings
boldi
Forum: Miscellaneous Math 2014-04-14, 16:45
Replies: 74
Views: 5,533
Posted By boldi
Thx, I will keep this in mind. ...

Thx,

I will keep this in mind.

Greetings
boldi
Forum: Miscellaneous Math 2014-04-14, 11:42
Replies: 74
Views: 5,533
Posted By boldi
Thank You for the link. First of all: In my...

Thank You for the link.

First of all: In my postings I have never said my conjecture must be true.

On the contrary: In my first post I have pointed out, the conjecture needs a strong...
Forum: Miscellaneous Math 2014-04-13, 21:17
Replies: 74
Views: 5,533
Posted By boldi
You have forgotten to name the paper, where this...

You have forgotten to name the paper, where this topic is discused.




If conjecture holds, it is faster, because there is no subtraction. Because there is no subtraction, further optimazions...
Forum: Miscellaneous Math 2014-04-13, 21:09
Replies: 74
Views: 5,533
Posted By boldi
Thank You for this statement. I have to specify...

Thank You for this statement. I have to specify the conjecture:

Conjecture: Let p be a odd prime number. Then the Mersenne number M = 2^p -1 holds the congruence relation

3^(M-1) ≡ 1 mod M
...
Forum: Miscellaneous Math 2014-04-13, 20:31
Replies: 74
Views: 5,533
Posted By boldi
A (new) old, (faster) slower mersenne-(primality) PRP test

(First of all please excuse my bad English)

Conjecture: Let p be a odd prime number. Then the Mersenne number M = 2^p -1 holds the congruence relation

3^(M-1) ≡ 1 mod M

if, and only if M is...
Showing results 1 to 14 of 14

 
All times are UTC. The time now is 11:53.


Sat Jul 17 11:53:53 UTC 2021 up 50 days, 9:41, 1 user, load averages: 1.12, 1.28, 1.28

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.