The Riemann Digits ½ , Zero ( 0 ) & My 9.

Prime numbers and the Riemann Hypothesis digits are all intertwined. A prime number is defined as a number that can only be divided by itself and one ( 1 ) ( 1, 2, 3, 5, 7 ).

Here's the skinny on prime numbers:

1. Prime numbers, if they are prime numbers, have the digits 1, 3, 7, 9 in column 0 ( farthest right column ) ( 11, 13, 17, 19 ).

2. If the sum of the digits of any number ending in 1, 3, 7, 9, total a multiple of 3, except for 3, ( for instance total 6, 9, 12, etc. ) it isn’t a prime number.

3. If a number ending in 1, 3, 7, 9 in column zero (0), isn’t a prime number it can usually be evenly divided by a number with 1, 3, 7, 9 in column (0). If not try other numbers.

The calculation of the location of the prime numbers on a line or calculating the number of previous primes on a line involve the digits ( ½, 0 & 9 ). Riemann in his Riemann's Hypothesis said that the zeros in his hypothesis all have the value of ½ and lie on the line ( y = ½ ) . Riemann also said that the zeros can be manipulated ( positions changed or zeros added ) in order to get the primes closer to their true location. I have separately discovered that the location of the prime numbers on the line ( y = ½ ) or any other line for that matter involves the digit 9.

The primary number for the location of a prime on any line from the Riemann Hypothesis is ( .509999 ). For the primes ( 1, 2, 3, ) you multiply them by ( .99 ) since their actual positions are ( 1, 2, 3 ). For the primes (5 to 23 ) you multiply them by ( .509999 ). For the primes 29 & 31 you multiply them by ( .509999 ) and subtract Pi ( 3.141592654 ) to bring them closer to their true position.

For the rest of the primes up to 97 you raise ( .509999 ) to the power of 2 and adjust using either Pi or the natural number e ( 2.718281828 ).

In summary, Riemann anticipated the number ( ½ ) & ( zero ( 0 ) and zero adjustment, but missed my discovery of the number 9 and the necessity of Pi and ( e ).

For calculating the location of any prime you:

1. Count the number of digits in a prime number. For instance 7919 has 4 digits. Subtract 1 from the number of digits ( 4 - 1 = 3 ) for 7919. Form another number equal to the number of digits in 7919 ( 4 ) by putting ( .5 ) in the far left column and 9 in the far right column. ( .5—9 ). Fill the middle with Riemann Hypothesis zeros ( 0 ) forming a four digit number ( .5009 ). Raise ( .5009 ) to the power of 3 ( which is the number of digits in 7919 ( 4 ) minus 1 ( 4 - 1 = 3 ). ( .5009 ) ^ 3 = .125676215. Multiply 7919 X .125676215 which equals 995.2299524. 7919 is the 1000th prime. The answer is out by approximately 5. Adjust the error by adding or subtracting Pi or (e).

It would seem from the above, that Riemann anticipated the zeros ( 0 ) and the value of those zeros being ( ½ ) since they were on the line ( y = ½ ). Riemann didn't anticipate the number 9 or the option of adjusting the calculation by adding Pi or ( e ).

The Clay Mathematics Institute is offering a $1,000,000 prize for the solution to the Riemann Hypothesis. From my reading, it seems to involve proving whether or not all the zeros lie on the line ( y = ½ ) . Since I have shown how the Riemann Hypothesis relates to the location of the primes and by extension how many primes precede that prime ( counting 1, 2, 3, 4 ), it seems to me it is largely academic as to whether all the zeros lie on the line ( y = ½ ) .