Skip to content

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.

Notifications You must be signed in to change notification settings

anupamasridhar/Mersenne

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 

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.

Topics

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published