Found problems: 83
2017 Iran Team Selection Test, 2
Find the largest number $n$ that for which there exists $n$ positive integers such that non of them divides another one, but between every three of them, one divides the sum of the other two.
[i]Proposed by Morteza Saghafian[/i]
2019 Iran Team Selection Test, 2
In a triangle $ABC$, $\angle A$ is $60^\circ$. On sides $AB$ and $AC$ we make two equilateral triangles (outside the triangle $ABC$) $ABK$ and $ACL$. $CK$ and $AB$ intersect at $S$ , $AC$ and $BL$ intersect at $R$ , $BL$ and $CK$ intersect at $T$. Prove the radical centre of circumcircle of triangles $BSK, CLR$ and $BTC$ is on the median of vertex $A$ in triangle $ABC$.
[i]Proposed by Ali Zamani[/i]
2017 Iran Team Selection Test, 4
A $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ where $h_i\left(x_1,x_2, \cdots , x_n\right)$ are $n$ variable polynomials with real coefficients is called [i]good[/i] if the following condition holds:
For any $n$ functions $f_1,f_2, \cdots ,f_n : \mathbb R \to \mathbb R$ if for all $1 \le i \le n+1$, $P_i(x)=h_i \left(f_1(x),f_2(x), \cdots, f_n(x) \right)$ is a polynomial with variable $x$, then $f_1(x),f_2(x), \cdots, f_n(x)$ are polynomials.
$a)$ Prove that for all positive integers $n$, there exists a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that the degree of all $h_i$ is more than $1$.
$b)$ Prove that there doesn't exist any integer $n>1$ that for which there is a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that all $h_i$ are symmetric polynomials.
[i]Proposed by Alireza Shavali[/i]
2018 Iran Team Selection Test, 4
We say distinct positive integers $a_1,a_2,\ldots ,a_n $ are "good" if their sum is equal to the sum of all pairwise $\gcd $'s among them. Prove that there are infinitely many $n$ s such that $n$ good numbers exist.
[i]Proposed by Morteza Saghafian[/i]
2017 Iran Team Selection Test, 6
Let $k>1$ be an integer. The sequence $a_1,a_2, \cdots$ is defined as:
$a_1=1, a_2=k$ and for all $n>1$ we have: $a_{n+1}-(k+1)a_n+a_{n-1}=0$
Find all positive integers $n$ such that $a_n$ is a power of $k$.
[i]Proposed by Amirhossein Pooya[/i]
2019 Iran Team Selection Test, 2
$a, a_1,a_2,\dots ,a_n$ are natural numbers. We know that for any natural number $k$ which $ak+1$ is square, at least one of $a_1k+1,\dots ,a_n k+1$ is also square.
Prove $a$ is one of $a_1,\dots ,a_n$
[i]Proposed by Mohsen Jamali[/i]
2017 Iran Team Selection Test, 5
$k,n$ are two arbitrary positive integers. Prove that there exists at least $(k-1)(n-k+1)$ positive integers that can be produced by $n$ number of $k$'s and using only $+,-,\times, \div$ operations and adding parentheses between them, but cannot be produced using $n-1$ number of $k$'s.
[i]Proposed by Aryan Tajmir[/i]
2017 Iran Team Selection Test, 6
In the unit squares of a transparent $1 \times 100$ tape, numbers $1,2,\cdots,100$ are written in the ascending order.We fold this tape on it's lines with arbitrary order and arbitrary directions until we reach a $1 \times1$ tape with $100$ layers.A permutation of the numbers $1,2,\cdots,100$ can be seen on the tape, from the top to the bottom.
Prove that the number of possible permutations is between $2^{100}$ and $4^{100}$.
([i]e.g.[/i] We can produce all permutations of numbers $1,2,3$ with a $1\times3$ tape)
[i]Proposed by Morteza Saghafian[/i]
2018 Iran Team Selection Test, 2
Mojtaba and Hooman are playing a game. Initially Mojtaba draws $2018$ vectors with zero sum. Then in each turn, starting with Mojtaba, the player takes a vector and puts it on the plane. After the first move, the players must put their vector next to the previous vector (the beginning of the vector must lie on the end of the previous vector).
At last, there will be a closed polygon. If this polygon is not self-intersecting, Mojtaba wins. Otherwise Hooman. Who has the winning strategy?
[i]Proposed by Mahyar Sefidgaran, Jafar Namdar [/i]
2020 Iran Team Selection Test, 3
We call a number $n$ [i]interesting [/i]if for each permutation $\sigma$ of $1,2,\ldots,n$ there exist polynomials $P_1,P_2,\ldots ,P_n$ and $\epsilon > 0$ such that:
$i)$ $P_1(0)=P_2(0)=\ldots =P_n(0)$
$ii)$ $P_1(x)>P_2(x)>\ldots >P_n(x)$ for $-\epsilon<x<0$
$iii)$ $P_{\sigma (1)} (x)>P_{\sigma (2)}(x)> \ldots >P_{\sigma (n)} (x) $ for $0<x<\epsilon$
Find all [i]interesting [/i]$n$.
[i]Proposed by Mojtaba Zare Bidaki[/i]
Russian TST 2018, P2
Mojtaba and Hooman are playing a game. Initially Mojtaba draws $2018$ vectors with zero sum. Then in each turn, starting with Mojtaba, the player takes a vector and puts it on the plane. After the first move, the players must put their vector next to the previous vector (the beginning of the vector must lie on the end of the previous vector).
At last, there will be a closed polygon. If this polygon is not self-intersecting, Mojtaba wins. Otherwise Hooman. Who has the winning strategy?
[i]Proposed by Mahyar Sefidgaran, Jafar Namdar [/i]
2018 Iran Team Selection Test, 2
Find the maximum possible value of $k$ for which there exist distinct reals $x_1,x_2,\ldots ,x_k $ greater than $1$ such that for all $1 \leq i, j \leq k$,
$$x_i^{\lfloor x_j \rfloor }= x_j^{\lfloor x_i\rfloor}.$$
[i]Proposed by Morteza Saghafian[/i]
2018 Iran Team Selection Test, 1
Let $A_1, A_2, ... , A_k$ be the subsets of $\left\{1,2,3,...,n\right\}$ such that for all $1\leq i,j\leq k$:$A_i\cap A_j \neq \varnothing$. Prove that there are $n$ distinct positive integers $x_1,x_2,...,x_n$ such that for each $1\leq j\leq k$:
$$lcm_{i \in A_j}\left\{x_i\right\}>lcm_{i \notin A_j}\left\{x_i\right\}$$
[i]Proposed by Morteza Saghafian, Mahyar Sefidgaran[/i]
2020 Iran Team Selection Test, 1
A weighted complete graph with distinct positive wights is given such that in every triangle is [i]degenerate [/i] that is wight of an edge is equal to sum of two other. Prove that one can assign values to the vertexes of this graph such that the wight of each edge is the difference between two assigned values of the endpoints.
[i]Proposed by Morteza Saghafian [/i]
2018 Iran Team Selection Test, 6
Consider quadrilateral $ABCD $ inscribed in circle $\omega $. $P\equiv AC\cap BD$. $E$, $F$ lie on sides $AB$, $CD$ respectively such that $\hat {APE}=\hat {DPF} $. Circles $\omega_1$, $\omega_2$ are tangent to $\omega$ at $X $, $Y $ respectively and also both tangent to the circumcircle of $\triangle PEF $ at $P $. Prove that: $$\frac {EX}{EY}=\frac {FX}{FY} $$
[i]Proposed by Ali Zamani [/i]
2017 Iran Team Selection Test, 4
A $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ where $h_i\left(x_1,x_2, \cdots , x_n\right)$ are $n$ variable polynomials with real coefficients is called [i]good[/i] if the following condition holds:
For any $n$ functions $f_1,f_2, \cdots ,f_n : \mathbb R \to \mathbb R$ if for all $1 \le i \le n+1$, $P_i(x)=h_i \left(f_1(x),f_2(x), \cdots, f_n(x) \right)$ is a polynomial with variable $x$, then $f_1(x),f_2(x), \cdots, f_n(x)$ are polynomials.
$a)$ Prove that for all positive integers $n$, there exists a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that the degree of all $h_i$ is more than $1$.
$b)$ Prove that there doesn't exist any integer $n>1$ that for which there is a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that all $h_i$ are symmetric polynomials.
[i]Proposed by Alireza Shavali[/i]
2020 Iran Team Selection Test, 4
Given a function $g:[0,1] \to \mathbb{R}$ satisfying the property that for every non empty dissection of the trivial $[0,1]$ to subsets $A,B$ we have either $\exists x \in A; g(x) \in B$ or $\exists x \in B; g(x) \in A$ and we have furthermore $g(x)>x$ for $x \in [0,1]$. Prove that there exist infinite $x \in [0,1]$ with $g(x)=1$.
[i]Proposed by Ali Zamani [/i]
2013 Iran Team Selection Test, 6
Points $A, B, C$ and $D$ lie on line $l$ in this order. Two circular arcs $C_1$ and $C_2$, which both lie on one side of line $l$, pass through points $A$ and $B$ and two circular arcs $C_3$ and $C_4$ pass through points $C$ and $D$ such that $C_1$ is tangent to $C_3$ and $C_2$ is tangent to $C_4$. Prove that the common external tangent of $C_2$ and $C_3$ and the common external tangent of $C_1$ and $C_4$ meet each other on line $l$.
[i]Proposed by Ali Khezeli[/i]
2018 Iran Team Selection Test, 1
Two circles $\omega_1(O)$ and $\omega_2$ intersect each other at $A,B$ ,and $O$ lies on $\omega_2$. Let $S$ be a point on $AB$ such that $OS\perp AB$. Line $OS$ intersects $\omega_2$ at $P$ (other than $O$). The bisector of $\hat{ASP}$ intersects $\omega_1$ at $L$ ($A$ and $L$ are on the same side of the line $OP$). Let $K$ be a point on $\omega_2$ such that $PS=PK$ ($A$ and $K$ are on the same side of the line $OP$). Prove that $SL=KL$.
[i]Proposed by Ali Zamani [/i]
2020 Iran Team Selection Test, 5
Given $k \in \mathbb{Z}$ prove that there exist infinite pairs of distinct natural numbers such that
\begin{align*}
n+s(2n)=m+s(2m) \\
kn+s(n^2)=km+s(m^2).
\end{align*}
($s(n)$ denotes the sum of digits of $n$.)
[i]Proposed by Mohammadamin Sharifi[/i]
2017 Iran Team Selection Test, 4
We arranged all the prime numbers in the ascending order: $p_1=2<p_2<p_3<\cdots$.
Also assume that $n_1<n_2<\cdots$ is a sequence of positive integers that for all $i=1,2,3,\cdots$ the equation $x^{n_i} \equiv 2 \pmod {p_i}$ has a solution for $x$.
Is there always a number $x$ that satisfies all the equations?
[i]Proposed by Mahyar Sefidgaran , Yahya Motevasel[/i]
2020 Iran Team Selection Test, 3
We call a number $n$ [i]interesting [/i]if for each permutation $\sigma$ of $1,2,\ldots,n$ there exist polynomials $P_1,P_2,\ldots ,P_n$ and $\epsilon > 0$ such that:
$i)$ $P_1(0)=P_2(0)=\ldots =P_n(0)$
$ii)$ $P_1(x)>P_2(x)>\ldots >P_n(x)$ for $-\epsilon<x<0$
$iii)$ $P_{\sigma (1)} (x)>P_{\sigma (2)}(x)> \ldots >P_{\sigma (n)} (x) $ for $0<x<\epsilon$
Find all [i]interesting [/i]$n$.
[i]Proposed by Mojtaba Zare Bidaki[/i]
2018 Iran Team Selection Test, 6
$a_1,a_2,\ldots,a_n$ is a sequence of positive integers that has at least $\frac {2n}{3}+1$ distinct numbers and each positive integer has occurred at most three times in it. Prove that there exists a permutation $b_1,b_2,\ldots,b_n$ of $a_i $'s such that all the $n$ sums $b_i+b_{i+1}$ are distinct ($1\le i\le n $ , $b_{n+1}\equiv b_1 $)
[i]Proposed by Mohsen Jamali[/i]
2018 Iran Team Selection Test, 5
$2n-1$ distinct positive real numbers with sum $S $ are given. Prove that there are at least $\binom {2n-2}{n-1}$ different ways to choose $n $ numbers among them such that their sum is at least $\frac {S}{2}$.
[i]Proposed by Amirhossein Gorzi[/i]
2018 Iran Team Selection Test, 3
$n>1$ and distinct positive integers $a_1,a_2,\ldots,a_{n+1}$ are given. Does there exist a polynomial $p(x)\in\Bbb{Z}[x]$ of degree $\le n$ that satisfies the following conditions?
a. $\forall_{1\le i < j\le n+1}: \gcd(p(a_i),p(a_j))>1 $
b. $\forall_{1\le i < j < k\le n+1}: \gcd(p(a_i),p(a_j),p(a_k))=1 $
[i]Proposed by Mojtaba Zare[/i]