Scribd
Upload
51 views1 page

INMO Mock 1

The document contains 6 problems: 1. Determine the maximum value of a sum involving differences of real numbers whose squares sum to 1. 2. Prove that by repeatedly adding or subtracting 1 to contiguous blocks of integers on a blackboard, you can reach a state where at least n-2 numbers are divisible by 4. 3. Find all infinite sequences of natural numbers such that the greatest common divisor of any two terms depends only on their indices. 4. Prove there exists a number with at most 2022 digits that can be written as a sum of distinct natural numbers in over 10101000 ways. 5. Prove two angles are equal for a triangle inscribed in a circle

Uploaded by

Bhavin Desai
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
51 views1 page

INMO Mock 1

The document contains 6 problems: 1. Determine the maximum value of a sum involving differences of real numbers whose squares sum to 1. 2. Prove that by repeatedly adding or subtracting 1 to contiguous blocks of integers on a blackboard, you can reach a state where at least n-2 numbers are divisible by 4. 3. Find all infinite sequences of natural numbers such that the greatest common divisor of any two terms depends only on their indices. 4. Prove there exists a number with at most 2022 digits that can be written as a sum of distinct natural numbers in over 10101000 ways. 5. Prove two angles are equal for a triangle inscribed in a circle

Uploaded by

Bhavin Desai
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
You are on page 1/ 1

INMO Mock 1

Sophie Fellowship
March 17, 2023

1. Let a1 , a2 , · · · , an be real numbers such that a21 + a22 + · · · + a2n = 1. Determine, with proof
the maximum possible value of

|a1 − a2 | + |a2 − a3 | + · · · + |an−1 − an | + |an − a1 |

2. Let n be a positive integer. A list of n integers is written in a row on a blackboard.


You can choose a contiguous block of integers, and I will either add 1 to all of them
or subtract 1 from all of them. You can repeat this step as often as you like, possibly
adapting your selections based on what I do. Prove that after a finite number of steps,
you can reach a state where at least n − 2 of the numbers on the blackboard are all
simultaneously divisible by 4.

3. Find all infinite sequences of natural numbers a1 , a2 , · · · such that for all distinct i, j,

gcd(ai , aj ) = gcd(i, j)

4. Prove that there exists a number with at most 2022 digits such that it can be written
1000
as the sum of distinct natural numbers in at least 1010 ways. (1 + 2 + 4 and 4 + 1 + 2
are considered to be the same)

5. △ABC is inscribed in a circle with center O. Let P , Q be points on AB, AC such that
P Q passes through O. If M, N are the midpoints of BQ and CP , prove that ∠MON =
∠BAC.

6. Let f : N → N be a function such that for all positive integers m, n,

m | f (n) ⇐⇒ f (m) | n

Prove that f (n) and n have the same number of divisors.

You might also like