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.
Apr 2512:30 AM EDT
-01:30 AM EDT
At one point, she believed GMAT wasn’t for her. After scoring 595, self-doubt crept in and she questioned her potential. But instead of quitting, she made the right strategic changes. The result? A remarkable comeback to 695. Check out how Saakshi did it.
Apr 2610:00 AM EDT
-11:00 AM EDT
The Target Test Prep course represents a quantum leap forward in GMAT preparation, a radical reinterpretation of the way that students should study. Try before you buy with a 5-day, full-access trial of the course for FREE!
Apr 2711:00 AM EDT
-12:00 PM EDT
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
23 Jul 2012, 04:39
Kudos
Bookmarks
B
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
5%
(low)
Question Stats:
91% (00:47) correct
9%
(00:58)
wrong
based on 2799
sessions
History
Date
Time
Result
Not Attempted Yet
The sum of prime numbers that are greater than 60 but less than 70 is
(A) 67
(B) 128
(C) 191
(D) 197
(E) 260
(A) 67
(B) 128
(C) 191
(D) 197
(E) 260
Every tricky question should trigger a follow up quiz.
Build that habit with
GMAT Club Forum Quiz →.
27 Jul 2012, 07:06
Kudos
Bookmarks
SOLUTION
The sum of prime numbers that are greater than 60 but less than 70 is
(A) 67
(B) 128
(C) 191
(D) 197
(E) 260
The only prime numbers between 60 and 70 are 61 and 67 --> 61+67=128.
Answer: B.
Take the last digit, double it, and subtract it from the rest of the number, if the answer is divisible by 7 (including 0), then the number is divisible by 7.
For example, let's check whether 1,519 is divisible by 7: 151-2*9=133. Since 133 is divisible by 7 (133=7*19), then so is 1,519.
For more check Number Theory chapter of Math Book: math-number-theory-88376.html
Hope it helps.
The sum of prime numbers that are greater than 60 but less than 70 is
(A) 67
(B) 128
(C) 191
(D) 197
(E) 260
The only prime numbers between 60 and 70 are 61 and 67 --> 61+67=128.
Answer: B.
Club909
Take the last digit, double it, and subtract it from the rest of the number, if the answer is divisible by 7 (including 0), then the number is divisible by 7.
For example, let's check whether 1,519 is divisible by 7: 151-2*9=133. Since 133 is divisible by 7 (133=7*19), then so is 1,519.
For more check Number Theory chapter of Math Book: math-number-theory-88376.html
Hope it helps.
23 Jul 2012, 10:55
Kudos
Bookmarks
B.) 128
I did this two ways.
The first way used a combination of pure processing power and logic. You know the even numbers - 62, 64, 66, and 68 will never be prime. 65 will always be divisible by 5. That leaves 61, 63, 67, and 69. 63 and 69 are divisible by 9 and 3 respectively (just plug and chug). That leaves you with 2 primes - 61 and 67 - the sum of which is 128.
The second way - applying divisibility rules - seems more elegant and more efficient in the long run:
For 2: All even numbers. This eliminates 62, 64, 66, and 68.
For 3: Add up all the digits of the number. If the sum is divisible by 3, the number is divisible by 3. This eliminates both 63 and 69.
For 4: If the last 2 digits of the number are divisible by 4, the entire number is divisible by 4. This does not apply to any of our remaining numbers - 61, 65, and 67.
For 5: All numbers ending in 5 or 0. This eliminates 65, leaving only 61 and 67 in the running for primes.
For 6: If the number is divisible by BOTH 2 & 3 (see first two rules), then the number is also divisible by 6. This does not apply to 61 and 67 since neither is divisible by 2 or 3.
For 7: No concise rule that I know of. I recommend long-division or mental math. Does anyone know a quick way to check for divisibility by7? Regardless, you can run through the multiples of 7 and realize none fall on 61 or 67 so this divisor doesn't check out.
For 8: If the last 3 digits are divisible by 8, then the whole number is divisible by 8. I didn't stick to this rule when using the divisibility rules approach. You know 2 is a prime factor of 8 meaning any number that has 8 as a multiple must be even. Since neither 61 nor 67 is even, 8 cannot be a divisor.
For 9: Add up all the digits and see if the resulting sum is divisible by 9. This does not work when applied to 61 or 67 and is redundant for 63 (we knocked 63 out in the "For 3" rule).
Therefore the only 2 primes in the set are 61 and 67.
Does anyone know a good way to check for divisibility by 7? Thanks.
I did this two ways.
The first way used a combination of pure processing power and logic. You know the even numbers - 62, 64, 66, and 68 will never be prime. 65 will always be divisible by 5. That leaves 61, 63, 67, and 69. 63 and 69 are divisible by 9 and 3 respectively (just plug and chug). That leaves you with 2 primes - 61 and 67 - the sum of which is 128.
The second way - applying divisibility rules - seems more elegant and more efficient in the long run:
For 2: All even numbers. This eliminates 62, 64, 66, and 68.
For 3: Add up all the digits of the number. If the sum is divisible by 3, the number is divisible by 3. This eliminates both 63 and 69.
For 4: If the last 2 digits of the number are divisible by 4, the entire number is divisible by 4. This does not apply to any of our remaining numbers - 61, 65, and 67.
For 5: All numbers ending in 5 or 0. This eliminates 65, leaving only 61 and 67 in the running for primes.
For 6: If the number is divisible by BOTH 2 & 3 (see first two rules), then the number is also divisible by 6. This does not apply to 61 and 67 since neither is divisible by 2 or 3.
For 7: No concise rule that I know of. I recommend long-division or mental math. Does anyone know a quick way to check for divisibility by7? Regardless, you can run through the multiples of 7 and realize none fall on 61 or 67 so this divisor doesn't check out.
For 8: If the last 3 digits are divisible by 8, then the whole number is divisible by 8. I didn't stick to this rule when using the divisibility rules approach. You know 2 is a prime factor of 8 meaning any number that has 8 as a multiple must be even. Since neither 61 nor 67 is even, 8 cannot be a divisor.
For 9: Add up all the digits and see if the resulting sum is divisible by 9. This does not work when applied to 61 or 67 and is redundant for 63 (we knocked 63 out in the "For 3" rule).
Therefore the only 2 primes in the set are 61 and 67.
Does anyone know a good way to check for divisibility by 7? Thanks.
