mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 12 of 12
Search took 0.01 seconds.
Search: Posts Made By: Maximus
Forum: Software 2012-01-29, 21:26
Replies: 9
Views: 1,320
Posted By Maximus
Lightbulb 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: 871
Posted By Maximus
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,356
Posted By Maximus
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,356
Posted By Maximus
One way to calculate root of unity is exhaustive...

One way to calculate root of unity is exhaustive search.
Example:
8/2=4.
337=24*21.
Take a number, let it be 2.
Calculate 24*21 mod 337 = 1. But must be -1. So 2 is not eligible.
Let take...
Forum: Software 2011-11-18, 11:11
Replies: 20
Views: 1,369
Posted By Maximus
Question 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,320
Posted By Maximus
Thanks for replies. It seems I have found...

Thanks for replies.
It seems I have found nothing new. :smile:
Forum: Software 2011-11-12, 18:16
Replies: 6
Views: 1,608
Posted By Maximus
On the data given, I think that issue in the CPU....

On the data given, I think that issue in the CPU.
Try to decrease CPU/FSB frequency, try to decrease CPU loading (http://mersenneforum.org/showthread.php?t=15606), try another testing program (I...
Forum: Software 2011-11-11, 00:22
Replies: 14
Views: 1,889
Posted By Maximus
One day many years ago I observed slowness, when...

One day many years ago I observed slowness, when P95 running as service. I don't remember details. I had deinstalled service and made launch via Startup folder.
Forum: Software 2011-11-10, 23:36
Replies: 9
Views: 1,320
Posted By Maximus
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: 1,190
Posted By Maximus
In the homework? No. :)

In the homework? No. :)
Forum: Math 2011-11-07, 03:30
Replies: 15
Views: 1,190
Posted By Maximus
Exclamation low-value comments cleared out of FFT thread

Polinomials: C(x)=A(x)*B(x). And it may be used for integer multiplication. FFT does the same.
Forum: Math 2011-11-06, 20:46
Replies: 61
Views: 44,807
Posted By Maximus
I found an algorithm for polynomial multiplying....

I found an algorithm for polynomial multiplying. The algorithm is relative to FFT and has a simple explanation. Is anybody interesting?
Showing results 1 to 12 of 12

 
All times are UTC. The time now is 10:16.

Thu Nov 26 10:16:23 UTC 2020 up 77 days, 7:27, 4 users, load averages: 1.16, 1.25, 1.30

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.