BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Combinatorics Question

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Source: — Problem Solving |
User avatar
GMAT Instructor
Posts: 15539
Joined: Tue May 25, 2010 12:04 pm
Location: New York, NY
Thanked: 13060 times
Followed by:1906 members
GMAT Score:790

by GMATGuruNY » Sat Feb 27, 2016 3:16 am
Matt is touring a nation in which coins are issued in two amounts, 2¢ and 5¢, which are made of iron and copper, respectively. If Matt has ten iron coins and ten copper coins, how many different sums from 1¢ to 70¢ can he make with a combination of his coins?

A. 66
B. 67
C. 68
D. 69
E. 70

Could anyone please take a look at this and explain what the q means by "how many different sums from 1¢ to 70¢ can he make with a combination of his coins?"..
The prompt is asking how many different SUMS OF MONEY between 1¢ and 70¢, inclusive, can be formed using up to ten 2¢ coins and ten 5¢ coins.
For example, it is possible to form a sum of 16¢ by combining three 2¢ coins and two 5¢ coins:
(3*2) + (2*5) = 16¢.

From 1 to 70, there are 70 possible sums.
The smallest answer choice is 66.
Implication:
At most, 4 of the 70 possible sums cannot be made from the given coins.
Impossible sums are likely to be VERY SMALL or VERY LARGE.

Small sums:
Of the sums between 1 and 10, the following cannot be formed from 2¢ and 5¢ coins:
1 and 3.

Large sums:
If all 20 coins are used, the sum = (10*2) + (10*5) = 70.
The next smallest possible sums are 70-2 = 68 and 70-2-2 = 66.
Thus, 67 and 69 are not achievable.

Since 4 of 70 possible sums -- 1, 3, 67, and 69 -- are not achievable, the total number of sums that can be formed = 70-4 = 66.

The correct answer is A.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Top
Newbie | Next Rank: 10 Posts
Posts: 4
Joined: Fri Feb 26, 2016 1:05 pm

by renanmenezes » Sat Feb 27, 2016 7:04 am
----------
Top
GMAT Instructor
Posts: 2630
Joined: Wed Sep 12, 2012 3:32 pm
Location: East Bay all the way
Thanked: 625 times
Followed by:119 members
GMAT Score:780

by Matt@VeritasPrep » Tue Mar 01, 2016 11:20 pm
Hey, that Matt is me, I submitted this question to the VP database!

The question is asking how many sums from 1 to 70 can be made using only 2s and 5s. In other words, if x and y are both nonnegative integers, how many of these equations are possible:

2x + 5y = 1
2x + 5y = 2
2x + 5y = 3
...
2x + 5y = 70

For instance, 2x + 5y = 1 is impossible, but 2x + 5y = 2 works if x = 1 and y = 0.

As Mitch showed above, 1 and 69 are both impossible. 1 and (70 - 1) ... hmm! This suggest some symmetry, so we look for another impossible sum. 3 is an easy one to find, so we can check (70 - 3), which is impossible too. (Matt would use all his coins to make 70¢, but there's no way to subtract 3¢ here, as he can only subtract a 5¢ or two 2¢'s.)

Since we have four impossible solutions, we can make at most (70 - 4), or 66 possible sums. "Coincidentally" (hah!) this is the smallest answer, so it must be right, and we're done!
Top
Post new topic Post Reply
• Page 1 of 1