Forum Home > GMAT > Quantitative > Problem Solving (PS)
Events & Promotions
|
|
GMAT Club Daily Prep
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Dec 1310:00 AM EST
-12:00 PM EST
Have you ever wondered how to score a PERFECT 805 on the GMAT? Meet Julia, a banking professional who used the Target Test Prep course to achieve this incredible feat. Julia's story is nothing short of an inspiration.
Dec 1410:00 AM EST
-12:00 PM EST
Think a 100% GMAT Verbal score is out of your reach? Target Test Prep will make you think again! Our course uses techniques such as topical study and spaced repetition to maximize knowledge retention and make studying simple and fun.
Dec 1411:00 AM IST
-01:00 PM IST
Attend this session to learn how to Deconstruct arguments, Pre-Think Author’s Assumptions, and apply Negation Test.- Dec 15
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Dec 1608:00 AM PST
-11:59 PM PST
GMAT Club 12 Days of Christmas is a 4th Annual GMAT Club Winter Competition based on solving questions. This is the Winter GMAT competition on GMAT Club with an amazing opportunity to win over $40,000 worth of prizes!
30 Aug 2017, 00:39
Kudos
Bookmarks
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
---
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
01 Sep 2017, 10:57
Kudos
Bookmarks
annguyenup
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
---
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
Quote:
(a) In how many ways can the students answer a 10-question true false examination?
Let's assume there are 3 questions. The answer can be true or false. you can use slot method:
2 2 2 - so there are 2 outcomes for the first question, 2 outcomes for the second, 2 outcomes for the third:2x2x2=\(2^3\)
8 outcomes overall :
true true true
true true false
true false true
true false false
false false true
false true false
false true true
false false false
Quote:
(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
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\)
06 Sep 2017, 03:48
Kudos
Bookmarks
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.
