Talk:Find numbers n in base 2 where n is prime and all it's digits are 1

From Rosetta Code

Task already exists

Numbers in base 2 whose digits are all one are the powers of 2 minus 1. These are called Mersenne primes and there is already a task for finding them up to a limit. See http://rosettacode.org/wiki/Mersenne_primes. --Chunes (talk) 02:04, 9 March 2021 (UTC)

Retrieved from "https://rosettacode.org/wiki/Talk:Find_numbers_n_in_base_2_where_n_is_prime_and_all_it%27s_digits_are_1?oldid=308906"