Find all functions $f:\mathbb{Z}^{+} \rightarrow \mathbb{Z}^{+}$ such that the conditions $\quad a) \quad a-b \mid f(a)-f(b)$ for all $a\neq b$ and $a,b \in \mathbb{Z}^{+}$ $\quad b) \quad f(\varphi(a))=\varphi(f(a))$ for all $a \in \mathbb{Z}^{+}$ where $\varphi$ is the Euler's totient function. holds

Let $ AB$ be the diameter of semicircle $O$ , $C, D $ be points on the arc $AB$, $P, Q$ be respectively the circumcenter of $\triangle OAC $ and $\triangle OBD $ . Prove that:$CP\cdot CQ=DP \cdot DQ$.[asy] import cse5; import olympiad; unitsize(3.5cm); dotfactor=4; pathpen=black; real h=sqrt(55/64); pair A=(-1,0), O=origin, B=(1,0),C=shift(-3/8,h)*O,D=shift(4/5,3/5)*O,P=circumcenter(O,A,C), Q=circumcenter(O,D,B); D(arc(O,1,0,180),darkgreen); D(MP("A",A,W)--MP("C",C,N)--MP("P",P,SE)--MP("D",D,E)--MP("Q",Q,E)--C--MP("O",O,S)--D--MP("B",B,E)--cycle,deepblue); D(O); [/asy]

Let $A$ be a set of $N$ residues $\pmod{N^2}$. Prove that there exists a set $B$ of $N$ residues $\pmod{N^2}$ such that the set $A+B=\{a+b \vert a \in A, b \in B \}$ contains at least half of all the residues $\pmod{N^2}$.

Find all he positive integers $x, y, z, t, w$, such as: $x+\frac{1}{y+\frac{1}{z+\frac{1}{t+\frac{1}{w}}}}=\frac{1998}{115}$

Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that, for all real numbers $x$ and $y$ satisfy, $$f\left(x+yf(x+y)\right)=y^2+f(x)f(y)$$ [i]Proposed by Dorlir Ahmeti, Kosovo[/i]

Consider a triangle $ABC$. The tangent line to its circumcircle at point $C$ meets line $AB$ at point $D$. The tangent lines to the circumcircle of triangle $ACD$ at points $A$ and $C$ meet at point $K$. Prove that line $DK$ bisects segment $BC$. (F.Ivlev)

For $n$ measured in degrees, let $T(n) = \cos^2(30^\circ -n) - \cos(30^\circ -n)\cos(30^\circ +n) +\cos^2(30^\circ +n)$. Evaluate $$ 4\sum^{30}_{n=1} n \cdot T(n).$$

If $r$ is a number such that $r^2-6r+5=0$, find $(r-3)^2$

Let $n$ be a positive integer. Given is a subset $A$ of $\{0,1,...,5^n\}$ with $4n+2$ elements. Prove that there exist three elements $a<b<c$ from $A$ such that $c+2a>3b$. [i]Proposed by Dominik Burek and Tomasz Ciesla, Poland[/i]

What is the largest possible value of the expression $$gcd \,\,\, (n^2 + 3, (n + 1)^2 + 3 )$$ for naturals $n$? [hide]original wording]Kāda ir izteiksmes LKD (n2 + 3, (n + 1)2 + 3) lielākā iespējamā vērtība naturāliem n? [/hide]

Let $ f (n) $ be a function that fulfills the following properties: $\bullet$ For each natural $ n $, $ f (n) $ is an integer greater than or equal to $ 0 $. $\bullet$ $f (n) = 2010 $, if $ n $ ends in $ 7 $. For example, $ f (137) = 2010 $. $\bullet$ If $ a $ is a divisor of $ b $, then: $ f \left(\frac {b} {a} \right) = | f (b) -f (a) | $. Find $ \displaystyle f (2009 ^ {2009 ^ {2009}}) $ and justify your answer.

