question: prime's

P

PlashedVentral

Temporal Novice
question: prime\'s

I think I found something. I looked on the web for a proof, but could not find it.. This is the accidental result of work in a compression algorithm I've been working on for over 5 years..

Now, take the definition of PI: the ratio of the circumference to the diameter of a circle

If I were to say, I found a ratio of certain aspects of a geometric shape that can be any size maintaining the aspect ratio, that reveals the differences between sequencial prime numbers, i.e.:

primes are: 2,3,5,7,11,13, etc.. the difference is (start at 0): 2,1,2,2,4,2, etc. (2-0,3-2,5-3,7-5,11-7,13-11,etc..)

If I were to tell you this irrational number is 2.12242, etc. keeping with that pattern... If I were to say I've proved the first 10,000 digits of this irrational number...

Would that be worth anything? Has this been discovered?

Thanks..
 
Re: question: prime\'s

This has already been discovered.

one of my specialties has been work with prime numbers and pi.

Here's a neat little trick, take any number no matter how large. compress with addition to just 1 number. ie 17 = 1 + 7 = 8. and 234 becomes 2+3+4 = 9. doesn't matter how many digits the number is. Once compressed into just 1 number, if that number is a 3, 6 or a 9 then it cannot be a prime number.
 
Re: question: prime\'s

ren, can u give me a link to that discovery? i cant find it anywhere.. thx..

the only problem with that trick is it doesn't work for the number 3, and doesn't identify primes.. nonetheless, it's certainly interesting.. im sure you're familiar with
(2^(k-1) mod k = 1):true=prime
 
Back
Top