NUMBER THEORY TOUGH 5 MARKERS / RMO LVL MOCK
ABODE OF MATHEMATICS
t.me/next ramanujans discussion
Instructions
1. Attempt all questions.
2. These are famous problems and solutions are readily available online on AoPS/mathematical
forums.
3. Most problems are above IOQM standard, meant to enhance problem-solving skills.
4. For problems asking ”all solutions” or ”number of solutions”, provide complete answers (no
partial credit).
Section A: 5M Easy (Problems 1-10)
1.
Problem
Let N denote the number of ordered triples (a, b, c) of positive integers with a, b, c ≤ 36
such that a3 + b3 + c3 is divisible by 37 . Find N mod 1000.
2.
Problem
25
Define the sequence x1 , x2 , . . . by x1 = 11 and
1 1
xk+1 = xk + −1 .
3 xk
m
If x2025 = n in lowest terms, find (m + n) mod 1000.
3.
Problem
For integer b > 2, a positive integer n is called b-beautiful if it has exactly two digits
√
in base b and these digits sum to n. Find the smallest b > 2 with more than ten
b-beautiful numbers.
4.
1
Problem
Let S be the set of rationals expressible as 0.abcd (at least one digit ̸= 0). Let N be the
number of distinct numerators when elements of S are written in lowest terms. Find N
mod 1000.
5.
Problem
An m × n grid (m, n odd > 1) is numbered row-wise. Square 200 is in the top row and
square 2000 is in the bottom row. Count ordered pairs (m, n) such that the line through
squares 200 and 2000 intersects the interior of square 1099.
6.
Problem
√
For n ∈ Z+ , define f (n) = ⌊log10 ( n)⌋. Find the largest n with f (n) < 300.
7.
Problem
Every positive integer k has a unique factorial base expansion (f1 , . . . , fm ). Given the
expansion of
16! − 32! + 48! − · · · + 2000!,
compute f1 − f2 + f3 − · · · + (−1)j+1 fj .
8.
Problem
An N-set is a set of distinct positive integers including N . Let m(N ) be the minimal
possible mean of any N-set. How many N < 2021 have m(N ) ∈ Z?
9.
Problem
For m > 2, define Q(m) as the least
P2017integer such that for all n > Q(m), there’s a perfect
cube between n and mn. Find m=3 Q(m) mod 1000.
10.
Problem
√
For n > 2, let A(n) be the area bounded by 1 ≤ x ≤ n and 0 ≤ y ≤ x⌊ x⌋. Count
integers 2 < n ≤ 1000 where A(n) ∈ Z.
2
Section B: 5M Moderate (Problems 11-20)
11.
Problem
Find all primes p for which there exist positive integers x, y, z such that xp + y p + z p −
x − y − z is a product of exactly three distinct primes.
12.
Problem
Find all prime triples (p, q, r) such that all of the following are integers:
p2 + 2q q 2 + 9r r2 + 3p
, , .
q+r r+p p+q
13.
Problem
Find all primes p and nonnegative integers x ̸= y satisfying x4 − y 4 = p(x3 − y 3 ).
14.
Problem
Find all integer pairs (x, y) satisfying x3 (y + 1) + y 3 (x + 1) = 19.
15.
Problem
Find all positive integer triples (x, y, z) satisfying 45x − 6y = 2019z .
16.
Problem
Find all triples (x, y, z) of positive integers with 2020x + 2y = 2024z .
17.
Problem
Let S be the set of ordered pairs (a, b) with gcd(a, b) = 1. Compute:
X 300
.
2a + 3b
(a,b)∈S
3
18.
Problem
For b > 1, let sb (a) be the digit sum of a in base b. Given:
⌊log23 n⌋ j n k
X
s20 = 103,
23i
i=1
⌊log20 n⌋ j n k
X
s23 = 115,
20i
i=1
compute s20 (n) − s23 (n).
19.
Problem
Let ζ = e2πi/99 and ω = e2πi/101 . The polynomial x9999 + · · · + a0 has roots ζ m + ω n
(0 ≤ m < 99, 0 ≤ n < 101). Compute a9799 + a9800 + · · · + a9998 .
20.
Problem
Q ai P
For n > 2 with prime factorization n = pi , define f (n) = pi ai . Let m be the
minimal f (n) for n > 2024. Find the smallest k > 2 with f (k) = m.
Section C: 5M Hard (Problems 21-26)
21.
Problem
2 3 4
Find all triples (x, y, z) of integers satisfying x2
+ y2
+ z2
= 1.
22.
Problem
A number is good if it equals the sum of squares of three consecutive positive integers.
It’s excellent if it equals the sum of squares of four consecutive positive integers. A good
number G is splendid if there exists an excellent number E with 3G − E = 2025. If S
is the sum of all splendid numbers, find S mod 1000.
23.
4
Problem
Find the number of positive integers n < 100 such that gcd(n2 , 2023) ̸= gcd(n, 20232 ).
24.
Problem
Consider the sequence an = 2n + 3n + 6n − 1. Determine all positive integers relatively
prime to every an .
25.
Problem
Let 1 = d1 < d2 < · · · < dk = n be all divisors of n ∈ Z+ . Find all n such that
2n = d25 + d26 − 1.
26.
Problem
2
n
For divisors di as above, find all n with k ≥ 22 satisfying d27 + d210 = d22 .
Section D: Extra Hard (Problems 27-30)
27.
Problem
Numbers 1, 2, . . . , 2012 are written on a blackboard. Each minute, a student chooses
two numbers x and y, erases them, and writes 2x + 2y. This continues until one number
N remains. Find the maximum possible N mod 1000.
Problem
Let n ≥ 3 be fixed. Initially, 1 is written n times on a blackboard, and two empty
buckets are placed below. A move consists of:
28. • Erasing two numbers a and b and writing 1 and a + b
• Adding 1 stone to the first bucket
• Adding gcd(a, b) stones to the second bucket
After finite moves, let the buckets have s and t stones respectively. Find all possible
values of st .
29.
5
Problem
Find all nonnegative integer pairs (m, n) satisfying (m + n − 5)2 = 9mn.
30.
Problem
Find all triples (x, y, z) of positive integers satisfying 2020x + 2y = 2024z .
