User:Getykoon

New romanian recent discovery !!! Description of the first easyest, pure and perfect primality test :

LG theorem For a given number p > 2, to test the primality of p then the only one condition is : if 2^p modulo p = 2       -> the number p is prime else 2^p modulo p <> 2       -> the number p is composite Example 1  given number  p=11 2^11=2048     2048 modulo 11 = 2   -->  11 is prime Example 2  given number  p=9 2^9=512         512 modulo 9 = 8 -->  9 is composite Primary souce from the autor LG (20.08.1997)