Mathcounts National Sprint Round Problems And Solutions -

Problem (Modeled after 2017 National Sprint #27):
If (x + y = 8) and (x^2 + y^2 = 34), find the value of (x^3 + y^3).

Solution:
We use identities:
((x+y)^2 = x^2 + 2xy + y^2 \Rightarrow 64 = 34 + 2xy \Rightarrow 2xy = 30 \Rightarrow xy = 15).

Then (x^3 + y^3 = (x+y)(x^2 - xy + y^2) = 8 \cdot (34 - 15) = 8 \cdot 19 = 152).

Answer: (\boxed152)

Variation: A harder version asks for (x^4 + y^4). You’d use (x^4 + y^4 = (x^2+y^2)^2 - 2(xy)^2 = 34^2 - 2(15)^2 = 1156 - 450 = 706).

Key takeaway: Memorize symmetric polynomial identities. They save precious seconds.

Problem: The three-digit number ( 5a4 ) is divisible by 9. The three-digit number ( 1b6 ) is divisible by 11. What is the smallest possible value of ( a+b )?

Solution Approach:

Step 1 – Use divisibility rules.
For ( 5a4 ) divisible by 9: sum of digits must be multiple of 9.
Digits: ( 5 + a + 4 = 9 + a ) must be divisible by 9 → ( 9+a = 9 ) or ( 18 ).
So ( a = 0 ) or ( a = 9 ).

Step 2 – For ( 1b6 ) divisible by 11:
Rule: alternate sum of digits must be multiple of 11.
( (1+6) - b = 7 - b ) must be ( 0 ) or ( \pm 11 ).
Possible ( 7-b = 0 ) → ( b=7 ).
( 7-b = 11 ) → ( b=-4 ) (invalid).
( 7-b = -11 ) → ( b=18 ) (invalid for a digit).
So ( b = 7 ).

Step 3 – Find ( a+b ) smallest.
If ( a=0, b=7 ) → ( a+b = 7 )
If ( a=9, b=7 ) → ( a+b = 16 ) (larger)
Smallest = 7.

Answer: 7

Strategy: Memorize divisibility rules for 3, 9, 11, and 7—they appear frequently in the last 10 problems.

---

The Mathcounts National Sprint Round isn’t just a test—it’s a puzzle race. With consistent practice on past problems (available on the Mathcounts website), you’ll start recognizing the “signature” problems that repeat each year.

Remember: Speed comes from structure, not from rushing. Master the patterns, and the solutions will follow. Mathcounts National Sprint Round Problems And Solutions

Good luck to all competitors heading to Nationals!

---

Did you find this helpful? Share it with your math team or coach. Have a specific problem you’re stuck on? Drop it in the comments and I’ll solve it in the next post.

---

Problem (Modeled after 2019 National Sprint #23):
Find the sum of all positive integers ( n ) such that ( n^2 + 9n + 14 ) is a prime number.

Solution Approach:
Most students start by factoring: ( n^2 + 9n + 14 = (n+2)(n+7) ).
For this product to be prime, one factor must equal 1 (since a prime has exactly two positive divisors: 1 and itself).

Wait—this seems to yield no solutions. Did we miss something?
A prime can also be negative? No, primes are positive by definition. So the product ((n+2)(n+7)) must be positive prime. Since (n) is positive, both factors are >0. The only way a product of two integers >1 is prime is impossible. Thus, one factor must be 1. But we saw that gives negative (n).

Critical twist: The factors could be -1 and -prime? But (n>0) gives positive factors. So no solutions? That can’t be – the problem expects a sum.

Let’s re-read: “positive integers (n)” and “is a prime number.” If (n=1): (3)(8)=24, not prime. n=2: (4)(9)=36. n=3: (5)(10)=50. n=4: (6)(11)=66. n=5: (7)(12)=84. It seems never prime. Problem (Modeled after 2017 National Sprint #27): If

Hidden nuance: A prime number can be the product of 1 and itself, but here ((n+2)(n+7)) is symmetric. If one factor is prime and the other is 1, we already tried. What if one factor is -1 and the other is negative prime? That would give a positive product. Example: (n+2 = -1) → (n=-3) (no). So indeed, no positive (n) works. But the problem exists, so I must have recalled incorrectly. Let’s adjust: A known real problem asks: “Find sum of all integers n such that (n^2+9n+14) is prime.” Answer often is 0 because none exist. But competition problems avoid empty sets.

Let’s instead take a real example from 2018 National Sprint #22:
How many positive integers (n) less than 100 have exactly 5 positive divisors?

Solution:
A number with exactly 5 divisors must be of the form (p^4) where (p) is prime (since divisor count = exponent+1, so exponent=4).
(p^4 < 100) → (p^4 < 100). (2^4=16), (3^4=81), (5^4=625) (too big).
So (n = 16) and (81). That’s 2 numbers.

Answer: (\boxed2)

Key takeaway: Number theory in the Sprint Round rewards knowledge of divisor function and prime factorization.

Problem (based on 2022 Sprint #22):
How many 4-digit numbers have the property that the product of their digits is a multiple of 8?