Prime Number Solution???

[Trurl]

This is work I have been working on Primes. I just want to know what people that know a little about math think. (They can appreciate it more than not knowing a little trig.)

 

Here it is check it out and let me know what you think.

 

http://www.constructorscorner.com/ideas_and_gadgets/math/math_hunch/hunch_00001/just_a_hunch/prime_theory002.htm

[cosine]

Hey. So I checked out your equations and stuff. Its nice to see that you're thinking about this kind of stuff, but the truth is that your equations will "confirm" any numbers are prime. You can put any number into P1 and P2 and it will check. It works for 1 and 2, 9 and -9, even pi and i.

[Trurl]

Oops, back to the scratch paper. I didn't check my answer throughly enough. I had so many equations going...

 

Anyway, I still believe I am close. If I can find a way to relate the two different logarithmic spirals. It will be solved. The only trouble is the equations for logarithmic spirals have many different hard to solve variables.

[Trurl]

cosine,

 

did you read the equation on the link or read the earlier attempts. I still need someone to verify this but it doesn't hold true for all numbers.

 

here is the link to better explain. it is hard to write these things and organize them into the web pages.

 

Check Here,

 

http://www.constructorscorner.com/ideas_and_gadgets/math/math_hunch/hunch_00001/just_a_hunch/prime_code.htm

[cosine]

Hmm I read through them again. First of all I think I understand your motivation for using the logarithmic spiral, but don't shoot the messenger when I tell you its not likely to be as accurate as you would imagine in the sense that you would like. Secondly, the variables in your derivations are VERY hard to follow. At the beginning, please declare and write the meaning of every variable. For example:

 

Let S2 = the second prime

 

That and also be a lot more rigorous when you say "the boxed in logarithmic spiral" You should give a picture and an equation as to what exactly that means.

 

You seem to have put a lot of work into the site and I hope to see you work through these requests! In the worst case scenario where you find an error in the work, it will be a great learning exercise! And in the best case scenario you'll have discovered something new! (Though personally, I think at best what you have is a graphical interpretation of a famous theorem by Gauss, where the prime numbers less than or equal to N is approximately ln(N).

[Trurl]

Secondly, the variables in your derivations are VERY hard to follow.

 

Yes I know. I haven't written the entire work out yet. Just the rough to get some feed back.

 

Let S2 = the second prime

 

S2 is the circular arc of the second logarithm. There are two logarithms. The fact that I have related both log spirals to prime number values is what allows such a simple equation to work.

 

I drew what I refered to as the boxed spiral here

http://www.constructorscorner.com/ideas_and_gadgets/math/math_hunch/hunch_00001/just_a_hunch/spiral_primes.htm

 

For the primes I have test it seems to work. Remember you start with the last known prime and put in the value of the next number to determine if it is prime.

 

I will be posting more details on why I used the values I chose. Again if there is any questions just ask. It really takes a lot reading to fully understand, but once you get it its easy.

 

Check out the Math Hunches Section at:

 

http://www.constructorscorner.com/ideas_and_gadgets/math/math_hunch/hunch_00001/hunches_home.htm

[cosine]

Hey, nice website. You seem to have a lot of interesting thoughts. You have more work to do before I could hope to comprehend your equations.

 

First, you need to specifically define every variable in every equation you use, and explain why you are doing that which you are doing at each step of the derivation.

 

Second, you need to actually program your code to see if it works. Honestly I don't see any reason why your loop will ever terminate. Can you prove that it will?

 

You say that for this formula all you need to find the next prime number is the last prime number. Can you explain your result in terms of P2 = f(P1) ? Or if its simply to test if something is prime, please provide algorithm on how to check using your end result.

 

Also, if you are just trying to check if a given number is prime, it would be very efficient to use something called Miller's Test.

 

Please write everything out in as excruciating and mundanely detailed manner as possible!

[Trurl]

Ok, I am working on a write up, but might take a while. The easiest way to follow the equation now is with the example of 19 and 23. Basically you put those two numbers into the two main equations and solved for X using the quadratic equation. Then you put 19 and X into the given equation and you have 23. It works for the Primes I have tried.

 

I am also trying to write a simple loop in C++. I am not really a good programmer so this also might take some time.

 

