lucas_lehmer_test
Test Mersenne numbers for primality using the Lucas-Lehmer algorithm to determine if 2^p - 1 is prime.
Instructions
Perform Lucas-Lehmer primality test for Mersenne numbers. (Domain: arithmetic, Category: special_primes)
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| p | Yes |