Encryption Formula: In the True Light of Science

{LANG_NAVORIGIN} Encryption
By: Ahmed Akande, 09/19/2005



In the true light of science, prime as being the major heart felt problem for generation. There simplicity, complexity and their irregularities in sequence. Knowing the exact formular for prime has been a problem as proven the Riemann Hypothesis. With the proof of Fermat’s last theorem in 1994, John Derbyshire the Author of the Mathematical unknown says “The Riemann hypothesis is now the great white whale of Mathematical research” Even before that, it was regarded by mathematicians as the more significant problem though not as old as Fermat’s last theorem.

One aspect of prime number that has intrigued both professional and amateurs is the lore that has built up around special primes.

Numerologies have enjoyed the connection with perfect numbers and determination of Fermat’s primes (Primes of the form)

           22n + 1

has inspired some of the largest computation in history.

The proof of a formular for prime, experimented and formulated by l and Milton Van Sickle an American in our quest of proving the Riemann Hypothesis, has brought a new dimension to prime as a whole.

All prime are of the form X + 1 when X is odd, X = 1 only that is, the only even number prime is 2. For all X > 1, where X is an odd number, X + 1 is non-prime (since X + 1 is divisible by 1, 2, and X + 1). Therefore all other primes are odd numbers of the form X + 1, where X is an even number, when X + 1 has an even - numbered X, all X + 1 are prime except, when

           X = 2 (ab + (a-1)/2)

Where a = 3, 5, 7, 9, 11, 13 ……… and b = 1, 2, 3,……….
For instant, a = 3, b = 1 gives us 4 (3 + 1) times 2 = 8 + 1 = a non prime. a = 3, b = 2 gives us 7 (6 + 1) x 2 = 14 + 1 = 15 a non prime and so on.
When

X = 2 (ab + (a-1)/2)

where a = 3, 5, 7, 9, 11, 13 ……… and b = 1, 2, 3, …… then X + 1 is non prime.

If a = 3, b = 1, you get 2 (3 x 1 +(3-1)/2 +1) which is 8 + 1 = 9 the least odd number non-prime
For a = 3 and b = 2, 2(3 x 2 + (3–1)/2) + 1 = 15, the second odd number non-prime and so on OR a = 5 and b = 1 ……………. 2(5x1+(5-1)/2+1 = 15
a = 7 and b = 1 2(7x1+(7-1)/2 +1=21
a = 9, b = 1 2(9x1+(a-1)/2+1 = 27 much more simplified that the 6x+1 and 6x-1 (which omits 2 & 3) 2 is x + 1 where x = 1, 3 is x + 1 where x = 2, 5 is x + 1, 3 is x + 1 where x = 2, 5 is x + 1 where x = 4, t is x + 1 where x = 6. We have taken care of the non-prime where x = 8, 11 is x + 1 where x = 10, 13 is where x = 12, we have taken care of x=14 and so on,

The formular x + 1 where

X = (ab + (a-1)/2) are prime except when
X = 2 (ab + (a-1)/2)

This generates primes from the least to the largest prime you ever needs. As long as a are olds and b is any integers from 1, 2, 3, 4……

Proving that x + 1 is always prime where

           X = (ab + (a-1)/2)

except when X = 2 (ab + (a-1)/2)

is difficult though it is always true experimentally but mathematically.

According to John Derbyshire “Everybody knows that in mathematics you must prove every result by strict logic” that is true in the sense that a strict proof of everything is sought, but it is not true. If it means that anything not proved is not yet part of the mathematics. If that were true, there would be no book about the Riemann Hypothesis, since it is not proved.

The most famous application of prime numbers to general culture came in the mid 1970s, where primes were shown to be the basis of radically new and presumably secure type of encryption now known as the RSA methods. Before this developments number theory had played an important role in diverse area of science. Prime numbers covers some of these applications in depth, such as the use of primes in the generation of random numbers and in the evaluation of multidimensional integrals.

The encryption system relies on the fast generation of large prime numbers (and the extremes) the fact that factorizing is most likely, computationally hard is what makes the cryptosystem secure.

One of the most useful applications of large number is in the construction of secret codes. These codes are base on numbers that are the products of the very large prime numbers. The reason such codes are very difficult to break is that, there is no quick method for finding the prime factors of large prime numbers.

In nature, primes are the key to the survival of a strange species of insect; the prime number cicadas hide in the ground for 17 years, and then emerge en masse from the earth into the forest. They sing loudly, mate, lay eggs and then die after five weeks of intensive partying. The forest goes quit again for 17 years.

But why did the encades choose 17, a prime number for their hibernation? Scientists believe there is a predator that likes to crash their party and also emerges periodically after a certain numbers of years.

The encades found that by choosing a prime number cycle for their party, they could keep out of step of the predators more often than if they had chosen a non-prime such as 15.

For the cicadas, prime are not just some abstract curiosity, but the secrets to their survival.

Mathematicians are interested in prime number because they form the building blocks for the natural numbers in the same way that atoms form the building blocks for more complex molecules.

Every natural number can be factored into a product of prime number, the prime numbers being the indivisible “atoms” of our number system.














Your IP address will be sent with this e-mail

From e-mail to e-mail