ONE CRITERION FOR DIVISIBILITY MERSENNE NUMBERS
Problems of prime numbers have a history of century. One of the tasks is to determine the numbers of simplicity, is the a number of simple or not. Among the special primes have Mersenne primes. And there is a question of finding and determining their simplicity. This article discusses an alternative method of checking the simplicity of the method Mersenne Lucas-Lehmer and provides a comparative analysis of these methods to solve this problem.