Forum: Miscellaneous Math
2018-12-17, 05:43
|
|
Replies: 3
Views: 540
|
|
Forum: Miscellaneous Math
2018-12-17, 02:13
|
|
Replies: 3
Views: 540
base 42 project
cataloguing primes k*42n+1 for k = 1 ~ 15000, n = 1 ~ until i get bored. gotta catch 'em all, as they say.
current progress: n ~ 700
if someone's already done this, pls let me know.
...
|
|
Forum: Information & Answers
2018-12-08, 23:39
|
|
Replies: 8
Views: 1,551
|
|
Forum: Information & Answers
2018-12-07, 02:02
|
|
Replies: 8
Views: 1,551
records for primes
is there a list of records for the largest "random" primes ever discovered?
primes like this, for example:...
|
|
Forum: Information & Answers
2018-11-12, 00:22
|
|
Replies: 6
Views: 812
|
|
Forum: Information & Answers
2018-11-11, 15:13
|
|
Replies: 6
Views: 812
|
|
Forum: Information & Answers
2018-11-11, 00:17
|
|
Replies: 6
Views: 812
sieving software
is there an archive or repository of sieving programs? used to have a lot of them on hand, but I've totally lost all the programs I had aside from NewPGen
|
|
Forum: Miscellaneous Math
2016-12-16, 22:35
|
|
Replies: 3
Views: 926
something like that, yes.
to clarify, it...
something like that, yes.
to clarify, it would be very nice if there were a way to get the odds of an n-digit factor being found after an amount of curves at a certain b1 (e.g. odds of finding a...
|
|
Forum: Miscellaneous Math
2016-12-16, 21:55
|
|
Replies: 3
Views: 926
ecm thing
I haven't been here for a while, and I couldn't find much of anything on this by searching it up, so here goes:
is there a nice way to calc the odds of finding an n-digit factor after running a...
|
|
Forum: Miscellaneous Math
2013-09-30, 21:19
|
|
Replies: 947
Views: 29,204
kbb-GFN:
(14903*876876)^4+1 (10328 digits)
...
kbb-GFN:
(14903*876876)^4+1 (10328 digits)
Primality testing (14903*876^876)^4+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 5
Generic modular reduction using generic...
|
|
Forum: Miscellaneous Math
2013-09-30, 16:59
|
|
Replies: 947
Views: 29,204
bumping yet again with some cofactor PRPs: ...
bumping yet again with some cofactor PRPs:
((8649*157+46)*2^17090+1)/157
((9953*157+46)*2^17090+1)/157
((12728*157+46)*2^17090+1)/157
52376*1012870+1 (12875 digits)
Running N-1 test using base...
|
|
Forum: Miscellaneous Math
2013-09-25, 01:11
|
|
Replies: 947
Views: 29,204
Bumping:
200662*3716450+1 (25803 digits) ...
Bumping:
200662*3716450+1 (25803 digits)
Primality testing 200662*37^16450+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 7
Special modular reduction using zero-padded AMD K10...
|
|
Forum: Miscellaneous Math
2013-09-24, 19:42
|
|
Replies: 947
Views: 29,204
|
|
Forum: Lounge
2013-09-24, 19:37
|
|
Replies: 2,066
Views: 83,749
|
|
Forum: Miscellaneous Math
2013-09-24, 16:54
|
|
Replies: 947
Views: 29,204
|
|
Forum: Miscellaneous Math
2013-09-24, 00:06
|
|
Replies: 947
Views: 29,204
|
|
Forum: Lounge
2013-09-23, 18:42
|
|
Replies: 7
Views: 1,201
He means the largest cube solved by hand. The...
He means the largest cube solved by hand. The world record for that was set a few months ago, which stands at 111x111x111. The solve took slightly less than 30 hours' worth of solving time spaced out...
|
|
Forum: Miscellaneous Math
2013-09-23, 16:20
|
|
Replies: 947
Views: 29,204
|
|
Forum: Miscellaneous Math
2013-09-23, 15:17
|
|
Replies: 947
Views: 29,204
moar stuff:
319629*280790+1 (24326 digits) ...
moar stuff:
319629*280790+1 (24326 digits)
Primality testing 319629*2^80790+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 5
Special modular reduction using all-complex AMD K10...
|
|
Forum: Lounge
2013-09-23, 12:24
|
|
Replies: 7
Views: 1,201
I use gabbasoft, this:...
I use gabbasoft, this: http://www.motus-software.com/rubix.htm, or this (for big cubes): http://advsys.net/ken/download.htm
Yeah, Verdes isn't planning on making any larger cubes than 7....
|
|
Forum: Miscellaneous Math
2013-09-23, 12:11
|
|
Replies: 947
Views: 29,204
moar:
93283*295606+1 (28786 digits)
Primality...
moar:
93283*295606+1 (28786 digits)
Primality testing 93283*2^95606+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Special modular reduction using all-complex AMD K10 type-1...
|
|
Forum: Miscellaneous Math
2013-09-23, 03:10
|
|
Replies: 947
Views: 29,204
More primes:
80256*630766+1 (23946 digits) ...
More primes:
80256*630766+1 (23946 digits)
Primality testing 80256*6^30766+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 5
Special modular reduction using all-complex AMD K10...
|
|
Forum: Miscellaneous Math
2013-09-21, 18:43
|
|
Replies: 947
Views: 29,204
Bumping:
209610*5325760+1 (44423 digits) ...
Bumping:
209610*5325760+1 (44423 digits)
Primality testing 209610*53^25760+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 2
Special modular reduction using zero-padded AMD K10...
|
|
Forum: Miscellaneous Math
2013-09-20, 21:31
|
|
Replies: 947
Views: 29,204
Searching for a prime that's roughly ~65.5k...
Searching for a prime that's roughly ~65.5k digits in size. k * 2^217600 + 1, still sieving.
So far I've covered up to ~25.1 trillion. Started off with 300k candidates, now at a little over 11k...
|
|
Forum: Lounge
2013-09-20, 16:02
|
|
Replies: 7
Views: 1,201
cubing/15-puzzle general
Since I've been away, I've adopted cubing/solving rubik's cubes as a pastime, as well as solving 15-puzzles. My times for the 3x3x3 cube are roughly ~30 ~ 40 seconds, best time of 25.1 seconds. Not...
|
