Level 7 - Number Theory θ - Module Test
(Divisibility - Prime Numbers, Induction, GCD and LCM, Parity, Number Bases, Power of
Integers, Floor Function and Fractional Part, Digits of Numbers, Arithmetic Functions)
Total marks - 100
Math Olympiad Program
cheenta.com
June 23, 2024
1/8
Instructions
1. Please make sure that there are total 6 problems in this paper.
2. The Time limit for this exam is 1 hour and 30 minutes. Submissions after that will not be
evaluated.
3. Write your solution in an A4 sheet, scan it upstraight and upload the solutions page-wise
in the google classroom. Else the submission will not be evaluated. Skipping the essential
proofs will not get full credit.
4. Out of the total 6 problems, answering completely any 3 of them will give you full
marks for this paper. Only 3 problems will be evaluated, so there is no use of
answering more than 3 problems. The extra one mark will be given for good
presentation of the solution.
5. Do not attempt to search for the solutions online as you are proctored and all
solutions available online are available to us as well, so we would easily identify
you if you try to see solutions online. Those people will be directly removed from
this batch.
2/8
Problem 1
33 Marks
Find the number of prime triplets (p, q, r ) such that p(p + 1), q(q + 1), r (r + 1) form a strictly
increasing arithmetic progression, where GCD(r − p, 2p + 1) = 1.
3/8
Problem 2
33 Marks
Let d1 , d2 , . . . , dI be all positive divisors of a positive integer. For each i = 1, 2, . . . , I denote
by ai the number of divisors of di . Prove that
a13 + a23 + · · · + al3 = (a1 + a2 + · · · + al )2 .
4/8
Problem 3
33 Marks
Find all positive integers n, n ≥ 1, such that n2 + 3n is a perfect square.
5/8
Problem 4
33 Marks
Find the number of pairs of natural numbers (a, q) with the following properties
• q is a prime number
• a ≤ 2q
• aq−1 | (q − 1)a + 1
6/8
Problem 5
33 Marks
Prove that for GCD(p, q) = 1 where p, q ∈ N,
q−1 p−1
X kp X kq
=
q p
k=1 k=1
7/8
Problem 6
33 Marks
Determine, with proof, the smallest prime that does not divide any five-digit number whose
digits are in a strictly increasing order.
8/8
