mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2004-01-06, 13:36   #12
Alien
 
Jan 2004

58 Posts
Default

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.
Alien is offline   Reply With Quote
Old 2004-01-07, 11:36   #13
patrik
 
patrik's Avatar
 
"Patrik Johansson"
Aug 2002
Uppsala, Sweden

52·17 Posts
Default

Quote:
Originally posted by Alien
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?
It took 10 days when using Prime95.
patrik is offline   Reply With Quote
Reply



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

All times are UTC. The time now is 17:42.


Fri Jul 16 17:42:10 UTC 2021 up 49 days, 15:29, 1 user, load averages: 1.78, 1.49, 1.50

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.