Forum: Software
2022-08-07, 05:15
|
|
Replies: 655
Views: 56,504
If it is possible to upgrade the RAM in your...
If it is possible to upgrade the RAM in your computer, upgrade it to the maximum capacity and allocate the maximum RAM you can to the program. It will automatically choose _much_ higher bounds.
|
|
Forum: Linux
2022-08-01, 05:10
|
|
Replies: 10
Views: 401
|
|
Forum: Data
2022-07-28, 08:01
|
|
Replies: 1,409
Views: 191,313
|
|
Forum: Cloud Computing
2022-07-25, 14:30
|
|
Replies: 3
Views: 261
|
|
Forum: Software
2022-07-21, 14:24
|
|
Replies: 45
Views: 2,741
|
|
Forum: Software
2022-07-18, 13:19
|
|
Replies: 45
Views: 2,741
Another success:
ECM found a factor in curve...
Another success:
ECM found a factor in curve #1, stage #2
Sigma=3154775547629108, B1=250000, B2=235419030.
UID: axn/c1, M903407 has a factor: 1066347780167947196737336563937 (ECM curve 1,...
|
|
Forum: Data
2022-07-17, 01:32
|
|
Replies: 178
Views: 14,960
|
|
Forum: Software
2022-06-30, 12:06
|
|
Replies: 45
Views: 2,741
|
|
Forum: Information & Answers
2022-06-27, 16:21
|
|
Replies: 27
Views: 1,245
|
|
Forum: Information & Answers
2022-06-27, 15:56
|
|
Replies: 27
Views: 1,245
|
|
Forum: Information & Answers
2022-06-26, 13:29
|
|
Replies: 6
Views: 637
|
|
Forum: Information & Answers
2022-06-19, 04:17
|
|
Replies: 6
Views: 637
It is more efficient to use the full mersenne...
It is more efficient to use the full mersenne number for the FFT operations (because of its special form) rather than just the unfactored part. In fact, even if the unfactored part was just half the...
|
|
Forum: FactorDB
2022-06-14, 09:41
|
|
Replies: 568
Views: 107,716
|
|
Forum: Data
2022-06-12, 03:59
|
|
Replies: 178
Views: 14,960
|
|
Forum: PrimeNet
2022-06-10, 09:53
|
|
Replies: 131
Views: 33,093
https://www.mersenne.ca/exponent/194544733 and...
https://www.mersenne.ca/exponent/194544733 and https://www.mersenne.ca/exponent/194546867 suggests the factors were previously known; merely that the "factor found" entry is not there in primenet.
...
|
|
Forum: Data
2022-06-04, 05:24
|
|
Replies: 589
Views: 125,061
|
|
Forum: Data
2022-06-04, 02:03
|
|
Replies: 589
Views: 125,061
|
|
Forum: Software
2022-05-28, 14:33
|
|
Replies: 5
Views: 421
We store about 18 bits per IEEE fp64, so it is...
We store about 18 bits per IEEE fp64, so it is more lime 6-7M. But I guess that just strengthens your case.
Modern processors can do 8-16 floating point ops/cycles (including muls & adds). Data...
|
|
Forum: Software
2022-05-27, 05:03
|
|
Replies: 675
Views: 110,190
No. Only (p, 2p+1) is SG
When...
No. Only (p, 2p+1) is SG
When p=k*2^n-1, 2p+1 = k*2^(n+1)-1. Both are easily provable by LLR.
When p=k*2^n+1, 2p+1 = k*2^(n+1)+3, but is still provable, since, by definition, we have 100%...
|
|
Forum: Lone Mersenne Hunters
2022-05-23, 17:17
|
|
Replies: 2,173
Views: 336,341
|
|
Forum: Soap Box
2022-05-23, 01:54
|
|
Replies: 43
Views: 1,523
|
|
Forum: Software
2022-05-23, 01:35
|
|
Replies: 655
Views: 56,504
|
|
Forum: Software
2022-05-22, 16:48
|
|
Replies: 655
Views: 56,504
It is. But the essential nature of stage 2...
It is. But the essential nature of stage 2 remains, i.e. k must have one factor between B1 & B2. That doesn't change just because you checked for the factor (i.e. did a gcd) multiple times during...
|
|
Forum: Software
2022-05-22, 15:58
|
|
Replies: 655
Views: 56,504
2*k*p+1
Yes, but not specific to 30.8
...
2*k*p+1
Yes, but not specific to 30.8
It is not so much a problem as it is a limitation of the P-1 algorithm.
For smaller exponents, this shouldn't cost much. But how would this help...
|
|
Forum: Software
2022-05-22, 04:41
|
|
Replies: 655
Views: 56,504
|
