Forum: Software
2021-01-05, 20:14
|
Replies: 542
Views: 57,471
Can you make a program to sieve generalized...
Can you make a program to sieve generalized Gaussian Mersenne primes of the form ((b^n-1)^2+1)/2?
Side note: These numbers are considered to be half-GFN because they are of the form (k^2+1)/2
|
Forum: Software
2020-12-11, 17:31
|
Replies: 542
Views: 57,471
|
Forum: Riesel Prime Search
2020-12-11, 01:23
|
Replies: 1,021
Views: 122,976
|
Forum: And now for something completely different
2020-12-08, 05:11
|
Replies: 40
Views: 14,688
|
Forum: And now for something completely different
2020-12-07, 20:58
|
Replies: 40
Views: 14,688
|
Forum: Software
2020-11-18, 05:16
|
Replies: 542
Views: 57,471
|
Forum: And now for something completely different
2020-11-18, 04:39
|
Replies: 40
Views: 14,688
Reserving 12
I'm reserving 12 because numbers in this sequence are considered to be Proth numbers also. (n*12^n+1)
|
Forum: Software
2020-11-16, 20:50
|
Replies: 5
Views: 757
|
Forum: Software
2020-11-16, 17:59
|
Replies: 5
Views: 757
|