mersenne

Determines whether \(p\) is a Mersenne number, that is such that
 \(2^p - 1\) is prime.

Provides number-theoretic functions for factorization, prime
numbers, twin primes, primitive roots, modular logarithm and
inverses, extended GCD, Farey series and continued fractions.
Includes Legendre and Jacobi symbols, some divisor functions,
Euler's Phi function, etc.

numbers

Number-Theoretic Functions

mersenne function

<dl> <dt>p</dt>
<dd>prime number, not very large.</dd></dl>

Arguments

Mersenne Numbers — mersenne

<dl>

 <dt>p</dt>
<dd>prime number, not very large.</dd>

</dl>

mersenne: Mersenne Numbers

Description

Usage

Value

Arguments

Details

References