MENU
Uses a formula, M_n = 2^n 1 where n is a prime number, to generate primes. Works for 2, 3, 5, 7 but fails on 11 and on many other n values.
Suggested Answer: D
Get Premium 212-81 Questions
as Interactive Web-Based Practice Test or PDF
Real Exam Format
Detailed Explanations
Instant Access
Get Your Practice Test
30 comments · newest first
BR
Brendan
11 months ago
Not convinced this is a reliable method for generating primes.
AM
Ammie
11 months ago
Mersenne primes are a different thing altogether.
MO
Mona
11 months ago
Wait, it fails on 11? That's surprising!
TE
Telma
12 months ago
Totally agree, it breaks down at 11!
ER
Erick
12 months ago
This formula only works for a few primes, like 2, 3, 5, and 7.
RE
Rebecka
1 year ago
This formula worked for the first few primes, but I definitely recall it failing for others. I wonder if there's a pattern or a specific reason for that.
PR
Providencia
1 year ago
I feel like I might have mixed up Mersenne primes with something else. I just remember they have to do with powers of 2, right?
FL
Florinda
1 year ago
I think I saw a similar question about generating primes using different formulas. I’m not sure if this one is reliable for all primes, though.
CR
Crista
1 year ago
I remember studying Mersenne primes, but I thought they were related to a different formula. This one seems off for higher primes like 11.
DA
Darnell
1 year ago
I'm a bit confused by this one. The formula seems to be generating some prime numbers, but not others. I'll need to review my knowledge of prime numbers and see if I can figure out what's going on here. Maybe I'll start by trying some more values of n to see if I can spot a pattern.
RA
Raul
1 year ago
Ah, I think I've got it! This is asking about Mersenne primes, which are primes of the form 2^n - 1. The formula given is correct for generating Mersenne primes, but it doesn't work for all prime numbers. I'll need to focus on the properties of Mersenne primes to answer this.
SE
Selma
1 year ago
Okay, let me break this down step-by-step. The formula is M_n = 2^n - 1, where n is a prime number. It works for 2, 3, 5, and 7, but fails on 11 and other values. I'll need to investigate why that is and see if I can find a pattern.
ST
Stefany
1 year ago
Hmm, this looks like a tricky one. The formula seems to work for some prime numbers, but not others. I'll need to think carefully about the properties of Mersenne primes and how they relate to this formula.
BR
Brittani
1 year ago
Mersenne Primes, eh? I bet the person who came up with that formula was really feeling prime-itive.
CA
Carylon
1 year ago
C) Even Numbers
DE
Delisa
1 year ago
B) Co-prime Numbers
LA
Laquanda
1 year ago
A) Fibonacci Numbers
JO
Jospeh
1 year ago
Wait, the formula works for 2, 3, 5, and 7, but fails on 11? Sounds a bit suspicious, if you ask me.
CE
Cecily
1 year ago
C) Even Numbers
EL
Elden
1 year ago
B) Co-prime Numbers
WI
Wilford
1 year ago
A) Fibonacci Numbers
DI
Dick
2 years ago
Definitely not Fibonacci Numbers or Even Numbers. This has to be something more specific, like Mersenne Primes.
NA
Nancey
1 year ago
Mersenne Primes are a special case that works with this formula.
BE
Belen
1 year ago
It's not Co-prime Numbers or Fibonacci Numbers for sure.
RO
Robt
1 year ago
Yes, Mersenne Primes fit the formula M_n = 2^n - 1 for prime numbers.
TE
Tess
1 year ago
I think it might be Mersenne Primes.
KA
Karl
2 years ago
Hmm, Mersenne Primes? Sounds like the right answer, but I'll have to double-check the formula.
AY
Ayesha
2 years ago
I'm not sure, but I think it could also be B) Co-prime Numbers since the formula involves prime numbers.
LE
Leeann
2 years ago
I agree with Leslie, because Mersenne Primes are generated using the formula mentioned.
LE
Leslie
2 years ago
I think the answer is D) Mersenne Primes.