Forum: Math
2019-04-28, 02:43
|
|
Replies: 1
Views: 1,127
Sieving Question
What advanced knowledge do we have about the factors of the following numbers?
P = (k*2^m)^(2^n)+1
where k is an odd 32-bit number, and m ~ n.
The idea is to use Proth's theorem for a...
|
|
Forum: Lounge
2010-11-03, 16:15
|
|
Replies: 982
Views: 67,522
Naglfar - I am Vengeance
http://www.youtube.com/watch?v=eQcLWjHnBp0
To quote a comment:
"I pity the f***** that cuts me off in traffic while blasting this song on my car stereo."
Lyrics:
Humanity what have you...
|
|
Forum: Software
2010-09-28, 19:00
|
|
Replies: 15
Views: 1,472
The argument is that one will efficiently load...
The argument is that one will efficiently load stride-X-separated cachelines from L2 to L1 if you use cachelines as your data type. If loading a cacheline takes 4 cycles, then if your code partially...
|
|
Forum: Software
2010-09-28, 00:26
|
|
Replies: 15
Views: 1,472
It also makes sense for FFTs: a split-radix...
It also makes sense for FFTs: a split-radix butterfly has 16 additions and 8 multiplies, which (IIRC) can be done in 48 instructions including branching code. Then you loop over one FFT of length N/2...
|
|
Forum: Software
2010-09-27, 21:43
|
|
Replies: 15
Views: 1,472
|
|
Forum: Software
2010-09-27, 20:43
|
|
Replies: 15
Views: 1,472
Using assembly is the only way to actually be...
Using assembly is the only way to actually be limited by hardware bottlenecks. In http://www.mersenneforum.org/showthread.php?t=13176 for example the compiled code runs at ~66% of the theoretical...
|
|
Forum: Lounge
2010-09-27, 12:48
|
|
Replies: 51
Views: 2,336
We should redefine something to make it easier...
We should redefine something to make it easier for you to do arithmetic using your fingers and thumbs? Tsk, tsk.
How about we change it to a 2^-16th of a day? Or better, use something that can me...
|
|
Forum: Lounge
2010-09-26, 21:03
|
|
Replies: 4,254
Views: 305,060
|
|
Forum: Lounge
2010-09-22, 18:06
|
|
Replies: 982
Views: 67,522
|
|
Forum: Lounge
2010-08-21, 20:24
|
|
Replies: 1,664
Views: 107,849
In the mean time you can get LASIK (e.g. here...
In the mean time you can get LASIK (e.g. here (http://www.lasikvisioninstitute.us.com/lasikvision/unique/113422.php)) for $1299 per eye. Also, a years supply of Acuvue Oasis contact lenses is roughly...
|
|
Forum: Software
2010-08-09, 11:13
|
|
Replies: 188
Views: 19,727
|
|
Forum: Software
2010-08-09, 01:44
|
|
Replies: 188
Views: 19,727
|
|
Forum: Software
2010-08-08, 23:16
|
|
Replies: 188
Views: 19,727
See:...
See: http://www.mersenneforum.org/showthread.php?t=13176
Performance for a split radix real FFT, i.e ~4/3*n*log2(n) adds and 2/3*n*log2(n) multiplies, on CPUs is limited by the throughput of the...
|
|
Forum: Software
2010-08-08, 22:41
|
|
Replies: 188
Views: 19,727
|
|
Forum: Hardware
2010-08-06, 06:30
|
|
Replies: 18
Views: 1,140
|
|
Forum: Lounge
2010-07-12, 12:52
|
|
Replies: 272
Views: 34,231
|
|
Forum: Conjectures 'R Us
2010-07-12, 01:59
|
|
Replies: 90
Views: 48,802
|
|
Forum: Conjectures 'R Us
2010-07-11, 23:18
|
|
Replies: 90
Views: 48,802
Faster special case algorithm?
If we use Proth's theorem to search for primes of the form (k*2^n)^(2^m)+1 with k<2^n, and if (k*2^n)^2+m<2^m, we could do the required negacyclic convolution with Schoenhage-Strassen in base k*2^n....
|
|
Forum: Lounge
2010-06-16, 01:14
|
|
Replies: 46
Views: 1,569
|
|
Forum: Lounge
2010-06-16, 01:06
|
|
Replies: 46
Views: 1,569
|
|
Forum: Lounge
2010-06-13, 15:42
|
|
Replies: 982
Views: 67,522
Eric Petersen's side project
Haven't listened to this in a while. My favorites:
Dragonlord - Rapture: http://www.youtube.com/watch?v=BXkXY9BDtVc
Dragonlord - Unholy Void: http://www.youtube.com/watch?v=ZNssp1UVIII
|
|
Forum: Math
2010-06-12, 20:09
|
|
Replies: 1
Views: 481
After some fudging I managed to find:
...
After some fudging I managed to find:
Mod(127316999246511176001337524256693, 162259276829213363391578010288127) + Mod(100755747211248383624389262455139, 162259276829213363391578010288127)*IWhich...
|
|
Forum: Math
2010-06-12, 17:03
|
|
Replies: 1
Views: 481
pari-gp and trigonometry in Galois fields
Is there a straightforward way to compute roots modulo p^2 with pari-gp?
Specifically, if p=2^107-1, then 4th roots of unity are free, 8th roots are computationally cheap (i.e. +/-2^53 +/- i*2^53,...
|
|
Forum: Lounge
2010-06-08, 16:45
|
|
Replies: 4,254
Views: 305,060
|
|
Forum: Software
2010-06-04, 12:55
|
|
Replies: 188
Views: 19,727
|
