![]() |
|
|
#1 |
|
"Matthew Anderson"
Dec 2010
Oregon, USA
11·109 Posts |
The prime pages are so cool.
Chris Caldwell. Has helped me. See. Primes.utm.edu |
|
|
|
|
|
#2 |
|
"Matthew Anderson"
Dec 2010
Oregon, USA
100101011112 Posts |
To put it simply, all integers have the same value.
A larger number is not better than a smaller one. This also goes for prime numbers. Just because I do calculations of small numbers, doesn't mean that those data are less important than giant Mersenne numbers. That is all. |
|
|
|
|
|
#3 | |
|
Sep 2002
Database er0rr
124D16 Posts |
Quote:
Last fiddled with by paulunderwood on 2022-02-15 at 05:53 |
|
|
|
|
|
|
#4 |
|
"Curtis"
Feb 2005
Riverside, CA
2×2,927 Posts |
If you think Mersenne primes unimportant, I suggest you find a forum not named after them to post your ramblings.
|
|
|
|
|
|
#5 |
|
Jun 2003
23×683 Posts |
One way to define the value of something is to look at its rarity. In that sense, bigger primes are rarer, and therefore more valuable than smaller ones.
Another way is to look at how costly it is to "produce" something. In that sense, primes that took longer to compute are more valuable than primes that are easier to compute. Yet another way is to look at the utility of something. In that sense bigger prime numbers are more valuable, say, in cryptographic application. Of course, the mersenne primes aren't useful for these, because they are too rare. OTOH, mersenne primes (and mersenne factors and fully-factored mersennes) have their own mathematical applications as well. Finally, in the subjective sense, your own mathematical musings are more important to you than other people's. Only in this very narrow sense that your original statement is accurate. So please do what you want. However, if you're posting about it in public, take care to present the results in a meaningful easy-to-understand way. Keep things well-organized. |
|
|
|
|
|
#6 |
|
Feb 2017
Nowhere
13·17·29 Posts |
You have not explained what you mean by "value." From what you have written, your meaning seems to be "I like."
This seems to me to be a narrow view. The integers are a mental construct of the human mind, a pure abstraction, and have no intrinsic value. Any value to humanity that can be assigned to them is extrinsic. An individual likes pairs of small primes which differ by, say, 46. OK, fine. But just about anyone with a computer and an Internet connection can reproduce a list of such primes on their own in seconds, if they also happen to like them. OTOH, dealing with Mersenne numbers having even modestly large prime exponents requires more computing effort than any one individual can command. And so it came to pass, that GIMPS was born. The importance of large Mersenne numbers has gone far beyond what Martin Gardner called "the useless elegance of perfect numbers" or whether Mersenne's guesses of which prime exponents yielded prime numbers were correct. Indeed, were it not for the pursuit of finding factors of Mersenne numbers and identifying Mersenne primes, this Forum would not exist, so you would not have the opportunity to post here. Thus, "giant Mersenne numbers" have an importance to you personally which pairs of small primes differing by 46 do not. Some possibly interesting questions about pairs of primes differing by 46: They need not be consecutive primes. In fact, consecutive primes differing by 46 are fairly thin on the ground, at least initially, compared to all pairs of primes differing by 46. so, one may ask: How many "admissible k-tuples" are there whose first and last terms differ by 46? How large can k be? And what is the relative contribution of each to the pairs of primes differing by 46? |
|
|
|
|
|
#7 |
|
Feb 2017
Nowhere
13×17×29 Posts |
It occurred to me that, for each prime p, there is a "non-Archimedean valuation" (p-adic valuation) of the integers/rational numbers, and there is a p-adic completion for each. However, the valuations defined by two different primes are inequivalent. (This means that the p-adic valuations for different primes define different topologies.)
|
|
|
|
|
|
#8 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
3·7·17·31 Posts |
|
|
|
|
|
|
#9 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
6,793 Posts |
|
|
|
|
|
|
#10 |
|
"Matthew Anderson"
Dec 2010
Oregon, USA
11×109 Posts |
First, I appreciate all the input. I respect your opinions. Now I copy and paste from note pad and add another file.
I did not say that Mersenne primes are unimportant. I simply stated that small primes are not unimportant. My blog posts are not ramblings. That is your opinion. As far as I know, nobody has shared a list of 2 tuples 46 apart, before I did it. This data needs to be shared. I admit that some of my calculations are quick, like one second of computer time. I have done other prime constellation calculations that are more that 2 hours of computer calculation (or more that 2 days!) This data is rare because if you want to see it, you have to calculate it yourself. It is not yet shared. I love the Mersenne project. Don't get me wrong. I have a computer running 24/7 toward our cause. I also like to do my own coding sometimes. Also, this 'blog is public so I appreciate other people's opinions. Another good point. There is no immediate monitary value in an integer. It is just a number. It may take weeks of computer time to be sure about a number, or it may take a short time to churn out a new data set. Both are important. I like that phrase "the useless elegance of perfect numbers". So far, less that 60 perfect numbers are known, but if we, as a team, keep using our computers as calculators, we will find more. Maybee one a year or less, but we are making progress. It is worth it. Another good point, when the pairs of prime numbers are 46 apart, or more, then they are not neccessarily consecutive prime numbers. Many people know that for prime numbers bigger than 6, all prime numbers are of the form 1/-1 mod 6 and when we consider mod 30, the wheel becomes more complicated. I am not making an apology, and I am not done with my "pairs of prime numbers" project. There is more to do on this project. how large can 'k' be for k-tuples? This is a good question. My intuition is k can be arbitrarily large. There is no 'conspiracy' in the number line, to quote Terrance Tao. Have a nice day. |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Congruent prime numbers that preserves the modulo as the largest prime factor of the sum | Hugo1177 | Miscellaneous Math | 5 | 2021-02-11 07:40 |
| Pentium 4 (P4) Equivalent | Matthew | Hardware | 5 | 2018-11-08 08:16 |
| An equivalent problem for factorization of large numbers | HellGauss | Math | 5 | 2012-04-12 14:01 |
| PIV Effective Equivalent curiosities... | petrw1 | Software | 0 | 2009-12-05 04:41 |
| Equivalent code | dsouza123 | Programming | 25 | 2005-10-08 05:10 |