![]() |
| PP1: A contest consists of n questions, each answered |
| Re: PP1: A contest consists of n questions, each answered |
|
Ron Purewal
MGMAT STAFF
|
rephrase: what is the least value of n for which there is less than a 1/1000 chance of guessing n questions in a row correctly?' here's the deal: * there is a 1/2 chance of guessing each question correctly * each question is independent of the other questions, so the chance of guessing n questions correctly is (1/2)(1/2)(1/2)...(1/2), where there are n (1/2)'s * this is (1/2)^n, or 1/(2^n) so: 1/2^n < 1/1000 take reciprocals: 2^n > 1000 n > 10 (because 2^10 = 1024) i've seen big powers of two in gmatprep problems before, but 2^10 is definitely the biggest i've yet seen. |
||||||||||||||
|
|
|||||||||||||||
| PP1: A contest consists of n questions, each answered |
|
||
|
Powered by phpBB © phpBB Group
Content © Manhattan GMAT Forums
*GMAT and GMAT CAT are registered trademarks of the Graduate Management Admission Council,
which neither sponsors nor endorses this test preparation service.
Content © Manhattan GMAT Forums
*GMAT and GMAT CAT are registered trademarks of the Graduate Management Admission Council,
which neither sponsors nor endorses this test preparation service.

