Hey there, future MBA! Pull up a chair, grab a coffee. We need to talk about something crucial for your GMAT Quant journey: Number Properties. I know, I know, it sounds a bit dry, like something straight out of a dusty old textbook. But trust me, mastering these concepts isn’t just about memorizing rules; it’s about understanding the very fabric of numbers, and it’s a game-changer for your GMAT score.
Think about it. Number Properties questions pop up constantly. They might not always scream “I’m a Number Properties question!” but they’re often lurking beneath the surface of complex problems. If you’re not rock-solid on them, you’re leaving valuable points on the table. And honestly, who wants to do that after all the effort you’re putting in?
You’re probably thinking, “Okay, but I know what an even number is, and I know what a prime number is. What more is there?” Ah, my friend, that’s where the GMAT gets sneaky. It takes those basic ideas and twists them, combines them, and presents them in ways that can trip you up if you’re not truly thinking like a GMAT test-taker. We’re not just going over the basics today; we’re diving into some essential, advanced tips to help you ace these tricky questions.
Beyond the Obvious: Divisibility Rules & Prime Power
Everyone knows a number is divisible by 2 if it’s even, or by 5 if it ends in 0 or 5. But the GMAT expects you to go deeper. Way deeper. Let’s talk about some less common but incredibly powerful divisibility insights.
The Power of Prime Factorization: Your Secret Weapon
This is probably the single most important tool in your Number Properties arsenal. Prime factorization isn’t just a step; it’s a way of seeing numbers. Every positive integer greater than 1 can be expressed as a unique product of prime numbers. Why is this so powerful?
-
Finding ALL Factors: If you have the prime factorization of a number, say (N = p_1^{a} cdot p_2^{b} cdot p_3^{c}), then any factor of N must be in the form (p_1^{x} cdot p_2^{y} cdot p_3^{z}), where (0 le x le a), (0 le y le b), and (0 le z le c). This is how you really understand factors, not just list them.
-
Counting the Number of Factors: This is a classic GMAT move. Once you have the prime factorization, the total number of factors is found by taking each exponent, adding 1 to it, and then multiplying those results. So for (N = p_1^{a} cdot p_2^{b} cdot p_3^{c}), the number of factors is ((a+1)(b+1)(c+1)). This is incredibly useful for Data Sufficiency questions that ask about the number of factors or perfect squares.
-
LCM and GCF: Forget the old listing method. With prime factorization, the Greatest Common Factor (GCF) is the product of common prime factors raised to the lowest power they appear in either number. The Least Common Multiple (LCM) is the product of ALL prime factors raised to the highest power they appear in either number. It’s systematic and foolproof.
Example: How many factors does 720 have?
First, prime factorize 720: (720 = 72 times 10 = (8 times 9) times (2 times 5) = (2^3 times 3^2) times (2 times 5) = 2^4 times 3^2 times 5^1).
Number of factors: ((4+1)(2+1)(1+1) = 5 times 3 times 2 = 30). See how quickly that solves it?
Divisibility Rules for Composite Numbers
You know the basic ones, but what about numbers like 6, 12, or even 15? The trick is to break them down into their coprime factors.
Do you need personalized preparation?Tutoring in Spanish with official exam material in English.
I'm Claudio Hurtado, a tutor specializing in online preparation for:
• GMAT Quant
• GRE Quant
• SAT Quant
• EA Quant
• FRM Quant
I offer personalized tutoring, tailored to your pace and goals.
🌐 Visit my websites:
• https://clasesgmat.es (for Spain)
• https://gmatchile.cl (for Chile)
📧 Contact me: clasesgmatchile@gmail.com
📱 WhatsApp: +56937780070
A number is divisible by 6 if it’s divisible by both 2 AND 3. (Not 2 and 4, because 2 and 4 are not coprime – they share a factor greater than 1).
A number is divisible by 12 if it’s divisible by both 3 AND 4. (Not 2 and 6!)
A number is divisible by 15 if it’s divisible by both 3 AND 5.
This insight saves you so much time. Instead of checking a complicated rule for 12, you just check if it’s an even number (divisible by 2), and if its last two digits are divisible by 4. Oh wait, for 12 you need 3 and 4, not 2 and 4. Be careful there! A number divisible by 4 is already divisible by 2. This is why 3 and 4 are the correct pair for 12, not 2 and 6.
Odds, Evens, and the Zero Factor
Odds and Evens seem simple, right? Add an odd to an odd, you get an even. Multiply an odd by an even, you get an even. These rules are your bread and butter. But where do people stumble? Often, it’s about paying attention to the details and not making assumptions.
-
Zero is an Even Number: This is a big one. It’s often the hidden trap. Is x an even number? If x could be 0, then yes, it is. (0 div 2 = 0) with no remainder. Don’t forget it!
-
Powers: An odd number raised to any positive integer power is always odd. An even number raised to any positive integer power is always even. Simple, but powerful for simplifying expressions.
-
Combining Operations: Practice combining these rules. If (x) is even and (y) is odd, what’s (x^2 + xy + y^2)?
(E^2 = E)
(E times O = E)
(O^2 = O)
So, (E + E + O = E + O = O). The whole expression is odd. This kind of quick analysis is crucial.
The Remainder Realm: More Than Just Leftovers
Remainders. They are notoriously tricky. But once you grasp a few key concepts and strategies, you’ll feel much more confident. Remember the fundamental formula: Dividend = Divisor Quotient + Remainder. This is your starting point for almost everything.
Negative Remainders: A Shortcut to Simplicity
This is where things get interesting. Sometimes, thinking in “negative remainders” can simplify complex problems. What does that mean?
If 17 divided by 5 gives a remainder of 2 ((17 = 5 times 3 + 2)), you can also think of it as “17 is 3 less than a multiple of 5” ((17 = 5 times 4 – 3)). So, a remainder of 2 (mod 5) is equivalent to a remainder of -3 (mod 5).
Why is this helpful? Imagine you’re working with large numbers or powers. If a number leaves a remainder of -1 with respect to a divisor, it behaves much like 1 for certain operations. For instance, if (N) leaves a remainder of -1 when divided by 7, then (N^{100}) will leave a remainder of ((-1)^{100} = 1) when divided by 7. Much easier than working with positive remainders!
Cyclicity of Remainders: Uncovering Patterns
When you’re dealing with powers and remainders, look for cycles.
Example: What is the remainder when (7^{25}) is divided by 5?
Let’s look at the powers of 7 modulo 5:
-
(7^1 div 5 rightarrow R=2)
-
(7^2 = 49 div 5 rightarrow R=4)
-
(7^3 = 7 times 49 rightarrow R=(2 times 4) div 5 = 8 div 5 rightarrow R=3)
-
(7^4 = 7 times 7^3 rightarrow R=(2 times 3) div 5 = 6 div 5 rightarrow R=1)
-
(7^5 = 7 times 7^4 rightarrow R=(2 times 1) div 5 rightarrow R=2)
See the pattern? The remainders are 2, 4, 3, 1, 2, 4, 3, 1… The cycle length is 4.
To find the remainder for (7^{25}), we divide the exponent (25) by the cycle length (4): (25 div 4 = 6) with a remainder of 1.
This means the remainder for (7^{25}) is the same as the remainder for (7^1), which is 2.
This cyclicity applies to last digits as well! The pattern of the last digit of a number raised to consecutive powers also follows a cycle. Master this, and you’ll solve seemingly impossible problems quickly.
Consecutive Integers: Know Their Quirks
Questions involving consecutive integers are very common. Here are some advanced observations:
-
Sum of N Consecutive Integers: The sum is always divisible by N if N is odd. If N is even, the sum is divisible by N/2, but not necessarily by N. For example, sum of 3 consecutive integers ((x-1)+x+(x+1) = 3x), divisible by 3. Sum of 4 consecutive integers ((x-1)+x+(x+1)+(x+2) = 4x+2), divisible by 2 but not by 4.
-
Product of K Consecutive Integers: This is a powerful property. The product of any K consecutive integers is always divisible by K factorial (K!). For example, the product of any 3 consecutive integers is divisible by (3! = 6). This is often hidden in questions about divisibility of factorials or larger products.
Your Mindset: Attack GMAT Quant Like a Pro
Beyond the specific rules, how you approach these problems makes a huge difference.
-
Don’t Be Afraid to Test Numbers: While algebraic reasoning is often preferred, sometimes plugging in a few small, representative numbers can quickly reveal a pattern or eliminate answer choices, especially in Data Sufficiency. Just make sure your chosen numbers satisfy all conditions.
-
Always Consider Edge Cases: What if a number is 0? What if it’s 1? What if it’s negative? What if it’s a prime? What if it’s a perfect square? The GMAT loves to test these boundaries.
-
Work Backwards from the Answer Choices: For certain Problem Solving questions, especially those with integer answer choices, starting with the answers and working backward can be faster than a direct algebraic solution.
-
Identify the Core Concept: Every GMAT Quant problem is testing a core mathematical concept. Your first step should always be to identify what that concept is. Is it divisibility? Remainders? Factors? Once you know, you can pull out the right tools from your toolbox.
-
Practice with a Purpose: Don’t just do problem after problem. When you get one wrong, understand why*. Was it a conceptual gap? A calculation error? A misinterpretation of the question? A timing issue? Learning from your mistakes is where the real growth happens.
Mastering GMAT Quant Number Properties isn’t about rote memorization; it’s about developing an intuitive understanding of how numbers work and how they interact. It’s about seeing the patterns, applying the right rules at the right time, and thinking critically under pressure. These advanced tips are designed to give you that edge, moving you beyond the basics to a deeper, more strategic level of understanding.
So, next time you see a Number Properties question, don’t just solve it. Analyze it. Break it down. Use prime factorization, consider remainders, play with odds and evens, and ask yourself what underlying properties are being tested. With consistent practice and this focused approach, you’ll not only ace these questions but also build a stronger foundational understanding that benefits your entire GMAT Quant section.
—
📚 ¿Necesitas preparación personalizada?
Soy Claudio Hurtado, tutor especializado en preparación online para:
• GMAT QUANT
• GRE QUANT
• SAT QUANT
• EA QUANT
• FRM QUANT
Ofrezco tutorías personalizadas, adaptadas a tu ritmo y objetivos.
🌐 Visita mis sitios web:
• https://clasesgmat.es (para España)
• https://gmatchile.cl (para Chile)
📧 Contáctame: clasesgmatchile@gmail.com
📱 WhatsApp: +56937780070