Lucas Lehmer Test for Mersenne

Lucas Lehmer Test for Mersenne


It performs the standard LL test.
Given an exponent X, it checks if 2^X - 1 is a mersenne prime number.
The code is not optimized.
Warning: No warranty, use at your own responsability.

Recent changes:
Now should work with older versions of android (1.6 or later), and I added as scroll bar to read the whole text.
Add to list
Free
83
4.2
User ratings
5
Installs
100+
Concerns
0
File size
154 kb
Screenshots
Screenshot of Lucas Lehmer Test for Mersenne Screenshot of Lucas Lehmer Test for Mersenne
About Lucas Lehmer Test for Mersenne
It performs the standard LL test.
Given an exponent X, it checks if 2^X - 1 is a mersenne prime number.
The code is not optimized.
Warning: No warranty, use at your own responsability.

Recent changes:
Now should work with older versions of android (1.6 or later), and I added as scroll bar to read the whole text.

User reviews of Lucas Lehmer Test for Mersenne
Write the first review for this app!
Android Market Comments
A Google User
Jan 2, 2015
Fake, deceiving, does not really test. Uses a list of known Mersenne primes. Probably as an array. Uses knowledge that the algorithm is approximately n^2 time completity (without FFT multiplication) and makes the loading bar take longer for higher numbers. You can look at the CPU usage overlay or even a system monitor app and you can see that it is not using any noticeable CPU time. If it were real, it would provide feedback like Prime95 does and would actually tell you the residue. This developer is the scum of the earth. I will be reporting.
A Google User
Sep 18, 2012
Un gran programa para todos los que nos gustan los numeros primos.
A Google User
Sep 18, 2012
Un gran programa para todos los que nos gustan los numeros primos.
Version 1000000
Version 1000000