2025 AMC 10A Problems/Problem 11: Difference between revisions

Revision as of 18:30, 6 November 2025

The sequence $1,x,y,z$ is arithmetic. The sequence $1,p,q,z$ is geometric. Both sequences are strictly increasing and contain only integers, and $z$ is as small as possible. What is the value of $x+y+z+p+q$ ?

$\textbf{(A) } 66 \qquad\textbf{(B) } 91 \qquad\textbf{(C) } 103 \qquad\textbf{(D) } 132 \qquad\textbf{(E) } 149$

Solution 1

Since the geometric sequence is more restrictive, we can test values for the common ratio until we find one that works. The first sequence is an arithmetic sequence, so $z-1$ must be divisible by $3$ . After a few tests, we find that a common ratio of $4$ results in the geometric sequence $1,4,16,64,$ so the arithmetic sequence is $1,22,43,64.$ The answer is $4+16+64+22+43=\boxed{\text{(E) }149}.$

A more generalized solution is as follows. Let the common difference of the arithmetic sequence be $d$ , and the common ratio of the geometric sequence be $r.$ Hence, the two sequences are $1,1+d,1+2d,1+3d$ and $1,r,r^2,r^3.$ Since $z=1+3d=r^3,$ the arithmetic sequence is $1,1+d,1+2d,r^3.$ Since $d=\dfrac{1+3d-1}{3}=\dfrac{r^3-1}{3}$ is a positive integer, we seek the smallest $r\neq1$ such that $r^3-1=(r-1)(r^2+r+1)$ is divisble by $3,$ so the smallest $r$ is $4$ . The rest follows like above.

~Tacos_are_yummy_1

~Minor edit by dodobird150

Solution 2

Since 1, x, y, z is an arithmetic sequence, we have y = 2x - 1 and z = 3x - 2. Since 1, p, q, z is a geometric sequence, we have q = p^2 and z = p^3. Thus p^3 = 3x - 2.

Because p^3 ≡ p (mod 3), we get 3x - 2 ≡ p (mod 3), so p ≡ 1 (mod 3). The smallest integer p > 1 satisfying this is p = 4.

Then 64 = 3x - 2 → x = 22, y = 43, z = 64, q = 16. Therefore, x + y + z + p + q = 22 + 43 + 64 + 4 + 16 = 149.

~Continuous_Pi

Video Solution (Fast and Easy)

https://youtu.be/mxA52qodEqk?si=jxyGlehyqeHxic1i ~ Pi Academy

Video Solution

https://youtu.be/gWSZeCKrOfU

~MK

2025 AMC 10A (Problems • Answer Key • Resources)
Preceded by Problem 10	Followed by Problem 12
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 10 Problems and Solutions

Page

Toolbox

Search