Forum: Other Mathematical Topics
2022-08-10, 21:49
|
|
Replies: 5
Views: 184
|
|
Forum: Other Mathematical Topics
2022-08-10, 19:49
|
|
Replies: 7
Views: 569
|
|
Forum: And now for something completely different
2022-08-06, 20:23
|
|
Replies: 76
Views: 10,092
|
|
Forum: Math
2022-08-02, 15:30
|
|
Replies: 115
Views: 21,392
|
|
Forum: And now for something completely different
2021-12-15, 17:30
|
|
Replies: 151
Views: 38,634
|
|
Forum: Charles Kusniec
2021-11-22, 23:20
|
|
Replies: 16
Views: 2,108
|
|
Forum: Charles Kusniec
2021-11-22, 22:39
|
|
Replies: 16
Views: 2,108
|
|
Forum: Factoring
2021-11-09, 22:40
|
|
Replies: 17
Views: 2,218
|
|
Forum: Factoring
2021-11-09, 22:24
|
|
Replies: 17
Views: 2,218
The b such that b^2048+1 is prime, are 1, 150,...
The b such that b^2048+1 is prime, are 1, 150, 2558, 4650, 4772, 11272, 13236, ... (https://oeis.org/A088361).
The game here is to skip forward in this sequence to the first values b such that...
|
|
Forum: Factoring
2021-11-09, 12:56
|
|
Replies: 17
Views: 2,218
It is not "my page". The page is on a BOINC...
It is not "my page". The page is on a BOINC server (https://primes.utm.edu/bios/page.php?id=5191) set up by user stream (https://mersenneforum.org/member.php?u=14491) who runs this project. /JeppeSN
|
|
Forum: Factoring
2021-11-08, 23:56
|
|
Replies: 17
Views: 2,218
|
|
Forum: Factoring
2021-11-08, 22:02
|
|
Replies: 17
Views: 2,218
|
|
Forum: And now for something completely different
2021-04-21, 07:16
|
|
Replies: 72
Views: 13,454
|
|
Forum: Miscellaneous Math
2021-04-20, 14:03
|
|
Replies: 12
Views: 1,873
I guess it is true that every odd factor of...
I guess it is true that every odd factor of Phi(n,b)/gcd(Phi(n,b),n) (with b≥2) (where Phi is the cyclotomic polynomial, and gcd is greatest common divisor) is of the form kn+1. /JeppeSN
|
|
Forum: Riesel Prime Search
2021-02-19, 08:48
|
|
Replies: 307
Views: 62,386
|
|
Forum: FermatSearch
2021-02-16, 12:31
|
|
Replies: 12
Views: 11,120
I added the information to...
I added the information to https://primes.utm.edu/primes/page.php?id=131760#comments
It had already appeared on http://www.prothsearch.com/GFNfacs.html
/JeppeSN
|
|
Forum: Math
2021-01-18, 15:43
|
|
Replies: 8
Views: 2,188
The official policy of OEIS disagrees.
On...
The official policy of OEIS disagrees.
On https://oeis.org/SubmitB.html you can read:
So just because it is faster to calculate a sequence than to fetch it over the internet, does not mean...
|
|
Forum: FermatSearch
2021-01-17, 23:57
|
|
Replies: 345
Views: 95,506
|
|
Forum: FermatSearch
2020-11-19, 10:33
|
|
Replies: 65
Views: 14,386
|
|
Forum: FermatSearch
2020-11-19, 00:41
|
|
Replies: 65
Views: 14,386
|
|
Forum: FermatSearch
2020-10-12, 22:20
|
|
Replies: 345
Views: 95,506
But before that, Ravi Fernando showed me:
...
But before that, Ravi Fernando showed me:
Let p = k * 2^n + 1 be a prime that divides a Fermat number. From the formula, we can write k = -1/2^n (mod p). But the order of 2 (mod p) is a power of...
|
|
Forum: FermatSearch
2020-10-12, 20:10
|
|
Replies: 345
Views: 95,506
Cool. It should be added as a User comment on...
Cool. It should be added as a User comment on https://primes.utm.edu/primes/page.php?id=131289. If you have at least one prime on primes.utm.edu, you can do it. Ask me if you do not know how to do...
|
|
Forum: FermatSearch
2020-10-11, 12:18
|
|
Replies: 345
Views: 95,506
|
|
Forum: FermatSearch
2020-10-10, 20:49
|
|
Replies: 345
Views: 95,506
Dear rynp,
Congratulations with this...
Dear rynp,
Congratulations with this remarkable discovery!
Has the above PFGW run completed by now? I see no User comment mentioning the GF(-, 7) divisor on...
|
|
Forum: Math
2020-10-06, 20:28
|
|
Replies: 5
Views: 2,466
This part is explained in...
This part is explained in https://en.wikipedia.org/wiki/Second_Hardy%E2%80%93Littlewood_conjecture – if the First Hardy–Littlewood conjecture is true, then this implies that the second...
|
