- #1
hadi amiri 4
- 98
- 1
Is any formula that produces nth prime ?
if not visit this web site
http://www.primenumbersformula.com
if not visit this web site
http://www.primenumbersformula.com
Last edited by a moderator:
Ah, so it's just a clever way to obscure a definition by cases, and is really just sayingmorphism said:According to Maple, H(10)=2.
If you look at the formula closely, you'll notice that H(m) is going to be an odd prime whenever 2m+1 is a prime, and otherwise it's going to be 2. This follows from Wilson's theorem (2m+1 is a prime iff (2m)! + 1 = 0 (mod 2m+1)) and the behaviour of [itex] \left\lfloor\lfloor x \rfloor / x \right\rfloor[/itex]. It's really nothing special.
morphism said:According to Maple, H(10)=2.
Are you saying then that one can test whether an odd number is prime by calculating this? Wouldn't that be faster than, say, trial division by primes less than its square root?morphism said:According to Maple, H(10)=2.
If you look at the formula closely, you'll notice that H(m) is going to be an odd prime whenever 2m+1 is a prime, and otherwise it's going to be 2. This follows from Wilson's theorem (2m+1 is a prime iff (2m)! + 1 = 0 (mod 2m+1)) and the behaviour of [itex] \left\lfloor\lfloor x \rfloor / x \right\rfloor[/itex]. It's really nothing special.
Please work on this formula and find all gaps in order to fin a formula for primes
Why would you think any of those claims are true? Did you actually try to evaluate them for any value of k?huba said:Using Hurkyl's definition for H(m),
H(4) = 2, and for all k, H(4+3k)=2.
H(12)=2, and for all k, H(12+5k)=2,
H(24)=2, and for all k, H(24+7k)=2, etc.
Sure doesn't look like it.This is Eratosthenes' sieve,
Hurkyl said:Why would you think any of those claims are true? Did you actually try to evaluate them for any value of k?
hadi amiri 4 said:The range of H is
{3,5,7,2,11,13,2,17,19,...}={2,3,5,...}
so there is no problem.am I right?
HallsofIvy said:Are you saying then that one can test whether an odd number is prime by calculating this? Wouldn't that be faster than, say, trial division by primes less than its square root?
majesticman said:guys if you all were able to generate a formula that gives the nth prime...you will be rich!...correct me if i am wrong but aren't security for top secret files as well as e-commerce based on the fact that really big prime numbers (they are set as encryption keys) cannot be factorized. So good luck...i thnk it is RSA algorithm that relies on prime numbers
There already exist explicit formulas for the n-th prime, and a variety of algorithms for computing the n-th prime.majesticman said:guys if you all were able to generate a formula that gives the nth prime...you will be rich!
I should hope not -- I can factor such numbers in my head, no matter how big they are.correct me if i am wrong but aren't security for top secret files as well as e-commerce based on the fact that really big prime numbers (they are set as encryption keys) cannot be factorized..
It's already known. The primes occur precisely when we have an integer that is not a multiple of smaller integers. :tongue: Aside from that obvious fact, there are bewildering array of bulk statistics known about the primes, and a great many more that are consequences of the Riemann hypothesis.patrcik said:figures out the distribution of prime numbers
majesticman said:guys if you all were able to generate a formula that gives the nth prime...you will be rich!...correct me if i am wrong but aren't security for top secret files as well as e-commerce based on the fact that really big prime numbers (they are set as encryption keys) cannot be factorized. So good luck...i thnk it is RSA algorithm that relies on prime numbers
Kurret said:Why is the mathematical world so focused on prime numbers, why not the general case, to find all numbers with n prime factors?
Kurret said:Why is the mathematical world so focused on prime numbers, why not the general case, to find all numbers with n prime factors?
CRGreathouse said:I don't think there's any push to find (general) prime numbers -- there are too many -- but to learn how to quickly factor a number into its prime factors. This is interesting because such a factorization is unique (up to order and units), though there is still interest in factoring into coprimes and partial factorization in general.
hadi amiri 4 said:I have good news the discoverer of this formula is going to publish a book that contains many results like defining the set of twin prime numbers a formula about producing nth prime and many other top results .
hadi amiri 4 said:I have good news the discoverer of this formula is going to publish a book that contains many results like defining the set of twin prime numbers a formula about producing nth prime and many other top results .
If you don't want people evaluating your hype, then don't post it. What else are we supposed to do with it? :tongue:hadi amiri 4 said:why you don not respect others attempt
have you seen this book
why you are so judgemental
hadi amiri 4 said:why you don not respect others attempt
have you seen this book
why you are so judgemental
thompson03 said:I assume you guys are being sarcastic right?
thompson03 said:There is no formula (function) which, given an arbitrary input will guarantee a prime output, let alone, give you the primes in order.
thompson03 said:Nor has it been proven (conclusively) that there are an infinitude of twin primes.
thompson03 said:let me rephrase,
there is no function that is not based on recursion or more fundamentally on a sieve process.