Sindre Sorhus/project-ideas

Module to check if a number is a mersenne prime

9 years ago

👍

See https://en.wikipedia.org/wiki/Mersenne_prime. Basically check if something is of the form:

M_n = 2ⁿ − 1

I've got no idea how difficult/easy this is in Javascript though.

sindresorhus / project-ideas

Need a JavaScript module or looking for ideas? Welcome ✨

544

Pay now to fund the work behind this issue.

Get updates on progress being made.

Maintainer is rewarded once the issue is completed.

FAQ

You're funding impactful open source efforts

You want to contribute to this effort

You want to get funding like this too