On a blank piece of paper, two points with distance $1$ is given. Prove that one can use (only) straightedge and compass to construct on this paper a straight line, and two points on it whose distance is $\sqrt{2021}$ such that, in the process of constructing it, the total number of circles or straight lines drawn is at most $10.$ Remark: Explicit steps of the construction should be given. Label the circles and straight lines in the order that they appear. Partial credit may be awarded depending on the total number of circles/lines.

Kongol rolls two fair 6-sided die. The probability that one roll is a divisor of the other can be expressed as $\frac{p}{q}$. Determine $p+q$. [i]2022 CCA Math Bonanza Lightning Round 3.1[/i]

Arnaldo selects a nonnegative integer $a$ and Bernaldo selects a nonnegative integer $b$. Both of them secretly tell their number to Cernaldo, who writes the numbers $5$, $8$, and $15$ on the board, one of them being the sum $a+b$. Cernaldo rings a bell and Arnaldo and Bernaldo, individually, write on different slips of paper whether they know or not which of the numbers on the board is the sum $a+b$ and they turn them in to Cernaldo. If both of the papers say NO, Cernaldo rings the bell again and the process is repeated. It is known that both Arnaldo and Bernaldo are honest and intelligent. What is the maximum number of times that the bell can be rung until one of them knows the sum? Personal note: They really phoned it in with the names there…

Given are the non zero natural numbers $a,b,c$ such that the number $\frac{a\sqrt2+b\sqrt3}{b\sqrt2+c\sqrt3}$ is rational. Prove that the number $\frac{a^2+b^2+c^2}{a+b+c}$ is an integer .

Determine the smallest integer $n \ge 4$ for which one can choose four different numbers $a, b, c, $ and $d$ from any $n$ distinct integers such that $a+b-c-d$ is divisible by $20$ .

A point $P$ is given inside an acute-angled triangle $ABC$. Let $A',B',C'$ be the orthogonal projections of $P$ on sides $BC, CA, AB$ respectively. Determine the locus of points $P$ for which $\angle BAC = \angle B'A'C'$ and $\angle CBA = \angle C'B'A'$

Express $2.3\overline{57}$ as a common fraction. [i]2017 CCA Math Bonanza Lightning Round #3.1[/i]

Determine the set of all real numbers $p$ for which the polynomial $Q(x) = x^3 + px^2 - px - 1$ has three distinct real roots.

Let $ n$ be a positive integer. Consider a rectangle $ (90n\plus{}1)\times(90n\plus{}5)$ consisting of unit squares. Let $ S$ be the set of the vertices of these squares. Prove that the number of distinct lines passing through at least two points of $ S$ is divisible by $ 4$.

For any set $A=\{a_1,a_2,\cdots,a_m\}$, let $P(A)=a_1a_2\cdots a_m$. Let $n={2010\choose99}$, and let $A_1, A_2,\cdots,A_n$ be all $99$-element subsets of $\{1,2,\cdots,2010\}$. Prove that $2010|\sum^{n}_{i=1}P(A_i)$.

Let $ABCD$ be a square and let $M$ be the midpoint of $BC$. Let $C ^ \prime$ be the reflection of $C$ wrt to $DM$. The parallel to $AB$ passing through $C ^ \prime$ intersects $AD$ at $R$ and $BC$ at $S$. Show that $$\frac {RC ^ \prime} {C ^\prime S} = \frac {3} {2}$$

Specify at least one right triangle $ABC$ with integer sides, inside which you can specify a point $M$ such that the lengths of the segments $MA, MB, MC$ are integers. Are there many such triangles, none of which are are similar?

find the smallest integer $n\geq1$ such that the equation : $$a^2+b^2+c^2-nd^2=0 $$ has $(0,0,0,0)$ as unique solution .

Let $ABCD$ be a square with side length $5$, and let $E$ be the midpoint of $CD$. Let $F$ be the point on $AE$ such that $CF=5$. Compute $AF$.