![]() |
|
|
#12 |
|
Aug 2002
Termonfeckin, IE
22·691 Posts |
How about using math related titles?
One example: Euclid Archimedes Eratosthenes Euler Gauss Fermat Sophie (Germain) Mersenne Reimann etc. Of course trying to sort the above names into order of importance would be a controversial task. Another example: Prime Number Mersenne Number Sophie Number Fermat Number Amicable Number Perfect Number in increasing order of rarity...... You could also add Mersenne Prime and then Fermat Prime of which only 39 and 4 are known respectively. You get the drift...... Garo |
|
|
|
|
|
#13 |
|
Aug 2002
23·32 Posts |
FYI, there are equally as many of perfect numbers as there are Mersenne Primes. A perfect number is (2^p-1)((2^p) -1) if M(p) is prime
|
|
|
|
|
|
#14 |
|
Aug 2002
Termonfeckin, IE
22·691 Posts |
Yeah Tasuke,
That's why in the list Mersenne Numbers - of which there are infinite is higher up than Perfect Numbers. And Mersenne Prime would come at the same level as Perfect Number. Anyway this is not a mathematically sound system since theoretically there are infinite numebr of primes and therefore infinite number of Mersenne Numbers. But it's just a set of catchy math related names. The ordering will have to be a bit arbitrary.... |
|
|
|
|
|
#15 |
|
Aug 2002
668 Posts |
# of perfect numbers > # of Mersenne primes; because there are perfect numbers that are not Mersenne primes.
|
|
|
|
|
|
#16 |
|
Aug 2002
Ann Arbor, MI
1101100012 Posts |
No, there are an equal number of mersenne primes and perfect numbers.
If 2^p -1 is prime, then {2^(p-1)} * {2^p -1} is a perfect number. And that's the only way to get perfect numbers, so for every mersenne prime, there is a corresponding perfect number |
|
|
|
|
|
#17 |
|
Aug 2002
3616 Posts |
Gosh, I hadn't realized that was the only way.
Garo, many apologies! ops:
|
|
|
|
|
|
#18 |
|
"Mike"
Aug 2002
25·257 Posts |
What just happened? My head hurts!
:)
|
|
|
|
|
|
#19 |
|
958110 Posts |
There could be more perfect numbers than mersenne primes because there may be those odd perfect numbers that are not in the form of (2^(p-1))((2^p) -1) where 2^p-1 is prime(mersenne prime).
|
|
|
|
#20 |
|
Aug 2002
Ann Arbor, MI
433 Posts |
"Mathematicians have so far proved that if an odd perfect number exists, it must have at least 300 digits, and at least 29 prime factors (not necessarily distinct)."
Mathematical Treks by Ivans Peterson Since one hasn't been discovered, and they haven't been proven to exist, I assumed they didn't, and just left them out. [edit] Probably should've mentioned that the first time. Disregarding that case was bad mathematical form. I was going for a simple answer, but I'll remember to include all the assumptions / weird cases for math stuff in the future. [/edit] |
|
|
|
|
|
#21 |
|
"Mike"
Aug 2002
25·257 Posts |
I am going to put the ranks on hold for a while... They generate a lot of database queries and they really add nothing useful to the forum... Possibly in the future we will use that space for something more interesting...
|
|
|
|
|
|
#22 |
|
Aug 2002
23×32 Posts |
Not an hour after I go up to the next rank. Man you are quick. :( ;)
|
|
|
|