Diophantine Equations
Integer solutions of equations, bounding, factoring integer equations
Diophantine EquationsAMC 10 Step by Step
Name: Date: October 28, 2026
Number Theory · 27 problems have this as their main idea
27
primary-topic problems (2.1% of all)
26
more as a secondary topic
Where it appears
3
P1-10
10
P11-15
1
P16-20
13
P21-25
What you need to know
- A Diophantine equation asks for integer solutions, often positive ones. That gives an extra tool, divisibility: both sides must have the same factors, the same parity (odd or even), and the same remainders. Example: has no integer solutions, since the left side is even and is odd.
- Simon's Favorite Factoring Trick. Adding to both sides turns into . Then list the factor pairs of the right side. Example: becomes .
- Linear equations. Let , , be integers and . Then has integer solutions exactly when divides . Example: has none, because does not divide .
- All solutions from one. If is one solution, the others are for every integer : moves in steps of while moves the other way in steps of . Example: has , and also , , and so on.
- Difference of squares. means . The two factors are both even or both odd, since they differ by . Example: for , the pairs and give and .
- Bounding. If we may assume , the smallest variable can't be too big. Example: in , the fraction is the biggest of the three, so it is at least , which forces .
- Perfect squares (and other perfect powers) are rare. If , then is not a perfect square. Example: for positive , is never a square, since .
How AMC 10 tests it
- "How many ordered pairs of positive integers satisfy …?" with an term plus terms in and . Use Simon's Favorite Factoring Trick, then count factor pairs (problems 12–20).
- Coin, stamp, or ticket problems: where and are zero or positive. Count the solutions, or find the largest or smallest value.
- "For how many is (or a similar fraction) an integer?" Rewrite it as , so must divide , and count divisors.
- Write as a sum of consecutive integers or a difference of squares; count the ways using factor pairs.
- Late problems (20–25) combine bounding and casework, such as three variables in an equation that stays the same when you swap them.
Standard approaches
- Get one variable by itself. If it lands in a fraction, the denominator must divide the numerator.
- Try to factor: Simon's Favorite Factoring Trick, difference of squares, or completing the square in both variables.
- Limit a variable using the order of the variables or the size of the terms, then try the small cases.
- Compare remainders of both sides after dividing by a small number (work mod that number). This can rule out solutions or force odd or even.
- For a linear equation, find one solution, then step by and . Count the steps that stay in range.
Worked example
How many ordered pairs of positive integers satisfy ?
(A) (B) (C) (D) (E)
Step 1: factor. multiplies out to . So add to both sides:
Step 2: both factors positive. Then can be any of the positive divisors of : . Each gives positive and . For example, and give . Check: .
Step 3: both factors negative. Since and , we have and . So if both factors are negative, is between and and is between and . Their product is at most , less than , so there are no solutions here.
Step 4: total. Only the pairs from Step 2 work.
The answer is .
Pitfalls
- Forgetting the negative factor pairs, or not checking whether they still give positive values. Example: above, gives but .
- Dropping the "same parity" rule for . If leaves remainder when divided by (), there are no solutions. Example: has none: and each pair an odd factor with an even one.
- Counting unordered pairs when the problem says ordered, or the other way round. Ordered pairs count and separately.
- Stopping after one solution of a linear equation instead of finding the whole family. Example: has three positive solutions: , , .
Traps that recur
- Only using b | 9 and a | 14 (twelve candidate pairs) without checking the full divisibility, or overlooking that 9 must divide 14b^2. (2007 AMC 10B #25)
- Listing c = 1, 10, 19, ..., 91 and then counting the gaps rather than the terms, which gives the 10 in (B). (2025 AMC 10B #23)
- Trying to guess N by testing small products, or accepting the factorization 3 times 43 that leads to N = 0. (2023 AMC 10A #23)
- Mixing pages and sheets (c sheets removed means 2c pages, and the removed pages run from 2b+1 to 2b+2c). (2021 AMC 10A #22)
Problems, easiest first
Open any of them to try it here; the worked solution is on the problem's own page.
← PreviousPage 2 of 2