and many more benefits!

Find us on Facebook

GMAT Club Timer Informer

Hi GMATClubber!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Hide Tags

A contest will consist of n questions, each of which is to [#permalink]

Show Tags

21 Nov 2007, 15:13

1

This post receivedKUDOS

14

This post wasBOOKMARKED

00:00

A

B

C

D

E

Difficulty:

25% (medium)

Question Stats:

72%(01:55) correct
28%(01:25) wrong based on 391 sessions

HideShow timer Statistics

A contest will consist of n questions, each of which is to be answered either "True" or "False." Anyone who answers all n questions correctly will be a winner. What is the least value of n for which the probability is less than 1/1000 that a person who randomly guesses the answer to each question will be winner?

Show Tags

23 Sep 2008, 10:36

tarek99 wrote:

A contest will consist of n questions, each of which is to be answered either "True" or "False." Anyone who answers all n questions correctly will be a winner. What is the least value of n for which the probability is less than 1/1000 that a person who randomly guesses the answer to each question will be winner?

Show Tags

23 Sep 2008, 11:59

interesting tarek, this is GMAT Prep 2 question.I got this question as 37th question me too got it wrong but then Probability has never been my strong point but still it is interesting cause got this '15 sec'. question on 37th number though I scored 760 in Prep2.

Re: A contest will consist of n questions, each of which is to [#permalink]

Show Tags

11 Sep 2013, 09:42

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

Show Tags

A contest will consist of n questions, each of which is to be answered either "True" or "False." Anyone who answers all n questions correctly will be a winner. What is the least value of n for which the probability is less than 1/1000 that a person who randomly guesses the answer to each question will be winner?

A. 5B. 10C. 50D. 100E. 1000

The probability to randomly guess the answer for 1 question is 1/2, for 2 questions 1/2*1/2=1/2^2, similarly for n questions the probability is 1/2^n.

We need to find the least value of \(n\) for which \(\frac{1}{2^n}<\frac{1}{1,000}\) --> \(2^n>1,000\) --> \(n_{min}=10\).

Show Tags

A contest will consist of n questions, each of which is to be answered either "True" or "False." Anyone who answers all n questions correctly will be a winner. What is the least value of n for which the probability is less than 1/1000 that a person who randomly guesses the answer to each question will be winner?a) 5b) 10c) 50d) 100e) 1000

Answer Choice B

In all there are n questions, and each question can be answered 2 ways (i.e. True or False). So we will get \(2^n\) different sequences of answers. Of which one sequence is TTTTTTTT......n times (i.e. All correct Answers)

We are told that The person who get all the answers correct that means who get the sequence mentioned above (TTTTT.... n times) will be a winner.

A person can choose any sequence from \(2^n\) sequences. He has to choose TTTT.... n times in order to win the game.

So Probability that a person will win the game is \(\frac{1}{2^n}\)

What is the least value of n for which the probability is less than 1/1000 -------> \(\frac{1}{2^n} < \frac{1}{1000}\) -----------------------> Here we can cross multiply the inequality since we know that \(2^n\) will always be positive (We know that n can neither be zero nor be Negative)

So We have that \(2^n > 1000\) --------> Using n=10 we get \(1024 > 1000\) Sufficient.
_________________