GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 25 May 2019, 12:14 ### 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

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. ### Request Expert Reply # Combinatorics question

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
TAGS:

### Hide Tags

Intern  Joined: 14 May 2015
Posts: 1
Combinatorics question  [#permalink]

### Show Tags

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
VP  V
Joined: 30 Jan 2016
Posts: 1066
Re: Combinatorics question  [#permalink]

### Show Tags

annguyenup wrote:
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

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$$
_________________
Non progredi est regredi
Intern  Joined: 31 Aug 2017
Posts: 6
Re: Combinatorics question  [#permalink]

### Show Tags

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.
Manhattan Prep Instructor G
Joined: 04 Dec 2015
Posts: 729
GMAT 1: 790 Q51 V49 GRE 1: Q170 V170 Combinatorics question  [#permalink]

### Show Tags

annguyenup wrote:
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

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
_________________ Chelsey Cooley | Manhattan Prep | Seattle and Online

My latest GMAT blog posts | Suggestions for blog articles are always welcome! Combinatorics question   [#permalink] 07 Sep 2017, 12:47
Display posts from previous: Sort by

# Combinatorics question

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.

#### MBA Resources  