Forum: Forum Feedback
2021-03-02, 14:46
|
Replies: 15
Views: 329
|
Forum: Forum Feedback
2021-03-02, 01:48
|
Replies: 15
Views: 329
The 2 that's subtracted at each iteration needs...
The 2 that's subtracted at each iteration needs to be bit-shifted too. This ensures that the residue at each iteration is just a shifted version of the "correct" residue, but the squarings that are...
|
Forum: Cunningham Tables
2021-02-28, 13:51
|
Replies: 17
Views: 1,619
Pleased to see that Sam has credited me with a...
Pleased to see that Sam has credited me with a new record ECM factor :razz:
3458 2,2750M c185 33064259907061907187454540598801861343151128939115124241607813225512323356759645078501. p99 Balfour...
|
Forum: Cunningham Tables
2021-02-27, 18:41
|
Replies: 17
Views: 1,619
That sounds like a good plan to start out with;...
That sounds like a good plan to start out with; in the long term maybe it would be best to move on to 850e6 after the first 19000@260e6, given that Yoyo won't be the only ones running ECM on these...
|
Forum: Cunningham Tables
2021-02-26, 19:25
|
Replies: 17
Views: 1,619
|
Forum: Aliquot Sequences
2021-02-23, 17:23
|
Replies: 28
Views: 900
|
Forum: Aliquot Sequences
2021-02-22, 17:46
|
Replies: 28
Views: 900
|
Forum: Miscellaneous Math
2021-02-19, 13:01
|
Replies: 32
Views: 1,377
Say N = kM with k being the known factors and M...
Say N = kM with k being the known factors and M the unfactored part. Find a such that y := a^2 mod M is around sqrt(M). We want x such that x^2 = y mod N, so we also need x^2 = y mod p for each prime...
|
Forum: Cunningham Tables
2021-02-19, 03:02
|
Replies: 236
Views: 47,435
|
Forum: Cunningham Tables
2021-02-19, 02:26
|
Replies: 236
Views: 47,435
|
Forum: Cunningham Tables
2021-02-19, 01:42
|
Replies: 236
Views: 47,435
|
Forum: Miscellaneous Math
2021-02-19, 01:31
|
Replies: 32
Views: 1,377
|
Forum: Miscellaneous Math
2021-02-17, 18:24
|
Replies: 32
Views: 1,377
|
Forum: Miscellaneous Math
2021-02-17, 16:47
|
Replies: 32
Views: 1,377
|
Forum: Miscellaneous Math
2021-02-17, 15:20
|
Replies: 32
Views: 1,377
As I said:
Finding x such that x^2 mod...
As I said:
Finding x such that x^2 mod N is small is NOT the bit that becomes difficult for very large numbers. So unless you demonstrate an efficient way of finding x for which x^2 mod N is...
|
Forum: Miscellaneous Math
2021-02-17, 14:09
|
Replies: 32
Views: 1,377
|
Forum: YAFU
2021-02-16, 18:08
|
Replies: 4
Views: 455
|
Forum: Cunningham Tables
2021-02-12, 22:25
|
Replies: 17
Views: 1,619
|
Forum: Msieve
2021-02-11, 00:46
|
Replies: 179
Views: 37,605
c185
2,2750M
n: 31647571313134323652609296402268897329689252390097206333060347128266343802277166957713755129362162253418129502007399985053315681820678031516478144277440761942221352978166693923227077001...
|
Forum: Factoring
2021-02-08, 12:22
|
Replies: 1,816
Views: 148,565
|
Forum: Factoring
2021-02-07, 14:10
|
Replies: 1,816
Views: 148,565
|
Forum: Cunningham Tables
2021-02-07, 12:55
|
Replies: 17
Views: 1,619
...though those divisible by 9 still have...
...though those divisible by 9 still have sextics.
For the non-Aurifeuillians, the exponents divisible by 17 are probably fastest with an octic that makes use of the algebraic factor.
|
Forum: Cunningham Tables
2021-01-30, 19:14
|
Replies: 17
Views: 1,619
|
Forum: Cunningham Tables
2021-01-20, 13:12
|
Replies: 236
Views: 47,435
|
Forum: Factoring
2021-01-19, 15:47
|
Replies: 933
Views: 82,363
|