Understanding Divisibility Rules and Prime Factorization
Divisibility rules are shortcuts that determine if one number divides evenly into another without long division. These rules form the foundation of GMAT number properties questions.
Basic Divisibility Rules
- A number is divisible by 2 if its last digit is even
- Divisibility by 3 occurs when the sum of all digits is divisible by 3
- Divisibility by 5 requires the number to end in 0 or 5
- A number is divisible by 4 if its last two digits form a number divisible by 4
- Divisibility by 6 means the number is divisible by both 2 and 3
These basic rules form the foundation for solving more complex divisibility problems.
Prime Factorization Fundamentals
Prime factorization breaks down a number into its prime number components. For example, 48 equals 2^4 times 3, written as 2^4 × 3.
This representation reveals all factors of a number. It is essential for finding GCD and LCM. Understanding prime factorization helps you solve problems involving consecutive integers, factor counting, and remainder operations.
The GMAT frequently tests whether you can quickly identify prime factorization. Data sufficiency questions often require this skill to determine if given information is adequate.
Applying Prime Factorization
Mastering these foundational concepts prepares you for sophisticated number property problems. You will combine multiple rules and think strategically about which approach to use. The faster you recognize prime factorizations, the quicker you solve problems.
Greatest Common Divisor (GCD) and Least Common Multiple (LCM)
The greatest common divisor (GCD) is the largest number that divides all given numbers evenly. The least common multiple (LCM) is the smallest number that all given numbers divide into evenly. These concepts are interconnected and appear frequently together on GMAT questions.
Finding GCD and LCM Using Prime Factorization
To find GCD, list the prime factors of each number. Multiply the common factors using their lowest powers. For example, GCD of 24 and 36 involves factoring: 24 = 2^3 × 3 and 36 = 2^2 × 3^2. The GCD is 2^2 × 3 = 12.
To find LCM, multiply all prime factors using their highest powers. For the same numbers, LCM = 2^3 × 3^2 = 72.
The GCD-LCM Relationship
An important relationship exists: GCD times LCM equals the product of the original numbers. This formula helps verify answers and solve problems more efficiently. Rather than calculating both values separately, find one and use this relationship to find the other.
Real-World Applications
GMAT questions often present real-world scenarios using GCD and LCM. Problems might involve dividing objects into equal groups or finding when periodic events coincide. Understanding these concepts allows you to approach word problems systematically. The key is recognizing when a problem requires GCD (finding largest groupings) versus LCM (finding when things align).
Factors, Multiples, and Remainder Concepts
Factors are numbers that divide evenly into another number with no remainder. Multiples are the results of multiplying a number by integers. Understanding the relationship between factors and multiples is crucial for GMAT divisibility problems.
Factors and the Factor Counting Formula
If 7 is a factor of 84, then 84 is a multiple of 7. The number of factors a number has can be calculated using prime factorization. If a number equals p1^a × p2^b × p3^c, then the total number of factors is (a+1)(b+1)(c+1).
For instance, 24 = 2^3 × 3^1 has (3+1)(1+1) = 8 factors: 1, 2, 3, 4, 6, 8, 12, and 24.
Understanding Remainders
Remainder problems test your understanding of division and modular arithmetic. When dividing number A by number B, we get a quotient and remainder. This relationship is expressed as A = BQ + R, where R is the remainder. R must be less than B.
GMAT questions often ask about patterns in remainders or use remainder information to establish constraints. For example, if a number leaves remainder 3 when divided by 7, you can write it as 7k + 3 for some integer k.
Pattern Recognition for Remainders
Recognizing these patterns helps you solve problems involving divisibility conditions, consecutive integers, and number classification. Many test-takers struggle with remainder problems because they require translating word descriptions into mathematical equations. Practice converting word problems into remainder notation to build this skill.
Consecutive Integers and Divisibility Patterns
Consecutive integers follow predictable divisibility patterns that the GMAT exploits in various question types. Understanding these patterns allows you to make quick conclusions about divisibility without extensive calculation.
Core Consecutive Integer Patterns
Among any n consecutive integers, exactly one is divisible by n. This principle is powerful for solving complex divisibility problems. For three consecutive integers, one is always divisible by 3. For five consecutive integers, one is divisible by 5.
The sum of consecutive integers follows specific formulas. If you have n consecutive integers starting from a, the sum equals n(2a + n - 1) / 2.
Even and Odd Patterns
Among consecutive integers, you will have an equal number of evens and odds if the count is even. If the count is odd, you will have one more odd number.
Products of Consecutive Integers
Products of consecutive integers have special divisibility properties.
- The product of two consecutive integers is always even (divisible by 2)
- The product of three consecutive integers is always divisible by 6
- The product of k consecutive integers is always divisible by k!
GMAT questions often use these properties to establish constraints or prove divisibility relationships. For example, a question might ask whether the product of four consecutive integers is divisible by 24. Since 4! = 24, the answer is always yes. Recognizing these patterns immediately gives you significant time advantages on test day.
Strategic Approaches to Divisibility Problems on the GMAT
Successful GMAT test-takers employ strategic approaches to divisibility questions rather than relying on computational brute force.
Strategy 1: Prime Factorization First
Always check whether prime factorization will help clarify the problem. Converting numbers to prime factorization form often reveals divisibility relationships that are not immediately obvious.
Strategy 2: Apply Divisibility Rules as Filters
Before diving into calculation, apply basic divisibility rules to eliminate answer choices or establish constraints.
Strategy 3: Recognize Problem Types
Each problem type requires specific approaches. Data sufficiency questions about divisibility often hinge on whether you can determine the prime factorization. Problems asking for the number of factors require the (a+1)(b+1)(c+1) formula.
Strategy 4: Watch for Disguised Remainder Problems
Sometimes the question describes a scenario that translates to finding a remainder without explicitly mentioning the word.
Strategy 5: Consider Special Number Properties
Ask: Is the number odd or even? Could it be a perfect square? These properties constrain the prime factorization.
Strategy 6: Use the GCD-LCM Formula Strategically
Rather than calculating both values separately, find one and use this relationship to find the other. Practice timing yourself on divisibility questions to develop speed. Most students improve significantly through systematic practice. The key is developing automatic pattern recognition so you can apply the appropriate strategy instantly.