Hi all,

I am now working on RSA and DES encryption algorithm (college project..) Well when i was generating prime numbers i noticed one thing

3 x 3 =9 where 3 is a prime number

now the result 9-2 =7 where 7 is a primenumber

7 x 7 = 49 where 7 is a prime number

the result 49 - 2 = 47 is a prime number

13 x 13 = 169

the result 169 - 2 = 167 which is a prime number

but

373 X 373 = 139129

and the result 139129 - 2 =139127 which is not a prime

because 6049 x 23 = 139127

but 50 % of the time the result for big numbers like this yeilds another primenumber... So is there anyway i can use this method to always generate big primenumbers by eliminating the non posibility numbers as 373 x 373 shown above.. And is these any theorem or study regarding the generation of prime this way.. Please help...

thanx in advance

Vasanth

Here this is true for most of the smaller numbers and some bigger numbers.. But this does not work for all big numbers.... But you can say i got a 40 to 50 % sucess with bigger numbers in this way.....