Skip to main content
Stack Overflow
  1. About
  3. For Teams

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

Python Programming on Data Structures(list)

A Mersenne number is any number that can be written as 2^p−1 for some p . For example, 3 is a Mersenne number ( 2^2-1 ) as is 31 ( 2^5-1 ). We will see later on that it is easy to test if Mersenne numbers are prime.

Write a function that accepts an exponent pp and returns the corresponding Mersenne number.

Ans- def mersenne_number(p): m_number =(2**p)-1 Mersenne numbers can only be prime if their exponent, pp , is prime. Make a list of the Mersenne numbers for all primes pp between 3 and 65 (there should be 17 of them). def is_prime(number): if number <= 1: return False

for factor in range(2, number):
 if number % factor == 0:
 return False
return True
def get_primes(n_start, n_end):
 for number in range(n_start, n_end):
 if is_prime(number):
 mersenne_number(number)
 mersennes =get_primes(3,65)

The next cell shows a dummy solution, a list of 17 sevens. Alter the next cell to make use of the functions you've defined above to create the appropriate list of Mersenne numbers. SO HOW TO MAKE THE LIST OF MERSENNE NUMBERS???

Answer*

Draft saved
Draft discarded
Cancel
1
  • 1
    Thank you for contributing an answer. Would you kindly edit your answer to to include an explanation of your code? That will help future readers better understand what is going on, and especially those members of the community who are new to the language and struggling to understand the concepts. Commented Feb 6, 2021 at 15:16

AltStyle によって変換されたページ (->オリジナル) /