Prime number secrets revealed

Deepan K S ( 1st year , NITK

Among the whole numbers , the numbers which always fascinate me are the prime numbers ! !A prime number is divisible only by itself and 1 .Suppose I consider a sequence of even numbers { 0 , 2 , 4 , 6 , …. } . General term of the sequence of even numbers is 2n , where n = 0 , 1 , 2 , 3 ….Similarly, for a sequence of odd numbers { 1 , 3 , 5 , 7 , …. } , the general term would be 2n+1 , n = 0 , 1 , 2 , 3 , …But if I consider a sequence of prime numbers { 2 , 3 , 5 , 7 , 11 , ….} , till now we haven’t found out a way to get the general term of this sequence of prime numbers !!The ancient Greek mathematician Euclid proved that there exists an infinite number of prime numbers using basic calculus .There are no direct formula or a fast method currently available to check whether a number is a prime number or not . There are algorithms to check whether the number is prime or not , but they are time consuming. Prime Number play a huge role in the assymetric encryption of public-private key 🔑 using *RSA* ( Rivest-Shamir-Adleman algorithm ) . It involves factorization of a number into two prime numbers .The larger the two prime numbers, the factorization becomes more difficult and slower . This method is commonly used in encrypting ( public – private key ) the messages .Prime numbers are the one of the most amazing things ! I have come across in the world of maths, which we have least understood. Exploring it further will make a huge difference in the future of science and technology ! – Deepan K S ( 1st year , NITK )