Olympiad problems

2016 Japan Mathematical Olympiad Preliminary, 9

How many pairs $(a, b)$ for integers $1 \le a, b \le 2015$ which satisfy that $a$ is divisible by $b + 1$ and $2016 - a$ is divisible by $b$.

2016 Japan Mathematical Olympiad Preliminary, 12

Tags: combinatorics , Japan

There are villager $0$, villager $1$, . . . , villager $2015$ i.e. $2016$ people in the village. You are villager $0$. Each villager is either honest or liar. You don’t know each villager is honest or liar, but you know you are honest and the number of liar is equal or smaller than integer $T$. The villagers became to write one letter without fail from one day. For integers $1 \le n \le 2015$, there are set integers $1 < k_n < 2015$. The letter villager $i$ wrote in day $n$ of the morning is delivered to villager $i + k_n$ if villager $i$ is honest, or villager $i - k_n$ if villager $i$ is liar in day $n$ of the evening. If $i - j$ is divisible by $2016$, villager $i$ and $j$ point same villager. Villagers don’t know $k_n$, but sender is told when letters are received. Villager can write anything on a letter, and each villager receives letters from any villagers a sufficient number of times after enough time. i.e. there are $n$ satisfying $k = k_n$ infinitely for each integer $1 \le k \le 2015$. You want to know the honest persons of this village. You can gather all villagers just once and instruct in one day of noon. The honest person obeys your instruction but the liar person not always obeys and he or she writes on a letter anything possible. One day from your instruction for a while, you could determine all honest persons of this village. Find the maximum value of $T$ such that it is possible to do this if you instruct appropriate regardless of the villagers who are honest or liar.

2016 Japan MO Preliminary, 8

Tags: Japan , geometry

Let $\omega$ be an incircle of triangle $ABC$. Let $D$ be a point on segment $BC$, which is tangent to $\omega$. Let $X$ be an intersection of $AD$ and $\omega$ against $D$. If $AX : XD : BC = 1 : 3 : 10$, a radius of $\omega$ is $1$, find the length of segment $XD$. Note that $YZ$ expresses the length of segment $YZ$.

2016 Japan MO Preliminary, 1

Tags: Japan , number theory , square roots

Calculate the value of $\sqrt{\dfrac{11^4+100^4+111^4}{2}}$ and answer in the form of an integer.

2016 Japan MO Preliminary, 5

Tags: Japan , geometry , congruent triangles

Let $ABCD$ be a quadrilateral with $AC=20$, $AD=16$. We take point $P$ on segment $CD$ so that triangle $ABP$ and $ACD$ are congruent. If the area of triangle $APD$ is $28$, find the area of triangle $BCP$. Note that $XY$ expresses the length of segment $XY$.

2016 Japan MO Preliminary, 9

Tags: number theory , Japan

How many pairs $(a, b)$ for integers $1 \le a, b \le 2015$ which satisfy that $a$ is divisible by $b + 1$ and $2016 - a$ is divisible by $b$.

2016 Japan MO Preliminary, 10

Tags: Japan , combinatorics , geometry

Boy A and $2016$ flags are on a circumference whose length is $1$ of a circle. He wants to get all flags by moving on the circumference. He can get all flags by moving distance $l$ regardless of the positions of boy A and flags. Find the possible minimum value as $l$ like this. Note that boy A doesn’t have to return to the starting point to leave gotten flags.

2016 Japan Mathematical Olympiad Preliminary, 7

Tags: Japan , algebra , system of equations

Let $a, b, c, d$ be real numbers satisfying the system of equation $\[(a+b)(c+d)=2 \\ (a+c)(b+d)=3 \\ (a+d)(b+c)=4\]$ Find the minimum value of $a^2+b^2+c^2+d^2$.

2016 Japan Mathematical Olympiad Preliminary, 2

Tags: Japan , number theory

For $1\leq n\leq 2016$, how many integers $n$ satisfying the condition: the reminder divided by $20$ is smaller than the one divided by $16$.

2016 Japan Mathematical Olympiad Preliminary, 11

Tags: Japan , number theory

How many pairs $(a, b)$ for integers $a, b \ge 2$ which exist the sequence $x_1, x_2, . . . , x_{1000}$ which satisfy conditions as below? 1.Terms $x_1, x_2, . . . , x_{1000}$ are sorting of $1, 2, . . . , 1000$. 2.For each integers $1 \le i < 1000$, the sequence forms $x_{i+1} = x_i + a$ or $x_{i+1} = x_i - b$.

2016 Japan MO Preliminary, 6

Tags: Japan , number theory , combinatorics , algebra

Integers $1 \le n \le 200$ are written on a blackboard just one by one. We surrounded just $100$ integers with circle. We call a square of the sum of surrounded integers minus the sum of not surrounded integers $score$ of this situation. Calculate the average score in all ways.

2016 Japan MO Preliminary, 7

Tags: Japan , algebra , system of equations

