GitHub - anupamasridhar/Mersenne: This program uses Java in order to check if a number is a Mersenne Prime. A Mersenne Prime is defined as a number that can be written as M(n) = 2n − 1 for an integer n.

anupamasridhar / Mersenne Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

This program uses Java in order to check if a number is a Mersenne Prime. A Mersenne Prime is defined as a number that can be written as M(n) = 2n − 1 for an integer n.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
Main		Main

About

This program uses Java in order to check if a number is a Mersenne Prime. A Mersenne Prime is defined as a number that can be written as M(n) = 2n − 1 for an integer n.

java prime-numbers numbertheory

Activity

0 stars

1 watching

0 forks

Report repository