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 1511: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!- Dec 17
09:00 AM PST
-10:00 AM PST
Join Manhattan Prep instructor Whitney Garner for a fun—and thorough—review of logic-based (non-math) problems, with a particular emphasis on Data Sufficiency and Two-Parts. - Dec 18
10:00 AM PST
-11:00 AM PST
Here is the essential guide to securing scholarships as an MBA student! In this video, we explore the various types of scholarships available, including need-based and merit-based options.
11 Jan 2022, 13:43
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
95%
(hard)
Question Stats:
43% (03:19) correct
57%
(02:44)
wrong
based on 53
sessions
History
Date
Time
Result
Not Attempted Yet
A general in command of 105 troops is issued orders to send all his men, excluding himself, into combat. His directives are as follows: 1) To limit casualties, he cannot send everyone in one wave; 2) For each wave after the first, he must send exactly half as many troops as there were in the previous wave.
How many unique ways are there for the general to deploy his troops within the directives (e.g., the invalid combination 50-25 would count as one)?
A) 0
B) 2
C) 3
D) 4
E) 9
How many unique ways are there for the general to deploy his troops within the directives (e.g., the invalid combination 50-25 would count as one)?
A) 0
B) 2
C) 3
D) 4
E) 9
Show SpoilerSource + Fun Assessment Scale
Self-made question.
(Confession: I just wanted to write a fun question that encouraged critical reasoning, not necessarily one that would appear on the GMAT™.)
(Confession: I just wanted to write a fun question that encouraged critical reasoning, not necessarily one that would appear on the GMAT™.)
| INCORRECT = MISSION FAILURE (total loss of life) | TIME | OUTCOME |
| CORRECT—Pyrrhic victory | 5:00+ | 76 percent loss of life (80 troops) |
| CORRECT—Strategic victory | 3:30-4:59 | 50 percent loss of life (53 troops) |
| CORRECT—Decisive victory | 2:01-3:29 | 25 percent loss of life (26 troops) |
| CORRECT—Total victory | Up to 2:00 | 10 percent loss of life (11 troops) |
| Note: Some loss of life is inevitable in battle. |
13 Jan 2022, 10:10
Kudos
Bookmarks
AndrewN
A general in command of 105 troops is issued orders to send all his men, excluding himself, into combat. His directives are as follows: 1) To limit casualties, he cannot send everyone in one wave; 2) For each wave after the first, he must send exactly half as many troops as there were in the previous wave.
How many unique ways are there for the general to deploy his troops within the directives (e.g., the invalid combination 50-25 would count as one)?
A) 0
B) 2
C) 3
D) 4
E) 9
Hello, everyone. This has to be my least popular self-made question, but I guess you cannot win them all. Perhaps the timing of my post was off, or I could have done a better job with the presentation, making the question more GMAT™-like. Whatever the case, I think the Number Properties concepts—e.g., divisibility—are quite applicable.How many unique ways are there for the general to deploy his troops within the directives (e.g., the invalid combination 50-25 would count as one)?
A) 0
B) 2
C) 3
D) 4
E) 9
Show SpoilerSource + Fun Assessment Scale
Self-made question.
(Confession: I just wanted to write a fun question that encouraged critical reasoning, not necessarily one that would appear on the GMAT™.)
(Confession: I just wanted to write a fun question that encouraged critical reasoning, not necessarily one that would appear on the GMAT™.)
| INCORRECT = MISSION FAILURE (total loss of life) | TIME | OUTCOME |
| CORRECT—Pyrrhic victory | 5:00+ | 76 percent loss of life (80 troops) |
| CORRECT—Strategic victory | 3:30-4:59 | 50 percent loss of life (53 troops) |
| CORRECT—Decisive victory | 2:01-3:29 | 25 percent loss of life (26 troops) |
| CORRECT—Total victory | Up to 2:00 | 10 percent loss of life (11 troops) |
| Note: Some loss of life is inevitable in battle. |
You can start by factoring 105. Its prime factorization is 3 * 5 * 7, so these values might provide a good starting point for exploration. We also know that each wave after the first will be half the size of the previous wave, so we might want to think of the first wave not as, say, x, but as 2x, or 4x, to avoid dealing with unnecessary fractions. Consider 3:
\(2x + x = 105\)
\(3x = 105\)
\(x = 35\)
This works. If the first wave had 70 troops and the second had 35, then all 105 troops would have been sent into combat, per the orders. We can keep doubling the coefficient at the start of the equation to check for other successful combinations.
\(4x + 2x + x = 105\)
\(7x = 105\)
\(x = 15\)
This also works. If the first wave consisted of 60 troops, the second 30, and the last one 15, then the general has followed orders. Keep going.
\(8x + 4x + 2x + x = 105\)
\(15x = 105\)
\(x = 7\)
Another valid combination. 56 troops were sent into combat, followed by 28, then 14, then 7. What happens if we double the coefficient once more?
\(16x + 8x + 4x + 2x + x = 105\)
\(31x = 105\)
No integer value will work, so we know this five-step combination is invalid. There is only one more coefficient to test within reason.
\(32x + 16x + 8x + 4x + 2x + x = 105\)
\(63x = 105\)
Not only will this equation also not yield an integer value, but we can see that there is no need to start with 64x in a 7-tiered system: 64 + 32 + 16 is already greater than 105.
Thus, the only ways in which the general can send his troops into battle within the given constraints are the following:
- 70-35
- 60-30-15
- 56-28-14-7
Since we have three valid combinations, the answer must be (C). I had a lot of fun with this one. As always, good luck with your studies.
- Andrew
21 Apr 2022, 00:09
Kudos
Bookmarks
I am struggling witht these sort of questions, any idea what is the name of the topic which includes these types of questions?
