For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$

Determine the smallest positive integer $k$ so that the equation $$2002x+273y=200201+k$$ has integer solutions, and for that value of $k$, find the number of solutions $\left (x,y\right )$ with $x$, $y$ positive integers that have the equation.

Cut a right triangle with an angle of $30^o$ into three isosceles non-acute triangles, among which there are no congruent ones. (Maria Rozhkova)

Solve the system of equations \[ |a_1-a_2|x_2+|a_1-a_3|x_3+|a_1-a_4|x_4=1 \] \[ |a_2-a_1|x_1+|a_2-a_3|x_3+|a_2-a_4|x_4=1 \] \[ |a_3-a_1|x_1+|a_3-a_2|x_2+|a_3-a_4|x_4=1 \] \[ |a_4-a_1|x_1+|a_4-a_2|x_2+|a_4-a_3|x_3=1 \] where $a_1, a_2, a_3, a_4$ are four different real numbers.

On a table there are several cards, some face up and others face down. The allowed operation is to choose 4 cards and turn them over. The goal is to get all the cards in the same state (all face up or all face down). Determine if the objective can be achieved through a sequence of permitted operations if initially there are: a) 101 cards face up and 102 face down; b) 101 cards face up and 101 face down.

Let $n$ be an odd positive integer with $n > 1$ and let $a_1, a_2,... , a_n$ be positive integers such that gcd $(a_1, a_2,... , a_n) = 1$. Let $d$ = gcd $(a_1^n + a_1\cdot a_2 \cdot \cdot \cdot a_n, a_2^n + a_1\cdot a_2 \cdot \cdot \cdot a_n, ... , a_n^n + a_1\cdot a_2 \cdot \cdot \cdot a_n)$. Show that the possible values of $d$ are $d = 1, d = 2$

Prove that, if a continuous function has limits at $ \pm\infty , $ and these are equal, then it touches its maximum or minimum at one point.

If $A\in \mathcal{M}_2(\mathbb{R})$, prove that: \[\det(A^2+A+I_2)\ge \frac{3}{4}(1-\det A)^2\]

In a triangle $\triangle ABC$ with $\angle ABC < \angle BCA$, we define $K$ as the excenter with respect to $A$. The lines $AK$ and $BC$ intersect in a point $D$. Let $E$ be the circumcenter of $\triangle BKC$. Prove that \[\frac{1}{|KA|} = \frac{1}{|KD|} + \frac{1}{|KE|}.\]

The intersection of a cube and a plane is a pentagon. Prove the length of at least oneside of the pentagon differs from 1 metre by at least 20 centimetres.

Players A and B play a game. They are given a box with $n=>1$ candies. A starts first. On a move, if in the box there are $k$ candies, the player chooses positive integer $l$ so that $l<=k$ and $(l, k) =1$, and eats $l$ candies from the box. The player who eats the last candy wins. Who has winning strategy, in terms of $n$.

For each vertex of a given tetrahedron, a sphere passing through that vertex and the midpoints of the edges outgoing from this vertex is constructed. Prove that these four spheres pass through a single point.

Source: 2017 Canadian Open Math Challenge, Problem C1 ----- For a positive integer $n$, we define function $P(n)$ to be the sum of the digits of $n$ plus the number of digits of $n$. For example, $P(45) = 4 + 5 + 2 = 11$. (Note that the first digit of $n$ reading from left to right, cannot be $0$). $\qquad$(a) Determine $P(2017)$. $\qquad$(b) Determine all numbers $n$ such that $P(n) = 4$. $\qquad$(c) Determine with an explanation whether there exists a number $n$ for which $P(n) - P(n + 1) > 50$.

There are forty weights: $1, 2, \cdots , 40$ grams. Ten weights with even masses were put on the left pan of a balance. Ten weights with odd masses were put on the right pan of the balance. The left and the right pans are balanced. Prove that one pan contains two weights whose masses differ by exactly $20$ grams. [i](4 points)[/i]

Let $n$ be a positive integer. Show that \[\sum^{n}_{k=1}\tan^{2}\frac{k \pi}{2n+1}\] is an odd integer.

Let $ K$ be a subset of a group $ G$ that is not a union of lift cosets of a proper subgroup. Prove that if $ G$ is a torsion group or if $ K$ is a finite set, then the subset \[ \bigcap _{k \in K} k^{-1}K\] consists of the identity alone. [i]L. Redei[/i]