The theory is there. There is merit behind the idea of relating the 2 logarithmic spirals. Just the results have to be verified. Thanks for you input cosine. There is much to this problem that needs explored.

[Trurl]

I've added a summary, that shows the log spirals and has the work of finding the equations. Remember everything comes from the geometry of the log spirals. Then S = r * theta; a quadractic equation to find x; and then the previous Prime number is compared to the unknown Prime.

 

http://www.constructorscorner.com/ideas_and_gadgets/math/math_hunch/hunch_00001/just_a_hunch/prime_summary.htm

 

I know it is a lot of reading. Let me know if this better describes the problem.

 

Trurl

[Trurl]

I am still working with Prime numbers. I have some good ideas, just need to see what someone with some math knowledge has to say. You'd be suprised but most people I know aren't it to math. But luckly probably everyone who views this forum is.

 

Here is my latest work. I expect there to be many errors since it is incomplete. However, the concept is there. So let me know what you think.

 

The link for the new work is:

 

http://www.constructorscorner.com/ideas_and_gadgets/math/math_hunch/hunch_00001/just_a_hunch/spiral_encryption.htm

 

Trurl

[Trurl]

Ok so I tried to make a program that solves the log spiral. It was true for all values. So the program was a lot of work and was just a stupid, amateur error. Hey but that’s ok because I am an amateur mathematician.

 

This time however there is more to the work. Though it is very much incomplete it is a great outline or concept. Yes, it probably doesn’t work like so much of my solutions do, but if there was a simple, elementary mathematic way to solve for Primes this would be it.

 

Be sure to read the supporting work. Or just download the 36 page PDF which has most of the work except for a few recent comments/corrections.

 

Please fell free to comment here or explain which math laws or definitions I am breaking.

 

Download the PDF Here

 

-------

View the latest work Here

 

 

Thanks for the input,

Trurl

[WarriorClass III]

Here is the solution for all primes:

 

https://sites.google.com/site/primenumbertheory/home/the-prime-thesis

 

The program to run this is also included, and you don't need a super computer to run it.

 

Here is the solution for all primes:

 

https://sites.google...he-prime-thesis

 

The program to run this is also included, and you don't need a super computer to run it.

Don't try this at home; I am a professional Russian:

 

 

http://www.youtube.c...d&v=WOoUVeyaY_8

 

https://sites.google...menumbertheory/

[adventureswithjim]

404 is not prime! That's what I got when I clicked on all your links, dead pages. What up?

[Daedalus]

I have found something very interesting on generating prime numbers:

 

http://www.primenumbersformula.com/

 

I have checked the equations using Mathematica and so far they do produce primes.

I would like to see what you guys have to say about these equations.

 

Also, the links to your site aren't working. So I can't see the math you are doing.

Edited September 28, 2011 by Daedalus

[baric]

Not even close.

 

Look at the method for 5a... to find the Kth prime number, you'll need to iterate through a list of K-1 primes to determine it. This is not a formula, but an iterative algorithm.

 

 

This is why he demonstrates with things like the 4th prime, so that he doesn't have to expand the algorithm so much that it makes this flaw obvious.

 

If his formula could actually predict the Kth prime, he could simply use it to calculate a currently unknown prime (say, the 1,423,335,345rd prime) and then wait for computers to verify it that it is indeed correct

Edited September 28, 2011 by baric

[Daedalus]

I never stated that it actually predicts all of the primes. I stated that it generates primes. Sorry, I wasn't clear on that. But being a generator of primes, it is very interesting.

[imatfaal]

You will find many of the same equations here - but in much nicer formats, with better explanation, and less padding

 

http://mathworld.wolfram.com/PrimeFormulas.html

 

AS it is 5 or so years since the good professor first claimed to have proved riemman hypothesis and he still hasn't collected the substantial prize I wonder if the clay institute are less than convinced

[baric]

I never stated that it actually predicts all of the primes. I stated that it generates primes. Sorry, I wasn't clear on that. But being a generator of primes, it is very interesting.

 

oh, ok. That was my misunderstanding.

 

However, the generation of primes is well-trodden ground. This really does not represent any sort of landmark breakthrough as described by the author.

 

In addition, it looks incredibly inefficient. In his example 5b, to find the Kth prime, he has to perform 2^k iterations. That is absurdly inefficient compared to other methods of generating primes.