mersenneforum.org  

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

Reply
 
Thread Tools
Old 2002-11-06, 20:40   #12
MAD-ness
 
Sep 2002

22 Posts
Default

I have 10 years on you guys and I don't undestand any of that, so congrats.

:)
MAD-ness is offline   Reply With Quote
Old 2002-11-06, 21:54   #13
Deamiter
 
Deamiter's Avatar
 
Sep 2002

32×13 Posts
Default

lol... it's mostly experience. The longer you've been playing with numbers (especially primes and how to use mods to test for primes) the better you'll get it. My (now retired) physics prof is around 85, and he's amazing at some of this stuff even though he can't multiply in his head any more (due to a form of Parkinsen's I think).
Deamiter is offline   Reply With Quote
Old 2002-11-09, 01:00   #14
PageFault
 
PageFault's Avatar
 
Aug 2002
Dawn of the Dead

5×47 Posts
Default

ahhh, experience ....

About two years ago I programmed a PLC to perform a linear regression. I needed a sturdy tool, able to withstand life on the mill floor, so I could process data while recording it. So, I wrote this crazy algorithm to do the regression without overflowing (Allen Bradley cpu instruction set is pretty weak) and brought it to the instrumentation shop and told them to insert is as one of the final rungs.

The electrical engineer in charge of the shop nearly threw a rod when he realized what I was doing with the PLC
PageFault is offline   Reply With Quote
Old 2002-11-10, 18:40   #15
PiepPiep
 

110548 Posts
Default

Tnx for the info!
I've really searched a lot for some nice information like this but it was
always with difficult formulas i didn't understand or some
100kB source code files.
I'm going to give it a try now to implement a fft.
The only thing i need now is some test case bignumbers to test with.
I can multiply some 100 digit numbers myself with just to 'normal'
multiply in a little program, but where can i find some test cases with
10.000 digits numbers or much bigger?
  Reply With Quote
Old 2003-02-10, 22:39   #16
flava
 
flava's Avatar
 
Feb 2003

2×59 Posts
Default

So you want to multiply big numbers? If you have a windows based system you might be lucky. I just compiled (a lib for windows) the latest GMP library ant it allows you to play with really big integer numbers (I tested it over 10M digits). It comes with a nice header (for C). Another thing, I compiled it for Athlon (the blended one is slower) so I have no ideea if it works on other CPU's....
BTW, I wanted to see how fast is the integer FFT code in GMP so I wrote a LL and ... it's 6X slower than Prime95 ops:
flava is offline   Reply With Quote
Old 2003-02-11, 16:24   #17
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

482710 Posts
Default

Quote:
I just compiled (a lib for windows) the latest GMP library ant it allows you to play with really big integer numbers
Where is it? :-D

Luigi
ET_ is offline   Reply With Quote
Old 2003-02-11, 19:04   #18
cheesehead
 
cheesehead's Avatar
 
"Richard B. Woods"
Aug 2002
Wisconsin USA

11110000011002 Posts
Default Where to find the GMP library

Quote:
Originally Posted by ET_
Quote:
I just compiled (a lib for windows) the latest GMP library ant it allows you to play with really big integer numbers
Where is it? :-D
Luigi
Try The GNU MP Home Page at http://www.swox.com/gmp/
cheesehead is offline   Reply With Quote
Old 2003-02-11, 21:42   #19
flava
 
flava's Avatar
 
Feb 2003

2·59 Posts
Default

Quote:
Where is it? :-D

Luigi
I can upload the compiled lib on my web "site" if someone wants it. It's about 1Mb and works fast on Athlon and Duron.
The source code can be found at http://www.swox.com/gmp/ but yo will need a Unix emulator and a bit of patience to compile it on Windows.
flava is offline   Reply With Quote
Old 2003-02-15, 00:20   #20
mephisto
 
mephisto's Avatar
 
Feb 2003
Norway

23×7 Posts
Default

Thanks to ewmayer for a readable intro to Fourier/DFT/FFT - I've also looked for that, and failed.

I have a Master in AI/pattern recognition, and I've actually used Fourier. I never understood the math, though, and I couldn't really see any natural connection between "split up a signal to its constutients, and use the resulting distribution to compress and/or do pattern recognition on the original signal" and the "find large primes" problem.

I have too little math, of course - even six years at university didn't give me enough math to understand the Fourier transform. Shame on me, perhaps, but it's not just "barely 14's" who benefit from a readable explanation of "what's happening here?". I'm happy to finally understand what I did at university :)
mephisto is offline   Reply With Quote
Old 2004-07-02, 04:46   #21
Citrix
 
Citrix's Avatar
 
Jun 2003

110001011102 Posts
Default

ewmayer,

A quick question.
If I wanted to multiply two, 3 digit numbers then how do I do the transform? What is the general forumula to do transforms for two n digit numbers? Also what about the inverse?What is the general formula for this?

Also as I understand that after multiplying the numbers, you have to take the mod. How does one achieve this real fast. Is there a faster algorithm than dividing and then looking at the remainder?

Also, let me tell you that your explanation is really good, the best I can find on the web.

Thanks,
Citrix
Citrix is offline   Reply With Quote
Old 2004-07-02, 05:12   #22
Citrix
 
Citrix's Avatar
 
Jun 2003

2·7·113 Posts
Default

I am also curious, that if someone found a faster algorithm to multiply numbers, then will it have any applications in any other fields like FFT, or will it only help mathematics (number theory).

Citrix
Citrix is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Any technology you guys are excited about? jasong Lounge 31 2015-10-09 20:55
These dell guys can't possibly be serious... Unregistered Hardware 12 2006-11-03 03:53
You guys are famous jasong Sierpinski/Riesel Base 5 1 2006-03-22 01:06
Hi guys ! Crystallize Lounge 6 2003-09-27 13:08
How do you guys do this? ThomRuley Lone Mersenne Hunters 1 2003-05-29 18:17

All times are UTC. The time now is 05:08.


Sat Oct 23 05:08:45 UTC 2021 up 91 days, 23:37, 0 users, load averages: 0.94, 0.98, 1.01

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.