Instructions: In this task, you are given a passage and a question regarding that passage. You must determine whether or not the question is answerable from the given passage. If a question is answerable, output should be 'True', otherwise 'False'. You must not consider any other information that is not provided in the passage while labelling True or False.
Input: Passage: are prime. Prime numbers of this form are known as factorial primes. Other primes where either p + 1 or p 1 is of a particular shape include the Sophie Germain primes (primes of the form 2p + 1 with p prime), primorial primes, Fermat primes and Mersenne primes, that is, prime numbers that are of the form 2p 1, where p is an arbitrary prime. The LucasLehmer test is particularly fast for numbers of this form. This is why the largest known prime has almost always been a Mersenne prime since the dawn of electronic computers. Question: Of what form are Mersenne primes?
Output:
True