![]() |
|
|
#12 |
|
"Kieren"
Jul 2011
In My Own Galaxy!
2×3×1,693 Posts |
Thanks, Mini-Geek, and all other responders. I have unreserved the exponent.
One additional question to cheesehead- Why is the assignment key something to be removed? I don't care if it is, but if that is the sort of thing NOT to post in the forum, I'd be happy to know for future reference so as not to do it again. |
|
|
|
|
|
#13 | |
|
Dec 2010
Monticello
179510 Posts |
Quote:
There's that ever so slight chance that the exponent you are testing is indeed prime. In that case, it's your good name that won't go into the literature! |
|
|
|
|
|
|
#14 |
|
"Kieren"
Jul 2011
In My Own Galaxy!
2·3·1,693 Posts |
Thanks for the explanation, Christenson. I guess that I'm not greatly concerned about the record books, though credit would be nice. However, the line in question would be easy to obliterate, should such a post be needed in the future.
I run GIMPS for a couple of reasons: One is that I just like the idea of pure research. It lets my computer do something useful when I don't want anything from it. Another is that I had a friend, long deceased, who did complex math for recreation. FFT's were something he talked about. I could sort of follow his explanations. In that sense, my GIMPS contributions are a memorial. I like to think that my friend would have appreciated it. |
|
|
|
|
|
#15 |
|
Jun 2003
7·167 Posts |
|
|
|
|
|
|
#16 | |
|
Dec 2010
Monticello
5·359 Posts |
Quote:
If one of your machines actually gets lucky and finds a mersenne prime, be sure to acknowledge your friend to the world by name. Probably the best explanation of the FFT I have seen is in the book "Numerical Recipes in C"(or Fortran, or your favorite programming language), many years ago in the late 1980s/early 1990s. |
|
|
|
|
|
|
#17 |
|
"Kieren"
Jul 2011
In My Own Galaxy!
1015810 Posts |
Thanks for your kind words, Christenson. I shall remember them on the outside chance that a prime falls in my lap.
I am not sure that I would be up to the explanations on FFT's. Mark had a way with words. He died at 38 in 1991 before he or I had PCs. He ran such calculations on his HP programmable calculator. I still have it somewhere. |
|
|
|
|
|
#18 | |
|
"Richard B. Woods"
Aug 2002
Wisconsin USA
22×3×641 Posts |
Quote:
Like this: Test=xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx,52390157,69,1 or Test=assignmentkey,52390157,69,1 or whatever such as that. |
|
|
|
|
|
|
#19 |
|
"Kieren"
Jul 2011
In My Own Galaxy!
1015810 Posts |
Thanks! Got it.
|
|
|
|
|
|
#20 |
|
Dec 2010
Monticello
5×359 Posts |
Here's our local explanation of the FT, in case you want to work on it.
http://mersenneforum.org/showthread.php?t=120 There are some recursion relations that aren't discussed there, but are discussed in Numerical Recipes. enjoy |
|
|
|
|
|
#21 |
|
"Kieren"
Jul 2011
In My Own Galaxy!
2×3×1,693 Posts |
Thanks. I'll have a look. I did read some of the articles on Wikipedia on FT's and FFT's, but I don't even understand some of the notation. This would appear to be a serious problem, eh? I will try, though.
Thanks again. I do appreciate the suggestion and the link. |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| What does * represent on Recent Results report? | petrw1 | PrimeNet | 5 | 2018-07-09 21:14 |
| recent cleared list | ramgeis | PrimeNet | 8 | 2016-05-14 23:51 |
| Recent Results/Factoring | Primeinator | PrimeNet | 4 | 2014-10-26 00:56 |
| Primenet Recent Results Request | garo | PrimeNet | 7 | 2014-02-03 02:53 |
| List of recent exponents that have been passed out | jasong | PrimeNet | 5 | 2007-05-18 22:56 |