Let $a, b, c, d$ be real numbers satisfying the system of equation $\[(a+b)(c+d)=2 \\ (a+c)(b+d)=3 \\ (a+d)(b+c)=4\]$ Find the minimum value of $a^2+b^2+c^2+d^2$.

2016 Japan MO Preliminary, 12

Tags: combinatorics , Japan

There are villager $0$, villager $1$, . . . , villager $2015$ i.e. $2016$ people in the village. You are villager $0$. Each villager is either honest or liar. You don’t know each villager is honest or liar, but you know you are honest and the number of liar is equal or smaller than integer $T$. The villagers became to write one letter without fail from one day. For integers $1 \le n \le 2015$, there are set integers $1 < k_n < 2015$. The letter villager $i$ wrote in day $n$ of the morning is delivered to villager $i + k_n$ if villager $i$ is honest, or villager $i - k_n$ if villager $i$ is liar in day $n$ of the evening. If $i - j$ is divisible by $2016$, villager $i$ and $j$ point same villager. Villagers don’t know $k_n$, but sender is told when letters are received. Villager can write anything on a letter, and each villager receives letters from any villagers a sufficient number of times after enough time. i.e. there are $n$ satisfying $k = k_n$ infinitely for each integer $1 \le k \le 2015$. You want to know the honest persons of this village. You can gather all villagers just once and instruct in one day of noon. The honest person obeys your instruction but the liar person not always obeys and he or she writes on a letter anything possible. One day from your instruction for a while, you could determine all honest persons of this village. Find the maximum value of $T$ such that it is possible to do this if you instruct appropriate regardless of the villagers who are honest or liar.

2005 Germany Team Selection Test, 2

Tags: inequalities , function , 3-variable inequality , Nesbitt , Germany , Japan

If $a$, $b$, $c$ are positive reals such that $a+b+c=1$, prove that \[\frac{1+a}{1-a}+\frac{1+b}{1-b}+\frac{1+c}{1-c}\leq 2\left(\frac{b}{a}+\frac{c}{b}+\frac{a}{c}\right).\]

2016 Japan Mathematical Olympiad Preliminary, 5

Tags: Japan , geometry , congruent triangles

Let $ABCD$ be a quadrilateral with $AC=20$, $AD=16$. We take point $P$ on segment $CD$ so that triangle $ABP$ and $ACD$ are congruent. If the area of triangle $APD$ is $28$, find the area of triangle $BCP$. Note that $XY$ expresses the length of segment $XY$.

2005 Germany Team Selection Test, 2

Tags: inequalities , function , 3-variable inequality , Nesbitt , Germany , Japan

If $a$, $b$, $c$ are positive reals such that $a+b+c=1$, prove that \[\frac{1+a}{1-a}+\frac{1+b}{1-b}+\frac{1+c}{1-c}\leq 2\left(\frac{b}{a}+\frac{c}{b}+\frac{a}{c}\right).\]

2016 Japan MO Preliminary, 2

Tags: Japan , number theory

For $1\leq n\leq 2016$, how many integers $n$ satisfying the condition: the reminder divided by $20$ is smaller than the one divided by $16$.

2016 Japan Mathematical Olympiad Preliminary, 10

Tags: Japan , combinatorics , geometry

Boy A and $2016$ flags are on a circumference whose length is $1$ of a circle. He wants to get all flags by moving on the circumference. He can get all flags by moving distance $l$ regardless of the positions of boy A and flags. Find the possible minimum value as $l$ like this. Note that boy A doesn’t have to return to the starting point to leave gotten flags.

2016 Japan MO Preliminary, 11

Tags: Japan , number theory

How many pairs $(a, b)$ for integers $a, b \ge 2$ which exist the sequence $x_1, x_2, . . . , x_{1000}$ which satisfy conditions as below? 1.Terms $x_1, x_2, . . . , x_{1000}$ are sorting of $1, 2, . . . , 1000$. 2.For each integers $1 \le i < 1000$, the sequence forms $x_{i+1} = x_i + a$ or $x_{i+1} = x_i - b$.

2016 Japan Mathematical Olympiad Preliminary, 8

Tags: Japan , geometry

Let $\omega$ be an incircle of triangle $ABC$. Let $D$ be a point on segment $BC$, which is tangent to $\omega$. Let $X$ be an intersection of $AD$ and $\omega$ against $D$. If $AX : XD : BC = 1 : 3 : 10$, a radius of $\omega$ is $1$, find the length of segment $XD$. Note that $YZ$ expresses the length of segment $YZ$.

2016 Japan Mathematical Olympiad Preliminary, 6

Tags: Japan , number theory , combinatorics , algebra

Integers $1 \le n \le 200$ are written on a blackboard just one by one. We surrounded just $100$ integers with circle. We call a square of the sum of surrounded integers minus the sum of not surrounded integers $score$ of this situation. Calculate the average score in all ways.

2016 Japan Mathematical Olympiad Preliminary, 1

Tags: Japan , number theory , square roots

Calculate the value of $\sqrt{\dfrac{11^4+100^4+111^4}{2}}$ and answer in the form of an integer.