Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized for You
we will pick new questions that match your level based on your Timer History
Track Your Progress
every week, we’ll send you an estimated GMAT score based on your performance
Practice Pays
we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
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:
Learn how Keshav, a Chartered Accountant, scored an impressive 705 on GMAT in just 30 days with GMATWhiz's expert guidance. In this video, he shares preparation tips and strategies that worked for him, including the mock, time management, and more.
At one point, she believed GMAT wasn’t for her. After scoring 595, self-doubt crept in and she questioned her potential. But instead of quitting, she made the right strategic changes. The result? A remarkable comeback to 695. Check out how Saakshi did it.
The Target Test Prep course represents a quantum leap forward in GMAT preparation, a radical reinterpretation of the way that students should study. Try before you buy with a 5-day, full-access trial of the course for FREE!
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors
Can someone explain the following solution for this question? If a student doesn't answer the question, then there should be 2^1 ways, but why is it regarded as 2*2^1 ways?
--- In how many ways can the students answer a 10-question true false examination?
(a) In how many ways can the students answer a 10-question true false examination? (b). In how many ways can the student answer the test in part (a) if it is possible to leave a question unanswered in order to avoid an extra penalty for a wrong answer
--- The explanation is: "let's reduce the problem to just two questions.
There are 2^2 ways in which both questions may be answered true/false.
If a student does not answer question 1, there are still 2*2^1 ways in which they can answer question 2, and vice versa. Thus there are 2*2^1 ways in which only one question is answered.
Finally, there is just one way in which neither question is answered.
Putting this together, there are 2^2+2*2^1+1=(2+1)^2=3^2=32 ways of answering the questions.
Extending this to ten questions, there are 2^10 ways to answer all ten questions, 10*2^9 for answering all but one question, 45×2^8 ways of answering all but two questions, etc, giving a total of (2+1)^10=3^10
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Can someone explain the following solution for this question? If a student doesn't answer the question, then there should be 2^1 ways, but why is it regarded as 2*2^1 ways?
--- In how many ways can the students answer a 10-question true false examination?
(a) In how many ways can the students answer a 10-question true false examination? (b). In how many ways can the student answer the test in part (a) if it is possible to leave a question unanswered in order to avoid an extra penalty for a wrong answer
--- The explanation is: "let's reduce the problem to just two questions.
There are 2^2 ways in which both questions may be answered true/false.
If a student does not answer question 1, there are still 2*2^1 ways in which they can answer question 2, and vice versa. Thus there are 2*2^1 ways in which only one question is answered.
Finally, there is just one way in which neither question is answered.
Putting this together, there are 2^2+2*2^1+1=(2+1)^2=3^2=32 ways of answering the questions.
Extending this to ten questions, there are 2^10 ways to answer all ten questions, 10*2^9 for answering all but one question, 45×2^8 ways of answering all but two questions, etc, giving a total of (2+1)^10=3^10
Show more
Quote:
(a) In how many ways can the students answer a 10-question true false examination?
Show more
Let's assume there are 3 questions. The answer can be true or false. you can use slot method:
222 - so there are 2 outcomes for the first question, 2 outcomes for the second, 2 outcomes for the third:2x2x2=\(2^3\)
(b). In how many ways can the student answer the test in part (a) if it is possible to leave a question unanswered in order to avoid an extra penalty for a wrong answer
Show more
same idea here, but there are three outcomes possible. If there are 3 questions, then 3 x 3 x 3 =3^3 If there are ten questions, then \(3^10\)
I don't quite understand your question - do you still need some explanation (solution) of the problem to the already existing one? If you're in doubt about solution, you can get more help on the website, where experts are working in different areas and in particular in the field of combinatorics.
Can someone explain the following solution for this question? If a student doesn't answer the question, then there should be 2^1 ways, but why is it regarded as 2*2^1 ways?
--- In how many ways can the students answer a 10-question true false examination?
(a) In how many ways can the students answer a 10-question true false examination? (b). In how many ways can the student answer the test in part (a) if it is possible to leave a question unanswered in order to avoid an extra penalty for a wrong answer
--- The explanation is: "let's reduce the problem to just two questions.
There are 2^2 ways in which both questions may be answered true/false.
If a student does not answer question 1, there are still 2*2^1 ways in which they can answer question 2, and vice versa. Thus there are 2*2^1 ways in which only one question is answered.
Finally, there is just one way in which neither question is answered.
Putting this together, there are 2^2+2*2^1+1=(2+1)^2=3^2=32 ways of answering the questions.
Extending this to ten questions, there are 2^10 ways to answer all ten questions, 10*2^9 for answering all but one question, 45×2^8 ways of answering all but two questions, etc, giving a total of (2+1)^10=3^10
Show more
The language in the explanation is slightly ambiguous. By saying "2*2^1 ways in which only one question is answered," they aren't referring to the number of ways to answer any particular single question. (You're correct, by the way - there are two ways to answer a single question, assuming you don't count 'no answer' as a type of answer.)
What they appear to mean is actually that there are four different scenarios (2*2^1) for a two-problem test, in which exactly one of the two problems is answered and the other isn't. Here are those four scenarios:
question 1, question 2 no answer, true no answer, false true, no answer false, no answer
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.