sgr21 wrote:How many integers between 1 and 500, inclusive, are multiples of 3, 7 or both?
This is an OVERLAPPING GROUPS problem.
Total options = Multiples of 3 + Multiples of 7 - Multiples of 21.
The big idea is to SUBTRACT THE OVERLAP.
When we count the multiples of 3 and the multiples of 7, the OVERLAP between the two groups -- the multiples of 21 -- is counted twice.
Hence, the overlap -- the multiples of 21 -- must be subtracted from the total, as shown in the equation above.
Multiples of 3 between 1 and 500, inclusive:
Since 3 is not a factor of either endpoint (1 or 500), we can simply divide 3 into the total number of integers:
500/3 ≈ 166.
Multiples of 7 between 1 and 500, inclusive:
Since 7 is not a factor of either endpoint (1 or 500), we can simply divide 7 into the total number of integers:
500/7 ≈ 71.
Multiples of 21 between 1 and 500, inclusive:
Since 21 is not a factor of either endpoint (1 or 500), we can simply divide 21 into the total number of integers:
500/21 ≈ 23.
Thus:
Total options = 166 + 71 - 23 = 214.
Alternate approach:
Any integer that is a multiple of both 3 and 7 is a multiple of 21.
Count the number of integers between 1 and 21, inclusive, that are divisible by 3, 7, or both:
3, 6, 7, 9, 12, 14, 15, 18, 21
9 options.
Implication:
Between 1 and 500, inclusive, 9 of every 21 integers will be a multiple of 3, 7, or both:
9/21 * 500 = 3/7 * 500 ≈ 3 * 71.4 ≈ 214.2.
Thus, between 1 and 500, inclusive, the number of integers divisible by 3, 7 or both = 214.
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