GMAT Quantitative Arithmetic and Number Properties

Success on the GMAT Quantitative section is less about complex higher math and more about agile, logical reasoning with fundamental concepts. Mastery of arithmetic and number properties—the inherent characteristics of integers—provides a powerful toolkit for solving a significant portion of GMAT problems efficiently. This fluency allows you to deconstruct questions, recognize patterns, and often determine data sufficiency without performing lengthy calculations, directly translating to saved time and higher accuracy.

Foundational Integer Properties and Classification

The GMAT operates within the universe of integers: ..., -2, -1, 0, 1, 2, 3, ... . A firm grasp of how these numbers are categorized is the first step. Positive integers are greater than zero, while negative integers are less than zero. Zero itself is an even integer, but it is neither positive nor negative. Understanding even and odd rules is crucial: even ± even = even, odd ± odd = even, and even ± odd = odd. Similar rules apply to multiplication (even * anything = even).

Consecutive integers follow one after another (e.g., n, n+1, n+2). A set of consecutive integers always contains a multiple of any given number within the length of the set. For example, any three consecutive integers will contain a multiple of 3. This property is frequently tested in problems about sums, products, or divisibility of sequences.

Prime Factorization and Divisibility Rules

A prime number is a positive integer with exactly two distinct positive divisors: 1 and itself. The number 1 is not prime. Every integer greater than 1 can be written uniquely as a product of prime numbers; this is its prime factorization. For example, $60=2^2\ast 3\ast 5$. Finding the prime factorization is the cornerstone for solving problems about divisibility, greatest common factors, and least common multiples.

Divisibility rules offer shortcuts to determine if one integer is divisible by another without performing division. You should know these core rules for the GMAT:

• By 2: Last digit is even.
• By 3: Sum of digits is divisible by 3.
• By 4: Last two digits form a number divisible by 4.
• By 5: Last digit is 0 or 5.
• By 6: Divisible by both 2 and 3.
• By 9: Sum of digits is divisible by 9.

For data sufficiency questions, these rules often allow you to test sufficiency by analyzing the digits or prime factors of a number presented in the statements.

Greatest Common Factor and Least Common Multiple

The Greatest Common Factor (GCF) of two or more integers is the largest integer that divides each of them without a remainder. To find it, take the product of the lowest powers of common prime factors from their factorizations. For 60 ($2^2\ast 3\ast 5$) and 84 ($2^2\ast 3\ast 7$), the common primes are $2^2$ and $3$. Thus, the GCF is $2^2\ast 3=12$.

The Least Common Multiple (LCM) is the smallest positive integer that is a multiple of all numbers. To find it, take the product of the highest powers of all prime factors present. For 60 and 84, the LCM is $2^2\ast 3\ast 5\ast 7=420$.

A critical GMAT relationship is that for two numbers, the product of the GCF and LCM equals the product of the numbers themselves: (GCF of A & B) * (LCM of A & B) = A * B. This can save tremendous time on problems that give you one value and ask for the other.

Applied Number Properties and Data Sufficiency Strategy

This is where conceptual knowledge becomes a strategic advantage. Many challenging GMAT problems test your ability to leverage number properties abstractly. For instance, if a question asks whether a number is divisible by 12, you can break 12 into its prime factors ($2^2\ast 3$). The number must therefore be divisible by both 4 and 3. A data sufficiency statement might provide information that lets you check for these divisibility conditions individually.

Consider this test-like thinking: If you know a positive integer $n$ is the product of three consecutive integers, you can immediately deduce it is divisible by 6. Why? Because among any three consecutive integers, you are guaranteed at least one even number (divisible by 2) and one multiple of 3, making the product divisible by $2\ast 3=6$. This kind of reasoning allows you to answer questions about divisibility without knowing the exact integers.

Common Pitfalls

1. Misapplying Divisibility Rules: A common error is to confuse the rule for 3 with the rule for 9. Remember, for divisibility by 3, the sum of the digits must be divisible by 3; for 9, it must be divisible by 9. The number 129 is divisible by 3 (1+2+9=12) but not by 9.
2. Forgetting that 1 is Not Prime: This is a fundamental definition error that can cascade in prime factorization problems. The prime factorization of a number never includes 1.
3. Overlooking Negative Integer Possibilities: When a question states "integer" or "number," always consider that it could be negative unless explicitly restricted (e.g., "positive integer"). A property like "the square of an integer is non-negative" is vital.
4. Performing Unnecessary Calculations in Data Sufficiency: The biggest time-waster is solving for a precise value when the question only asks if you could solve. Often, analyzing number properties (e.g., "Is the integer odd?" or "Is it divisible by 10?") allows you to see sufficiency without solving completely. For example, if you need to know if an integer is even, and one statement tells you it is prime and greater than 2, that is sufficient to answer "no"—all primes greater than 2 are odd.

Summary

• Number properties are the DNA of GMAT arithmetic; understanding classifications (positive/negative, even/odd, prime/composite) and their interaction rules is non-negotiable.
• Prime factorization is your most versatile tool, forming the basis for finding the Greatest Common Factor (GCF), Least Common Multiple (LCM), and evaluating divisibility.
• Use the relationship $(GCF)\ast (LCM)=A\ast B$ to solve problems involving two integers efficiently.
• In Data Sufficiency, your primary goal is to determine if information is sufficient, not to find the final answer. Leverage properties like divisibility rules and the behavior of consecutive integers to assess sufficiency with minimal calculation.
• Always consider the full set of integers (including negatives and zero) unless stated otherwise, and avoid the classic trap of treating 1 as a prime number.
• Strategic pattern recognition, built on these fundamentals, is what separates high scorers—it enables speed, accuracy, and confidence throughout the Quantitative section.