![]() |
|
|
#12 |
|
Jan 2004
5 Posts |
10 days? lol and this with Prime95 or with a program which you have written, cause I've heard that Prime95 was tens of times faster than programs written by most of the people here?
And about that FFT... I've read the "fft explanation for non math guys" thread... I don't understand a damn thing. How can a 13 year old understand what are sin, cos, vectors and EVEN complex numbers? What the hell do you guys learn when you are that age???? damn man... can anyone give me a SIMPLE explanation or even a ready program for multiplying big numbers? I would be grateful. |
|
|
|
|
|
#13 | |
|
"Patrik Johansson"
Aug 2002
Uppsala, Sweden
52×17 Posts |
Quote:
|
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Prove 2^n cannot be a perfect number | mathgrad | Homework Help | 7 | 2016-03-19 01:30 |
| I take a known prime and prove it to be a composite (..or maybe need help?) | storflyt32 | storflyt32 | 112 | 2015-01-09 04:19 |
| How can I prove this PRP prime? | siegert81 | Math | 2 | 2014-11-19 10:24 |
| Number of distinct prime factors of a Double Mersenne number | aketilander | Operazione Doppi Mersennes | 1 | 2012-11-09 21:16 |
| How do I prove a 4000 digit number is prime?? | VJS | Lounge | 4 | 2005-05-09 20:56 |