Study guide
2.1 Integers, Divisibility & Prime Factorization
GRE Quantitative Reasoning Exam
Track your progress as you read
Finished sections get a check mark.
1 GRE Quantitative Reasoning Overview & Exam Strategy
1.1 GRE Quant Format, Scoring & Computer-Adaptive Structure 1.2 Quantitative Comparison (QC) Core Strategies 1.3 Multiple-Choice & Numeric Entry Strategies
2 Chapter 2: Arithmetic & Number Properties
2.1 Integers, Divisibility & Prime Factorization 2.2 Fractions, Decimals, Percents & Ratios 2.3 Exponents, Roots & Absolute Value 2.4 Number Lines, Order of Operations & Estimation
3 Chapter 3: Algebra & Coordinate Geometry
3.1 Algebraic Expressions, Equations & Inequalities 3.2 Quadratic Equations & Systems of Equations 3.3 Functions, Sequences & Custom Operations 3.4 Coordinate Geometry 3.5 Algebraic Word Problems
4 Chapter 4: Geometry & Measurement
4.1 Lines, Angles & Polygons 4.2 Triangles & Right Triangle Geometry 4.3 Circles & Inscribed Figures 4.4 Quadrilaterals & 3-D Geometry
5 Chapter 5: Data Analysis, Statistics & Probability
5.1 Descriptive Statistics & Data Measures 5.2 Quartiles, Percentiles & Boxplots 5.3 Permutations, Combinations & Counting Principles 5.4 Probability & Independent/Dependent Events 5.5 Data Interpretation: Tables, Bar Charts & Line Graphs
2.1 Integers, Divisibility & Prime Factorization
Key Takeaways Explain This Topic AI
The prime numbers under 50 are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, and 47; note that 1 is neither prime nor composite, and 2 is the only even prime number.
Divisibility shortcuts save crucial time on the GRE: a number is divisible by 3 if the sum of its digits is divisible by 3, by 4 if its last two digits form a multiple of 4, and by 9 if the sum of its digits is divisible by 9.
The total number of positive factors of an integer n with prime factorization p1^a * p2^b * p3^c... is equal to (a + 1)(b + 1)(c + 1)...
For any two positive integers a and b, the product of their Greatest Common Divisor (GCD) and Least Common Multiple (LCM) equals the product of the numbers: GCD(a, b) * LCM(a, b) = a * b.
In integer division, Dividend = (Divisor * Quotient) + Remainder, where the remainder r must satisfy 0 <= r < Divisor.
Last updated: July 2026
2.1 Integers, Divisibility & Prime Factorization
Number properties form the foundational bedrock of GRE Quantitative Reasoning. Questions testing integer properties, divisibility, prime numbers, and remainders appear frequently across both Multiple-Choice and Quantitative Comparison (QC) formats. Mastering these rules enables you to solve complex problems rapidly without relying on tedious brute-force calculations.
Integer Definitions & Core Properties
An integer is any whole number in the set { … , − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 , … } \{\dots, -3, -2, -1, 0, 1, 2, 3, \dots\} { … , − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 , … } . Integers include positive whole numbers, negative whole numbers, and zero.
GRE Quantitative Comparison Trap: Never assume a variable represents an integer unless the problem explicitly states that x x x or y y y is an integer. If a question states " x > 0 x > 0 x > 0 ," x x x could be a fraction like 1 2 \frac{1}{2} 2 1 or an irrational number like 2 \sqrt{2} 2 .
Essential Subsets of Real Numbers
Positive Integers: { 1 , 2 , 3 , 4 , … } \{1, 2, 3, 4, \dots\} { 1 , 2 , 3 , 4 , … } (also called counting numbers or natural numbers).
Non-Negative Integers: { 0 , 1 , 2 , 3 , 4 , … } \{0, 1, 2, 3, 4, \dots\} { 0 , 1 , 2 , 3 , 4 , … } (includes zero).
Zero ( 0 0 0 ): Zero is an even integer . It is neither positive nor negative. Any number multiplied by zero is zero ( n × 0 = 0 n \times 0 = 0 n × 0 = 0 ), and division by zero is undefined.
Divisibility Rules (2 through 10)
An integer a a a is divisible by an integer b b b (where b ≠ 0 b \neq 0 b = 0 ) if there exists an integer q q q such that a = b × q a = b \times q a = b × q , leaving a remainder of 0 0 0 . Below is the definitive reference table for divisibility test shortcuts required on the GRE:
Divisor Divisibility Rule Example
2 The last digit is even ( 0 , 2 , 4 , 6 , 8 0, 2, 4, 6, 8 0 , 2 , 4 , 6 , 8 ). 3 , 458 3,458 3 , 458 ends in 8 8 8 (even) → \rightarrow → Divisible.
3 The sum of all digits is divisible by 3 3 3 . 7 , 821 → 7 + 8 + 2 + 1 = 18 7,821 \rightarrow 7+8+2+1 = 18 7 , 821 → 7 + 8 + 2 + 1 = 18 (divisible by 3) → \rightarrow → Divisible.
4 The number formed by the last two digits is divisible by 4 4 4 . 5 , 324 → 5,324 \rightarrow 5 , 324 → last two digits 24 24 24 ( 24 ÷ 4 = 6 24 \div 4 = 6 24 ÷ 4 = 6 ) → \rightarrow → Divisible.
5 The last digit is 0 0 0 or 5 5 5 . 9 , 845 9,845 9 , 845 ends in 5 → 5 \rightarrow 5 → Divisible.
6 The number is divisible by both 2 2 2 and 3 3 3 . 4 , 116 4,116 4 , 116 is even and sum of digits 4 + 1 + 1 + 6 = 12 4+1+1+6=12 4 + 1 + 1 + 6 = 12 (divisible by 3) → \rightarrow → Divisible.
8 The number formed by the last three digits is divisible by 8 8 8 . 19 , 128 → 128 ÷ 8 = 16 → 19,128 \rightarrow 128 \div 8 = 16 \rightarrow 19 , 128 → 128 ÷ 8 = 16 → Divisible.
9 The sum of all digits is divisible by 9 9 9 . 63 , 720 → 6 + 3 + 7 + 2 + 0 = 18 63,720 \rightarrow 6+3+7+2+0 = 18 63 , 720 → 6 + 3 + 7 + 2 + 0 = 18 (divisible by 9) → \rightarrow → Divisible.
10 The last digit is 0 0 0 . 4 , 570 4,570 4 , 570 ends in 0 → 0 \rightarrow 0 → Divisible.
Prime Numbers & Prime Factorization
A prime number is a positive integer greater than 1 1 1 that has exactly two distinct positive divisors: 1 1 1 and itself. A positive integer greater than 1 1 1 that is not prime is a composite number .
Crucial Prime Number Facts
1 1 1 is NEITHER prime nor composite. It has only one positive divisor ( 1 1 1 ).
2 2 2 is the ONLY even prime number. Every other even number is divisible by 2 2 2 and thus composite.
2 2 2 is the smallest prime number.
Primes under 50 (Memorize these 15 numbers): 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47 \mathbf{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47} 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47
Prime Factorization Trees
Every composite number can be uniquely expressed as a product of prime numbers (Fundamental Theorem of Arithmetic). To build a prime factorization tree, break the number down into any two factors and continue breaking non-prime factors down until only primes remain.
Worked Example: Prime Factorization of 360 360 = 36 × 10 = ( 6 × 6 ) × ( 2 × 5 ) = ( 2 × 3 ) × ( 2 × 3 ) × 2 × 5 = 2 3 × 3 2 × 5 1 360 = 36 \times 10 = (6 \times 6) \times (2 \times 5) = (2 \times 3) \times (2 \times 3) \times 2 \times 5 = 2^3 \times 3^2 \times 5^1 360 = 36 × 10 = ( 6 × 6 ) × ( 2 × 5 ) = ( 2 × 3 ) × ( 2 × 3 ) × 2 × 5 = 2 3 × 3 2 × 5 1
Formula for Total Number of Positive Factors
If the prime factorization of a positive integer N N N is: N = p 1 a × p 2 b × p 3 c … N = p_1^{a} \times p_2^{b} \times p_3^{c} \dots N = p 1 a × p 2 b × p 3 c …
where p 1 , p 2 , p 3 p_1, p_2, p_3 p 1 , p 2 , p 3 are distinct prime factors, then the total number of positive factors of N N N is given by: Total Factors = ( a + 1 ) ( b + 1 ) ( c + 1 ) … \text{Total Factors} = (a + 1)(b + 1)(c + 1)\dots Total Factors = ( a + 1 ) ( b + 1 ) ( c + 1 ) …
Example: For 360 = 2 3 × 3 2 × 5 1 360 = 2^3 \times 3^2 \times 5^1 360 = 2 3 × 3 2 × 5 1 , the number of factors is ( 3 + 1 ) ( 2 + 1 ) ( 1 + 1 ) = 4 × 3 × 2 = 24 (3+1)(2+1)(1+1) = 4 \times 3 \times 2 = 24 ( 3 + 1 ) ( 2 + 1 ) ( 1 + 1 ) = 4 × 3 × 2 = 24 factors.
Greatest Common Divisor (GCD) & Least Common Multiple (LCM)
Greatest Common Divisor (GCD): The largest positive integer that divides two or more integers without a remainder (also called Highest Common Factor, HCF).
Least Common Multiple (LCM): The smallest positive integer that is a multiple of two or more integers.
Prime Factorization Method for GCD and LCM
Express each number in its prime factorization.
For GCD: Multiply the lowest power of each common prime factor.
For LCM: Multiply the highest power of every prime factor present in any of the numbers.
Worked Example: Finding GCD and LCM of 48 and 180
Prime Factorization of 48 48 48 : 48 = 16 × 3 = 2 4 × 3 1 48 = 16 \times 3 = 2^4 \times 3^1 48 = 16 × 3 = 2 4 × 3 1
Prime Factorization of 180 180 180 : 180 = 18 × 10 = 2 2 × 3 2 × 5 1 180 = 18 \times 10 = 2^2 \times 3^2 \times 5^1 180 = 18 × 10 = 2 2 × 3 2 × 5 1 GCD ( 48 , 180 ) = 2 min ( 4 , 2 ) × 3 min ( 1 , 2 ) = 2 2 × 3 1 = 4 × 3 = 12 \text{GCD}(48, 180) = 2^{\min(4,2)} \times 3^{\min(1,2)} = 2^2 \times 3^1 = 4 \times 3 = 12 GCD ( 48 , 180 ) = 2 m i n ( 4 , 2 ) × 3 m i n ( 1 , 2 ) = 2 2 × 3 1 = 4 × 3 = 12 LCM ( 48 , 180 ) = 2 max ( 4 , 2 ) × 3 max ( 1 , 2 ) × 5 max ( 0 , 1 ) = 2 4 × 3 2 × 5 1 = 16 × 9 × 5 = 720 \text{LCM}(48, 180) = 2^{\max(4,2)} \times 3^{\max(1,2)} \times 5^{\max(0,1)} = 2^4 \times 3^2 \times 5^1 = 16 \times 9 \times 5 = 720 LCM ( 48 , 180 ) = 2 m a x ( 4 , 2 ) × 3 m a x ( 1 , 2 ) × 5 m a x ( 0 , 1 ) = 2 4 × 3 2 × 5 1 = 16 × 9 × 5 = 720
Key Formula: For any two positive integers a a a and b b b : GCD ( a , b ) × LCM ( a , b ) = a × b \text{GCD}(a, b) \times \text{LCM}(a, b) = a \times b GCD ( a , b ) × LCM ( a , b ) = a × b Verification: 12 × 720 = 8 , 640 12 \times 720 = 8,640 12 × 720 = 8 , 640 , and 48 × 180 = 8 , 640 48 \times 180 = 8,640 48 × 180 = 8 , 640 .
Even & Odd Parity Rules
Parity refers to whether an integer is even or odd. Remember: Zero ( 0 0 0 ) is even, negative numbers can be even or odd (e.g., − 4 -4 − 4 is even, − 7 -7 − 7 is odd).
Arithmetic Operations with Parity
- Operation Rule Example
- Even ± \pm ± Even Even 6 + 4 = 10 6 + 4 = 10 6 + 4 = 10
- Odd ± \pm ± Odd Even 7 + 3 = 10 7 + 3 = 10 7 + 3 = 10
- Even ± \pm ± Odd Odd 6 + 3 = 9 6 + 3 = 9 6 + 3 = 9
- Even × \times × Even Even 4 × 6 = 24 4 \times 6 = 24 4 × 6 = 24
- Even × \times × Odd Even 4 × 5 = 20 4 \times 5 = 20 4 × 5 = 20
- Odd × \times × Odd Odd 5 × 7 = 35 5 \times 7 = 35 5 × 7 = 35
- ( Even ) k (\text{Even})^k ( Even ) k ( k > 0 k > 0 k > 0 ) Even 2 4 = 16 2^4 = 16 2 4 = 16
- ( Odd ) k (\text{Odd})^k ( Odd ) k ( k ≥ 0 k \ge 0 k ≥ 0 ) Odd 3 3 = 27 3^3 = 27 3 3 = 27
GRE Strategy Tip: In Quantitative Comparison questions involving parity, test 0 0 0 as an even number. If an expression involves products, remember that a single even factor makes the entire product even!
Remainder Theory
When an integer N N N (the dividend ) is divided by a positive integer d d d (the divisor ), it yields an integer q q q (the quotient ) and a non-negative integer r r r (the remainder ): N = d × q + r where 0 ≤ r < d N = d \times q + r \quad \text{where } 0 \le r < d N = d × q + r where 0 ≤ r < d
Key Remainder Properties
Range Restriction: The remainder r r r must always be greater than or equal to 0 0 0 and strictly less than the divisor d d d .
Modular Arithmetic Rules:
( a + b ) ( m o d d ) = ( ( a ( m o d d ) ) + ( b ( m o d d ) ) ) ( m o d d ) (a + b) \pmod d = ((a \pmod d) + (b \pmod d)) \pmod d ( a + b ) ( mod d ) = (( a ( mod d )) + ( b ( mod d ))) ( mod d )
( a × b ) ( m o d d ) = ( ( a ( m o d d ) ) × ( b ( m o d d ) ) ) ( m o d d ) (a \times b) \pmod d = ((a \pmod d) \times (b \pmod d)) \pmod d ( a × b ) ( mod d ) = (( a ( mod d )) × ( b ( mod d ))) ( mod d )
Cyclicity: Powers of numbers produce repeating patterns of remainder cycles when divided by a fixed base. For example, powers of 7 7 7 mod 5 5 5 follow a cycle of length 4: 7 1 ≡ 2 , 7 2 ≡ 4 , 7 3 ≡ 3 , 7 4 ≡ 1 7^1 \equiv 2, 7^2 \equiv 4, 7^3 \equiv 3, 7^4 \equiv 1 7 1 ≡ 2 , 7 2 ≡ 4 , 7 3 ≡ 3 , 7 4 ≡ 1 (mod 5).