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 1410:00 AM EST
-12:00 PM EST
Think a 100% GMAT Verbal score is out of your reach? Target Test Prep will make you think again! Our course uses techniques such as topical study and spaced repetition to maximize knowledge retention and make studying simple and fun.- Dec 14
11:00 AM IST
-01:00 PM IST
Attend this session to learn how to Deconstruct arguments, Pre-Think Author’s Assumptions, and apply Negation Test. 
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.
30 Oct 2019, 22:01
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
15%
(low)
Question Stats:
82% (00:51) correct
18%
(00:55)
wrong
based on 45
sessions
History
Date
Time
Result
Not Attempted Yet
Is the integer N divisible by 36?
(1) N is divisible by 9.
(2) N is divisible by 8.
(1) N is divisible by 9.
(2) N is divisible by 8.
30 Oct 2019, 22:15
Kudos
Bookmarks
Statement 1 - N is divisible by 9.
N= 9 , we get a no.
N=36, we get a yes.
Not sufficient.
Statement 2- N is divisible by 8.
N=8, we get a no.
N=72, we get a yes.
Not sufficient.
Combining N=9X, N=8K
N is a common multiple of 8 and 9.
Least such common multiple is 72..
Therefore N is of the form 72p, for any positive integer p.
72 is always divisible by 36, therefore 72P will also be divisible by 36..
Combining worked.
C.
Posted from my mobile device
N= 9 , we get a no.
N=36, we get a yes.
Not sufficient.
Statement 2- N is divisible by 8.
N=8, we get a no.
N=72, we get a yes.
Not sufficient.
Combining N=9X, N=8K
N is a common multiple of 8 and 9.
Least such common multiple is 72..
Therefore N is of the form 72p, for any positive integer p.
72 is always divisible by 36, therefore 72P will also be divisible by 36..
Combining worked.
C.
Posted from my mobile device
30 Oct 2019, 22:25
Kudos
Bookmarks
C.
Statement 1: N can be 0 (divisible by 36) and 9 (NOT divisible by 36). Not Sufficient.
Statement 2: N can be 0 (divisible by 36) and 8 (NOT divisible by 36).Not Sufficient.
Combining: n is divisible by 72. Since all multiples of 72 are divisible by 36, c is Sufficient. Yes.
Don’t forget make a good friendship with ZERO. Otherwise, ZERO will be your biggest enemy.
Statement 1: N can be 0 (divisible by 36) and 9 (NOT divisible by 36). Not Sufficient.
Statement 2: N can be 0 (divisible by 36) and 8 (NOT divisible by 36).Not Sufficient.
Combining: n is divisible by 72. Since all multiples of 72 are divisible by 36, c is Sufficient. Yes.
Don’t forget make a good friendship with ZERO. Otherwise, ZERO will be your biggest enemy.
