How to find Mersenne Primes, gcds, divisors, and calculating the Euclidean Algorithm with Maple
#numbertheory
Find the remainder and integer quotients
Find the divisors and the sum of divisors of an integer
Find the GCD of two integers
Find Mersenne Primes.
Code:
with(NumberTheory):
irem(15, 10)
iquo(20, 3)
irem(20, 3)
Divisors(92)
SumOfDivisors(92)
g := igcd(45, 105)
igcdex(45, 105, 'a', 'b')
` g = a*45 + b*105 = igcd(45, 105)`
[a, b]
-2*45 + 105
#MersennePrimes. They are of the form 2`^n - 1, where*n*is*a*prime*number!
2^7 - 1
IsMersenne(127)
IthMersenne(10)
2^89 - 1
IsMersenne(521)
IsMersenne(63)
2^521 - 1
