Forum: sweety439
2022-07-01, 08:05
|
|
Replies: 0
Views: 11
New Mixed Proth Theorem
See PrimeGrid New Sierpinski Problem (https://www.rieselprime.de/ziki/PrimeGrid_New_Sierpi%C5%84ski_Problem) and Mixed Sierpinski Theorem...
|
|
Forum: XYYXF Project
2022-06-30, 18:00
|
|
Replies: 536
Views: 124,953
You have mtsieve...
You have mtsieve (https://sourceforge.net/projects/mtsieve/) + OpenPFGW (https://sourceforge.net/projects/openpfgw/), can I request you to build the list of generalized repunit primes?
ABC2...
|
|
Forum: And now for something completely different
2022-06-30, 17:35
|
|
Replies: 179
Views: 11,034
For (10^1031-1)/9, N-1 can be easily >= 1/3...
For (10^1031-1)/9, N-1 can be easily >= 1/3 factored, and N-1 primality proving (https://primes.utm.edu/prove/prove3_1.html) can be used, I think 10^1000+453 (which is the next prime after 10^1000)...
|
|
Forum: XYYXF Project
2022-06-30, 17:24
|
|
Replies: 57
Views: 16,468
|
|
Forum: XYYXF Project
2022-06-30, 17:08
|
|
Replies: 57
Views: 16,468
A number pass a primality test (e.g. Fermat...
A number pass a primality test (e.g. Fermat primality test, strong primality test, Lucas strong primality test, strong Lucas primality test, …) need not be prime, for the smallest composites that...
|
|
Forum: Homework Help
2022-06-29, 18:11
|
|
Replies: 6
Views: 441
7 and 13 are unique primes in base 2
7 is...
7 and 13 are unique primes in base 2
7 is the only prime with period length 3 in base 2, and 13 is the only prime with period length 12 in base 2
see factorization of Phi(n,2)...
|
|
Forum: sweety439
2022-06-29, 10:04
|
|
Replies: 43
Views: 7,196
pdf file for broken link...
pdf file for broken link https://cbright.myweb.cs.uwindsor.ca/reports/cs662-problem12.pdf
from wayback machine:...
|
|
Forum: sweety439
2022-06-29, 10:03
|
|
Replies: 43
Views: 7,196
|
|
Forum: sweety439
2022-06-29, 10:00
|
|
Replies: 43
Views: 7,196
|
|
Forum: Factoring
2022-06-28, 17:32
|
|
Replies: 502
Views: 76,977
|
|
Forum: Miscellaneous Math
2022-06-27, 09:40
|
|
Replies: 28
Views: 664
|
|
Forum: Miscellaneous Math
2022-06-27, 09:36
|
|
Replies: 28
Views: 664
|
|
Forum: sweety439
2022-06-25, 14:20
|
|
Replies: 1,270
Views: 104,646
|
|
Forum: Software
2022-06-24, 14:02
|
|
Replies: 5
Views: 211
|
|
Forum: Software
2022-06-24, 13:52
|
|
Replies: 5
Views: 211
|
|
Forum: Software
2022-06-24, 13:08
|
|
Replies: 5
Views: 211
Can PFGW run the strong Lucas primality test?
Can PFGW run the strong Lucas primality test, with parameters (P, Q) defined by Selfridge's Method A (see https://oeis.org/A217255 and http://ntheory.org/pseudoprimes.html)? I have used PFGW to...
|
|
Forum: sweety439
2022-06-24, 06:19
|
|
Replies: 351
Views: 45,234
|
|
Forum: sweety439
2022-06-24, 06:09
|
|
Replies: 351
Views: 45,234
|
|
Forum: Miscellaneous Math
2022-06-24, 05:57
|
|
Replies: 28
Views: 664
|
|
Forum: And now for something completely different
2022-06-24, 05:53
|
|
Replies: 164
Views: 36,175
The top Generalized Lucas Number...
The top Generalized Lucas Number (https://primes.utm.edu/top20/page.php?id=23) is U(24, - 25, 43201), which is equal to (25^43201+1)/26, but it is still "PRP" in factordb...
|
|
Forum: Factoring
2022-06-22, 14:17
|
|
Replies: 502
Views: 76,977
The nontrivial parts are Phi(564,13) and...
The nontrivial parts are Phi(564,13) and Phi(576,13), where Phi is the cyclotomic polynomial (https://en.wikipedia.org/wiki/Cyclotomic_polynomial), thus the SNFS difficulty should be...
|
|
Forum: sweety439
2022-06-22, 11:13
|
|
Replies: 0
Views: 75
Smallest GFN divisors
Smallest k such that k*2^(n+1)+1 is prime and divides GFN(b,n) = b^(2^n)+1 (such prime factors must be == 1 mod 2^(n+1)), for 2<=b<=40, 1<=n<=40
search limit of k: 2^24
b: n = 1 to 40
2: 1,...
|
|
Forum: Factoring
2022-06-22, 08:57
|
|
Replies: 502
Views: 76,977
|
|
Forum: Factoring
2022-06-22, 06:53
|
|
Replies: 502
Views: 76,977
|
|
Forum: sweety439
2022-06-22, 04:14
|
|
Replies: 2
Views: 146
Properties of the dozenal system
All squares end with square digits (i.e. end with 0, 1, 4 or 9), if n is divisible by both 2 and 3, then n2 ends with 0, if n is not divisible by 2 or 3, then n2 ends with 1, if n is divisible by 2...
|