In a one-round football tournament, three points were awarded for a victory. All the teams scored different numbers of points. If not three, but two points were given for a victory, then all teams would also have a different number of points, but each team's place would be different. What is the smallest number of teams for which this is possible? [i]Proposed by A. Zaslavsky[/i]

Let $S$ be a nonempty set of positive integers. We say that a positive integer $n$ is [i]clean[/i] if it has a unique representation as a sum of an odd number of distinct elements from $S$. Prove that there exist infinitely many positive integers that are not clean.

[b]2A. [/b] Two triangles $ABC$ and $ABD$ share a common side. $ABC$ is drawn such that its entire area lies inside the larger triangle $ABD$. If $AB = 20$, side $AD$ meets side $AB$ at a right angle, and point $C$ is between points $A$ and $D$, then find the area outside of triangle $ABC$ but within $ABD$, given that both triangles have integral side lengths and $AB$ is the smallest side of either triangle. $ABC$ and $ABD$ are both primitive right triangles. [i] (1 point)[/i] [b]2B.[/b] Find the sum of all positive integral factors of the correct answer to [b]2A[/b]. [i](2 points)[/i] [b]2C.[/b] Let $B$ be the sum of the digits of the correct answer to [b]2B[/b] above. If the solution to the functional equation $21*f(x) - 7*f(1/x) = Bx$ is of the form $(Ax^2 + C) / Dx$, find $C$, given that $A$, $C$, and $D$ are relatively prime (they don’t share a common prime factor). [i](3 points)[/i] [hide=ANSWER KEY]2A.780 2B. 2352 2C. 3[/hide]

$\triangle ABC$ has the property that $\angle ACB = 90^{\circ}$. Let $D$ and $E$ be points on $AB$ such that $D$ is on ray $BA$, $E$ is on segment $AB$, and $\angle DCA = \angle ACE$. Let the circumcircle of $\triangle CDE$ hit $BC$ at $F \ne C$, and $EF$ hit $AC$ and $DC$ at $P$ and $Q$, respectively. If $EP = FQ$, then the ratio $\frac{EF}{PQ}$ can be written as $a+\sqrt{b}$ where $a$ and $b$ are positive integers. Find $a+b$. [i]Proposed by Kevin Zhao[/i]

If $ p$ and $ q$ are primes and $ x^2 \minus{} px \plus{} q \equal{} 0$ has distinct positive integral roots, then which of the following statements are true? $ \text{I. The difference of the roots is odd.}$ $ \text{II. At least one root is prime.}$ $ \text{III. } p^2 \minus{} q \text{ is prime.}$ $ \text{IV. } p \plus{} q \text{ is prime.}$ $ \textbf{(A)}\ \text{I only} \qquad \textbf{(B)}\ \text{II only} \qquad \textbf{(C)}\ \text{II and III only} \qquad$ $ \textbf{(D)}\ \text{I, II and IV only} \qquad \textbf{(E)}\ \text{All are true.}$

Some club has 42 members. It’s known that among 31 arbitrary club members, we can find one pair of a boy and a girl that they know each other. Show that from club members we can choose 12 pairs of knowing each other boys and girls.

(a) $n$ is a natural number. $d_1,\dots,d_n,r_1,\dots ,r_n$ are natural numbers such that for each $i,j$ that $1\leq i < j \leq n$ we have $(d_i,d_j)=1$ and $d_i\geq 2$. Prove that there exist an $x$ such that (i) $1 \leq x \leq 3^n$ (ii)For each $1 \leq i \leq n$ \[x \overset{d_i}{\not{\equiv}} r_i\] (b) For each $\epsilon >0$ prove that there exists natural $N$ such that for each $n>N$ and each $d_1,\dots,d_n,r_1,\dots ,r_n$ satisfying the conditions above there exists an $x$ satisfying (ii) such that $1\leq x \leq (2+\epsilon )^n$. Time allowed for this exam was 75 minutes.

Given triangle $ABC$ in the plane such that $\angle CAB = a > \pi/2$. Let $PQ$ be a segment whose midpoint is the point $A$. Prove that $(BP+CQ) \tan a/2 \geq BC$.

Show that for any vectors $a, b$ in Euclidean space, \[|a \times b|^3 \leq \frac{3 \sqrt 3}{8} |a|^2 |b|^2 |a-b|^2\] Remark. Here $\times$ denotes the vector product.