Jump to content

Help with math equation


Freeman

Recommended Posts

i assume that freeman is talking about a prime number generating function.

 

"Legendre showed that there is no rational algebraic function which always gives primes. In 1752, Goldbach showed that no polynomial with integer coefficients can give a prime for all integer values"

 

taken from

 

http://mathworld.wolfram.com/Prime-GeneratingPolynomial.html

 

and if it works to 1000 then i am sure you can use mathematical induction somehow

Link to comment
Share on other sites

Like dave said, unless you can prove your formula for all primes in general, it can't be called a proof.

 

If all you're doing is hard number crunching [like the GIMPS project], then it's not really a proof; just finding more primes.

 

I'm interested in your claim though ... any hints as to how you are going about these results? Mersenne numbers? or maybe Chebyshev said it, and I say it again. There is always a prime between n and 2n...

 

[edit]

 

That's a nice link you posted there bloodhound.

Link to comment
Share on other sites

You can't patent pure mathematical algorithms, as far as I know.

 

And you haven't got this 'proof' thing down, have you. You have to prove it for all possible numbers, not just 1,000, 10,000 or whatever.

 

Because of the nature of infinity, with number crunching, you're not actually decreasing the possibility of it being wrong, you know.

Link to comment
Share on other sites

Assuming I am still correct...

 

Then there will be a meeting of great prof's to all talk and see if it correct.

 

and then.......... well maybe on tv. Or get some king of an award.

 

But i'd put it on scienceforums on here, remember you still wrote it first so its yours, and you'll have all your workings out.

Link to comment
Share on other sites

Hmmm... all right, just remember: patent pendin! And I thought of it first! I'll sue you!

 

[math]\big_{n=2}^\infty gn[/math] (this is 'a') where g is every positive prime integer, beginning with 2, 3, 5, 7, 11, and 13. You do not find prime numbers, but nonprime numbers! And then [math]\big_{n=2}^\infty n^n'[/math](this is 'b') Where n' is every number beginning with 2, irrelevant to what n is. So, the set of all positive integers minus the set of {a+b}, that is to say, the numbers found in the solution of a and b.

Link to comment
Share on other sites

LaTeX renders fine.

 

[math]n = \sum_{n=2}^{\infty} gn[/math]

 

etc.

 

You almost certainly need to define that function in a much more rigorous mathematical fashion before it's taken seriously. I don't really understand what you're getting at atm.

Link to comment
Share on other sites

g is every prime integer starting with 2, 3, 5, 7, 11, and 13. You plug in 2-100 for each prime, and the numbers not found are prime. You add those numbers to the list and do the same for the next 100 numbers. I cannot do it too fast :( soo, I need a computer to do it. But anways...

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.