Eccouncil Exam 212-81 Topic 12 Question 49 Discussion

Actual exam question for Eccouncil's 212-81 exam

Question #: 49
Topic #: 12

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.

AFibonacci Numbers

BCo-prime Numbers

CEven Numbers

DMersenne Primes

Show Suggested Answer

Suggested Answer: D

by Portia at Dec 06, 2024, 08:47 AM

Limited Time Offer

25%

Off

Get Premium 212-81 Questions as Interactive Web-Based Practice Test or PDF

Contribute your Thoughts:

Submit Cancel

Brittani

1 months ago

Mersenne Primes, eh? I bet the person who came up with that formula was really feeling prime-itive.

upvoted 0 times

Laquanda

8 days ago

A) Fibonacci Numbers

upvoted 0 times

...

Jospeh

1 months ago

Wait, the formula works for 2, 3, 5, and 7, but fails on 11? Sounds a bit suspicious, if you ask me.

upvoted 0 times

Cecily

2 days ago

C) Even Numbers

upvoted 0 times

...

Elden

8 days ago

B) Co-prime Numbers

upvoted 0 times

...

Wilford

20 days ago

A) Fibonacci Numbers

upvoted 0 times

...

Dick

1 months ago

Definitely not Fibonacci Numbers or Even Numbers. This has to be something more specific, like Mersenne Primes.

upvoted 0 times

Robt

19 days ago

Yes, Mersenne Primes fit the formula M_n = 2^n - 1 for prime numbers.

upvoted 0 times

...

Tess

22 days ago

I think it might be Mersenne Primes.

upvoted 0 times

...

Karl

1 months ago

Hmm, Mersenne Primes? Sounds like the right answer, but I'll have to double-check the formula.

upvoted 0 times

...

Ayesha

2 months ago

I'm not sure, but I think it could also be B) Co-prime Numbers since the formula involves prime numbers.

upvoted 0 times

...

Leeann

2 months ago

I agree with Leslie, because Mersenne Primes are generated using the formula mentioned.

upvoted 0 times

...

Leslie

2 months ago

I think the answer is D) Mersenne Primes.

upvoted 0 times

...