Forum: gophne
2018-01-05, 19:54
|
|
Replies: 272
Views: 36,768
Read my lips.
Every 2^p-1 will be called...
Read my lips.
Every 2^p-1 will be called prime by this method.
You could just as well use this test in its equivalent form:Input: 2^p-1. Return: prime!
That is why nobody uses 2-PRP method...
|
|
Forum: gophne
2018-01-02, 18:31
|
|
Replies: 272
Views: 36,768
This is solipsism. This can be justified in the...
This is solipsism. This can be justified in the case of complete deaf-blindness, but in other cases usually stems from extreme ignorance. You are definitely not 5 years old - you use big words like...
|
|
Forum: gophne
2018-01-01, 20:54
|
|
Replies: 272
Views: 36,768
Depends on a person!
Now, my question is...
Depends on a person!
Now, my question is this: wasn't this thread (and the poster) way better off when the thread was locked the first time?
Observe: the only thing that happened after reopening...
|
|
Forum: gophne
2017-12-31, 16:56
|
|
Replies: 272
Views: 36,768
Suppose you wanted to learn the piano and...
Suppose you wanted to learn the piano and transposed the Moonlight sonata into a more convenient key (from the original c# minor ...that, obviously everyone knows :rolleys:). You cannot go around...
|
|
Forum: gophne
2017-12-30, 23:22
|
|
Replies: 272
Views: 36,768
I am THRILLED people are actually getting it,...
I am THRILLED people are actually getting it, and that they clearly like "my (http://mersenneforum.org/showthread.php?p=475249#post475249)" style.
Jim stayed in character for weeks (see below),...
|
|
Forum: gophne
2017-12-30, 22:15
|
|
Replies: 272
Views: 36,768
|
|
Forum: gophne
2017-12-30, 21:42
|
|
Replies: 272
Views: 36,768
|
|
Forum: gophne
2017-12-30, 18:42
|
|
Replies: 272
Views: 36,768
|
|
Forum: gophne
2017-12-29, 15:56
|
|
Replies: 272
Views: 36,768
|
|
Forum: gophne
2017-12-29, 06:53
|
|
Replies: 272
Views: 36,768
|
|
Forum: gophne
2017-12-29, 06:45
|
|
Replies: 272
Views: 36,768
|
|
Forum: gophne
2017-12-29, 02:23
|
|
Replies: 272
Views: 36,768
|
|
Forum: gophne
2017-12-29, 00:21
|
|
Replies: 272
Views: 36,768
|
|
Forum: gophne
2017-12-29, 00:06
|
|
Replies: 272
Views: 36,768
So you are saying that your test is (2^n-1) =...
So you are saying that your test is (2^n-1) = (n+1)/2 (mod n+2).
This is the same as:
2^(n+1)-2 = n+1 (mod n+2) . . . . . . (equivalent to mulitply both sides by 2 because n is odd)
2^(n+1) =...
|
|
Forum: gophne
2017-12-28, 18:24
|
|
Replies: 272
Views: 36,768
|
|
Forum: gophne
2017-12-27, 19:13
|
|
Replies: 272
Views: 36,768
|
