The GMAT DS question given below is a data sufficiency question from Number Theory. Concept tested: Test of divisibility. Level of difficulty: Easy | A GMAT 600 to 650 level question.
This data sufficiency problem consists of a question and two statements, labeled (1) and (2), in which certain data are given. You have to decide whether the data given in the statements are sufficient for answering the question. Using the data given in the statements, plus your knowledge of mathematics and everyday facts (such as the number of days in a leap year or the meaning of the word counterclockwise), you must indicate whether -
All numbers used are real numbers.
A figure accompanying a data sufficiency question will conform to the information given in the question but will not necessarily conform to the additional information given in statements (1) and (2)
Lines shown as straight can be assumed to be straight and lines that appear jagged can also be assumed to be straight
You may assume that the positions of points, angles, regions, etc. exist in the order shown and that angle measures are greater than zero.
All figures lie in a plane unless otherwise indicated.
In data sufficiency problems that ask for the value of a quantity, the data given in the statement are sufficient only when it is possible to determine exactly one numerical value for the quantity.
Question 27: Is the positive integer 'x' divisible by 12?
What kind of an answer will the question fetch?
The question is an "Is" question. Answer to an "is" questions is either YES or NO.
When is the data sufficient?
The data is sufficient if we are able to get a DEFINITE YES or a DEFINITE NO from the information given in the statements.
What is the test of divisibility for 12?
The test of divisibility for 12 is that the number should be divisible by both 3 and 4. Essentially, x should be divisible by 3 and 22.
Approach: Look for a counter example
Example: x = 6. It is divisible by 6. However, it is NOT divisible by 12.
Counter Example: x = 12. It is divisible by 6. It is divisible by 12 as well.
Knowing that x is divisible by 6 is not enough to answer the question.
If x is divisible by 6, we can infer that it is divisible by 3 and 2. But we cannot deduce whether it is also divisible by 22 - which is essential to deduce that x is divisible by 12.
Statement 1 ALONE is NOT sufficient.
Eliminate choices A and D. Choices narrow down to B, C or E.
If x is divisible by 8, then x will definitely be divisible by 4.
However, from statement (2) alone we do not know if x is divisible by 3.
Alternative Approach: Look for a counter example
Example: x = 8. It is divisible by 8. However, it is NOT divisible by 12.
Counter Example:x = 24. It is divisible by 8. It is divisible by 12 as well.
Knowing that x is divisible by 8 is not enough to answer the question.
Statement 2 ALONE is NOT sufficient.
Eliminate choice B. Choices narrow down to C or E.
From statement 1, if x is divisible by 6, it is definitely divisible by 3.
From statement 2, if x is divisible by 8, it is definitely divisible by 4.
So, by combining the two statements, we can conclude that x is divisible by 3 and by 4.
Or that x is divisible by 12.
1. Number Systems | Types of Numbers | Chart
2. Number Properties | Rational & Irrational Numbers
3. GMAT Number Properties | Indices & Rule of Exponents
4. Number Systems | Surds & Conjugates
5. Number Properties | Tests of divisibility
6. Number Properties | How to check whether a number is prime?
7. Number Properties | How to prime factorize a number?
8. GMAT Number Theory | Prime factorization | Properties of squares & cubes
9. Number Properties | What is HCF? | How to find HCF?
10. Number Properties | What is LCM? | How to find LCM?
11. 3 important properties of LCM & HCF | LCM & HCF of fractions
12. Number Properties | When to use LCM and HCF?
13. Number Theory | How to find number of factors?
14. Number Theory | Number of ways to express as a product of 2 factors
15. Number Theory | Sum of all factors of a number
16. Number Theory | Product of all factors of a number
17. Number Theory | Remainders of sum & product
18. Number Theory | Remainder of dividing xn by 'd'
19. Polynomials | Remainder when a monomial divides it
20. Number Theory | Highest power of a prime that divides factorial of 'n'
21. Number Theory | Highest power of a composite number that divides factorial of 'n'
22. Number Theory | Number of trailing zeroes in a number
23. Number Theory | Unit digit of higher powers of numbers
GMAT® is a registered trademark of the Graduate Management Admission Council (GMAC). This website is not endorsed or approved by GMAC.
GRE® is a registered trademarks of Educational Testing Service (ETS). This website is not endorsed or approved by ETS.
SAT® is a registered trademark of the College Board, which was not involved in the production of, and does not endorse this product.
Wizako - GMAT, GRE, SAT Prep
An Ascent Education Initiative
48/1 Ramagiri Nagar
Velachery Taramani Link Road.,
Velachery, Chennai 600 042. India