Lucas-Lehmer test: Difference between revisions

Content added Content deleted
(C++ version)
(→‎{{header|C++}}: As far as I got after 36 hours of computation)
Line 199: Line 199:


Output: (Incomplete; It takes a long time.)
Output: (Incomplete; It takes a long time.)
M2 M3 M5 M7 M13 M17 M19 M31 M61 M89 M107 M127 M521 M607 M1279 M2203 M2281 M3217 M4253 M4423 M9689 M9941
M2 M3 M5 M7 M13 M17 M19 M31 M61 M89 M107 M127 M521 M607 M1279 M2203 M2281 M3217 M4253 M4423 M9689 M9941 M11213 M19937 M21701 M23209

=={{header|Java}}==
=={{header|Java}}==
We use arbitrary-precision integers in order to be able to test any arbitrary prime.
We use arbitrary-precision integers in order to be able to test any arbitrary prime.