An equation that states "This is the first Prime; this is the second..." etc,
and keep this in mind, the probability for finding the NEXT prime among X is:
Pˉ¹(x) ~ x / log(x)
This is called the "The Prime Number Theorem." Please give your opinion, here.
https://en.wikipedia.org/wiki/Prime_number_theorem
I have it that the number of primes not exceeding n can be
asymptotically estimated as n/log(n) .This I believe is the correct
statement.
From what I undestand there are some finer corrections to this
statement, but I dont have the info on hand.
There is the formulae of William and Minac wich give you an explicit formulae to compute the prime number. for n=1 give 2 for n=2 give 3 for n=3 give 5 etc... the problem is that it's very slow.
Thank you for your responses - they were intriguing; I hadn't seen those pages of prime info before.
I made a Prime formula in fifth Grade. Been trying to remember it. I will, in my next journal, disprove beyond a shadow of a doubt the bounded prime theorem. Please feel free to continue responses, and I hope you will look forward to my journal on unbounded primes, and I would leave you with this question...
Would THE prime equation's announcement cause less catastrophe than gain? (Seeing that primes are a huge 'factor' in cryptography).
Peter Breuer, Yitang Zhang proved in 2014 the bounded prime gap - within 70,000,000. The (only) article I published talks about it, and the fallacies within.
I meant that I found a formula that would tell you primes quickly - in a really short time, not like Minac's, and others that take forever.
There is no known "Prime Equation," that tells you all the primes, consecutively, in order. So, What would be the consequences of announcing such a hypothetical equation??
Minac's Formula got n=17 or 18 wrong - nonprime. And it lacked a lot of time efficiency. Nothing, passed 100, after that. A hypothetical formula would be not so complex, or would be 100x quicker. Please stop asking about my formula - it was a very simple elementary school-style formula that took me five minutes to find it; I can't even remember the efficiency rate.
Interesting, Peter! So, you're saying, I should never share the formula? What is the ratio of encryption using '2048,' versus public encryption not? How long would it take for banks (etc) to transition from so low a complexity estimate, and upgrade to a better complexity equation?? My guess would be 24 hours for transition. That's not too bad. Like a 'holiday'... That's worth sharing the 'formula!' SO, it's not that bad to find the formula?
Thank you for your responses again! This question is for my next journal. Any other potentially catastrophic dilemmas that it would cause? I think not, but to be on the safe side of journaling, with more facts, I could use more answers!
I think that if you had a bounded number of natural numbers, then there is a bounded number of primes refered only to that set in numbers.?
- Badges
- Science topic
- Similar topics
- Mathematics