Forum: Software
2012-01-29, 21:26
|
|
Replies: 9
Views: 1,725
Carrying while doing iFFT
Hello again!
What if we do carrying before IFFT is fully completed? We cannot do exact carrying of course, but what about a "partial" carrying? Let's call some polynomial K(x) as carrying...
|
|
Forum: Information & Answers
2012-01-27, 18:04
|
|
Replies: 8
Views: 1,372
FFT multiplies two polynomials.
Let A(x)=2x+3;...
FFT multiplies two polynomials.
Let A(x)=2x+3;
and so C(x)=A(x)*A(x)=4x2+12x+9.
In this case we get:
INPUT(0,0,2,3), and SUMINPUT=5,
OUTPUT(0,4,12,9) and SUMOUT=25.
It is due to SUMINPUT=A(1),...
|
|
Forum: Math
2012-01-26, 18:59
|
|
Replies: 7
Views: 1,844
some corrections
Saying more correct, number must not be equal to 1, but needs some additional calculations and longer to explain.
I mean one step; one iteration takes O(SIZE*pi) of time.
|
|
Forum: Math
2012-01-26, 14:50
|
|
Replies: 7
Views: 1,844
|
|
Forum: Software
2011-11-18, 11:11
|
|
Replies: 20
Views: 2,941
How does P95 perform stage 1?
Does P95 in stage 1 of p-1 factoring:
- calculate E=p1*p2*p3*...., then calculate a^E mod N;
- or calculate a1=a^p1 mod N, then a2=a1^p2 mod N, then a3=a2^p3 mod N, and so on;
- or another...
|
|
Forum: Software
2011-11-18, 11:03
|
|
Replies: 9
Views: 1,725
|
|
Forum: Software
2011-11-12, 18:16
|
|
Replies: 6
Views: 2,001
|
|
Forum: Software
2011-11-11, 00:22
|
|
Replies: 14
Views: 2,619
|
|
Forum: Software
2011-11-10, 23:36
|
|
Replies: 9
Views: 1,725
An idea for implementation of FFT multiplication.
I don't know if a following idea is implemented in Prime95 already, so I just tell, what I think.
We can use negative digits in the numbers, so digits after an iteration before carrying may be 4...
|
|
Forum: Math
2011-11-07, 03:33
|
|
Replies: 15
Views: 2,831
|
|
Forum: Math
2011-11-07, 03:30
|
|
Replies: 15
Views: 2,831
|
|
Forum: Math
2011-11-06, 20:46
|
|
Replies: 61
Views: 68,872
|
