Skip to content

Diophantine Equations: all problems

Focus mode: every practice problem from the chapter, one after another.

0 / 21 solved

Problem 26.1.1

AMC 12

Integers xx and yy with x>y>0x > y > 0 satisfy x+y+xy=80x + y + xy = 80. What is xx?

Problem 26.1.2

AMC 10

How many ordered pairs of integers (x,y)(x, y) satisfy the equation

x2020+y2=2y?x^{2020} + y^2 = 2y?

Problem 26.1.3

AMC 10

Let aa and bb be relatively prime positive integers with a>b>0a > b > 0 and a3−b3(a−b)3=733\dfrac{a^3 - b^3}{(a - b)^3} = \dfrac{73}{3}. What is a−ba - b?

Problem 26.1.4

AIME

Find 3x2y23x^2y^2 if xx and yy are integers such that y2+3x2y2=30x2+517y^2 + 3x^2y^2 = 30x^2 + 517.

Problem 26.1.5

AMC 10

If the positive integer cc has positive integer divisors aa and bb with c=abc = ab, then aa and bb are said to be complementary divisors of cc. Suppose that NN is a positive integer that has one complementary pair of divisors that differ by 2020 and another pair of complementary divisors that differ by 2323. What is the sum of the digits of NN?

Problem 26.1.6

AMC 10

How many ordered pairs of integers (m,n)(m, n) satisfy the equation m2+mn+n2=m2n2m^2 + mn + n^2 = m^2n^2?

Problem 26.1.7

AMC 10

An arithmetic sequence (of positive integers) has n≥3n \ge 3 terms, initial term aa and common difference d>1d > 1. Carl wrote down all the terms in this sequence correctly except for one term which was off by 11. The sum of the terms was 222222. What was a+d+na + d + n?

Problem 26.1.8

AMC 12

How many ordered pairs of positive integers (b,c)(b, c) exist where both x2+bx+c=0x^2 + bx + c = 0 and x2+cx+b=0x^2 + cx + b = 0 do not have distinct, real solutions?

Problem 26.1.9

AIME

This problem also appears in the book as 21.3.17.

There is a prime number pp such that 16p+116p + 1 is the cube of a positive integer. Find pp.

Problem 26.1.10

USAMO

Determine all non-negative integral solutions (n1,n2,…,n14)(n_1, n_2, \dots, n_{14}) if any, apart from permutations, of the Diophantine Equation

n14+n24+⋯+n144=1599.n_1^4 + n_2^4 + \cdots + n_{14}^4 = 1599.
Click a choice or type its letter (A–E).

Problem 26.1.11

AMC 10A

A four-term sequence is formed by adding each term of a four-term arithmetic sequence of positive integers to the corresponding term of a four-term geometric sequence of positive integers. The first three terms of the resulting four-term sequence are 5757, 6060, and 9191. What is the fourth term of this sequence?

Click a choice or type its letter (A–E).

Problem 26.1.12

AMC 12

Two distinct numbers are selected from the set {1,2,3,4,…,36,37}\{1, 2, 3, 4, \dots, 36, 37\} so that the sum of the remaining 3535 numbers is the product of these two numbers. What is the difference of these two numbers?

Problem 26.1.13

AMC 12

There is a unique ordered triple (a,k,m)(a, k, m) of nonnegative integers such that

4a+4a+k+4a+2k+⋯+4a+mk2a+2a+k+2a+2k+⋯+2a+mk=964.\frac{4^a + 4^{a+k} + 4^{a+2k} + \cdots + 4^{a+mk}}{2^a + 2^{a+k} + 2^{a+2k} + \cdots + 2^{a+mk}} = 964.

What is a+k+ma + k + m?

Problem 26.1.14

AMC 10/12

A rectangular grid of squares has 141141 rows and 9191 columns. Each square has room for two numbers. Horace and Vera each fill in the grid by putting the numbers from 11 through 141×91=12,831141 \times 91 = 12{,}831 into the squares. Horace fills the grid horizontally: he puts 11 through 9191 in order from left to right into row 11, puts 9292 through 182182 into row 22 in order from left to right, and continues similarly through row 141141. Vera fills the grid vertically: she puts 11 through 141141 in order from top to bottom into column 11, then 142142 through 282282 into column 22 in order from top to bottom, and continues similarly through column 9191. How many squares get two copies of the same number?

Problem 26.1.15

AMC 10

Hiram's algebra notes are 5050 pages long and are printed on 2525 sheets of paper; the first sheet contains pages 11 and 22, the second sheet contains pages 33 and 44, and so on. One day he leaves his notes on the table before leaving for lunch, and his roommate decides to borrow some pages from the middle of the notes. When Hiram comes back, he discovers that his roommate has taken a consecutive set of sheets from the notes and that the average (mean) of the page numbers on all remaining sheets is exactly 1919. How many sheets were borrowed?

Problem 26.1.16(additional)

AMC 10

Two farmers agree that pigs are worth 300300 dollars and that goats are worth 210210 dollars. When one farmer owes the other money, he pays the debt in pigs or goats, with "change" received in the form of goats or pigs as necessary. (For example, a 390390 dollar debt could be paid with two pigs, with one goat received in change.) What is the amount of the smallest positive debt that can be resolved in this way?

Steps 300 and 210: x·300 + y·210 reaches exactly the multiples of gcd = 30

−900−600−30003006009003900
0·300 + 0·210 = 0

Target 390: can you land on it?

The token is at 0·300 + 0·210 = 0. Target 390: can you land on it?

Problem 26.1.17(additional)

AHSME

How many triples (a,b,c)(a, b, c) of positive integers satisfy the simultaneous equations

ab+bc=44ab + bc = 44
ac+bc=23?ac + bc = 23?

Problem 26.1.18(additional)

AIME

One of Euler's conjectures was disproved in the 1960s by three American mathematicians when they showed there was a positive integer such that

1335+1105+845+275=n5.133^5 + 110^5 + 84^5 + 27^5 = n^5.

Find the value of nn.

Fifth powers mod 10 can only leave {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}

power k5
mod m10

Fifth powers mod 10 can only leave

  • 0 ✓
  • 1 ✓
  • 2 ✓
  • 3 ✓
  • 4 ✓
  • 5 ✓
  • 6 ✓
  • 7 ✓
  • 8 ✓
  • 9 ✓
{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}

Fifth powers mod 10 leave {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}

Problem 26.1.19(additional)

AIMEChallenge

Find the largest possible value of kk for which 3113^{11} is expressible as the sum of kk consecutive positive integers.

Problem 26.1.20(additional)

AIMEChallenge

For some integer mm, the polynomial x3−2011x+mx^3 - 2011x + m has the three integer roots aa, bb, and cc. Find ∣a∣+∣b∣+∣c∣|a| + |b| + |c|.

Problem 26.1.21(additional)

AMC 12Challenge

Let m≥5m \ge 5 be an odd integer, and let D(m)D(m) denote the number of quadruples (a1,a2,a3,a4)(a_1, a_2, a_3, a_4) of distinct integers with 1≤ai≤m1 \le a_i \le m for all ii such that mm divides a1+a2+a3+a4a_1 + a_2 + a_3 + a_4. There is a polynomial

q(x)=c3x3+c2x2+c1x+c0q(x) = c_3x^3 + c_2x^2 + c_1x + c_0

such that D(m)=q(m)D(m) = q(m) for all odd integers m≥5m \ge 5. What is c1c_1?