Forum: Lounge
2005-03-06, 16:38
|
Replies: 43
Views: 3,662
|
Forum: Math
2004-09-11, 12:51
|
Replies: 37
Views: 6,357
|
Forum: Math
2004-09-10, 14:18
|
Replies: 37
Views: 6,357
General Solution to Polynomial Equations
What are the implications for factoring/primality testing (if any) of the newly announced general solution to polynomial equations? This piqued my interest because I remembered something about FFT...
|
Forum: Miscellaneous Math
2004-08-18, 15:45
|
Replies: 16
Views: 2,540
|
Forum: Math
2004-08-01, 19:07
|
Replies: 3
Views: 1,470
I've studied the Lucas-Lehmer sequence quite a...
I've studied the Lucas-Lehmer sequence quite a bit over the past year, and based on all of the empirical evidence that I've collected, I have concluded that the LL sequence will zero out after any...
|
Forum: Math
2004-08-01, 12:12
|
Replies: 3
Views: 1,470
|
Forum: Software
2004-07-31, 14:51
|
Replies: 27
Views: 4,961
|
Forum: Math
2004-07-30, 15:11
|
Replies: 61
Views: 69,004
Is there a FFT implementation that would be...
Is there a FFT implementation that would be better suited for repeatedly performing the multiplication step while remaining in the transform (i.e., where precision errors are not an issue), or at...
|
Forum: Math
2004-07-30, 02:44
|
Replies: 2
Views: 1,582
Check out Dario Alpern's "Generic Two Integer...
Check out Dario Alpern's "Generic Two Integer Variable Equation Solver":
http://www.alpertron.com.ar/QUAD.HTM
He offers a lot of background information about this subject.
BTW: You might not...
|
Forum: Math
2004-07-29, 13:58
|
Replies: 61
Views: 69,004
I'm still trying to get my head around...
I'm still trying to get my head around multiplying using FFT's, but I have a couple questions that popped up:
As I understand, to multiply using FFT, you need to do a transform, perform the...
|
Forum: Math
2004-07-21, 17:45
|
Replies: 7
Views: 3,074
|
Forum: Math
2004-07-02, 22:26
|
Replies: 3
Views: 1,909
|
Forum: Math
2004-07-02, 22:01
|
Replies: 3
Views: 1,909
|
Forum: Math
2004-07-02, 13:18
|
Replies: 3
Views: 1,909
Raising numbers to a power of two
Are there any shortcuts for raising a number to a power of two (modulo a mersenne)?
Examples:
37^1024 (mod 127)
65^2048 (mod 8191)
I realize that the exponential operation using the...
|