Scribd
Upload
4 views2 pages

Number Theory Problem Set

This document contains a problem set in number theory with ten distinct problems, each requiring proofs or solutions related to integers, sequences, and properties of numbers. The problems range from arranging numbers in sequences to exploring properties of sums and products in mathematical structures. Each problem is designed to challenge the understanding of number theory concepts and requires logical reasoning and mathematical proof techniques.

Uploaded by

airteluser571
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views2 pages

Number Theory Problem Set

This document contains a problem set in number theory with ten distinct problems, each requiring proofs or solutions related to integers, sequences, and properties of numbers. The problems range from arranging numbers in sequences to exploring properties of sums and products in mathematical structures. Each problem is designed to challenge the understanding of number theory concepts and requires logical reasoning and mathematical proof techniques.

Uploaded by

airteluser571
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Number Theory Problem Set

rohitgayen53
January 2025

1 Problem 1
Prove that for every positive integer n ≥ 2 then there exist n distinct positive
integers a1 , a2 , ..., an such that ai − aj | ai + aj for all 1 ≤ i < j ≤ n.

2 Problem 2
Kolpona has the set of numbers 1, 2, 3, . . . , 2n . She will repeatedly pick three
integers a, b, c from this set such that a, b, c are pairwise co-prime to each other
and remove them from the set. If Kolpona performs all the operations optimally,
what will be the minimum number of integers left in the set after she is done?

3 Problem 3
The infinite sequence a1 , a2 , . . . is defined by a1 = 1 and, for each n ≥ 1,
the number an+1 is the smallest positive integer greater than an that has the
following property: for each k ∈ {1, 2, . . . , n}, the number an+1 + ak is not a
perfect square. Prove that, for all n, it holds that an ≤ (n − 1)2 + 1.

4 Problem 4
Write a positive integer in each cell of a 4×4 grid so that the 16 numbers written
are distinct, the sums of the four numbers in each of the four rows are equal
and the products of the four numbers in each of the four columns are equal.

5 Problem 5
On each face of a cube, a positive integer is written. To each vertex of the
cube, the product of the numbers on the three faces that meet at that vertex is
assigned. The sum of the 8 numbers assigned to the vertices is 315. Determine
all possible values of the sum of the numbers on the faces.

1
6 Problem 6
We define similar numbers as positive integers that have exactly the same digits
(but possibly in another order). For example, 1241, 2114 and 4211 are similar
numbers, but 1424 is not similar to the other three.
Determine whether there exist three similar numbers, each with 300 digits
(all digits being non-zero), such that the sum of any two of them equals the third.
If the answer is yes, provide an example; if not, justify why it is impossible.

7 Problem 7
Around a circle, 20 distinct positive integers are written. Alex divides each
number by its neighbor, moving clockwise around the circle, and records the
remainders obtained in each case. Teo performs a similar process but moves
counterclockwise around the circle and records the remainders he obtains. If
Alex finds only two distinct remainders among the 20 he records, determine the
number of distinct remainders Teo will record.

8 Problem 8
Let n be a positive integer. Prove that we can arrange n numbers 1, n numbers
2, n numbers 3,..., n numbers n into a sequence x1 , x2 , ..., x2n such that if xi =
xj ; then xi+1 ̸= xj+1 with xn2 +1 = x1

9 Problem 9
Find all positive integers k < 202 for which there exist a positive integers n such
that      
n 2n kn k
+ + ··· + =
202 202 202 2

10 Problem 10
Prove that there exists a real number ε > 0 such that there are infinitely many
sequences of integers 0 < a1 < a2 << a2025 satisfying

gcd(a21 + 1, a22 + 1, , a22025 + 1) > a1+ε


2025 .

You might also like