Given \(n \in \mathbb{N}\), let \(\sigma (n)\) denote the sum of the divisors of \(n\) and \(\phi (n)\) denote the number of integers \(n \geq m\) for which \(\gcd(m,n) = 1\). Show that for all \(n \in \mathbb{N}\), \[\large \frac{1}{\sigma (n)} + \frac{1}{\phi (n)} \geq \frac{2}{n}\] and determine when equality holds.

Juan and Pedro play alternately on the given grid. Each one in turn traces $1$ to $5$ routes different from the ones outlined above, that join $A$ with $B$, moving only to the right and upwards on the grid lines. Juan starts playing. The one who traces a route that passes through $C$ or $D$ loses. Prove that one of them can win regardless of how the other plays. [img]https://cdn.artofproblemsolving.com/attachments/2/7/6a24ca9c4c1c710bd41e44bfcab3d3b61b6d4f.png[/img]

What is the smallest possible perimeter of a triangle with integer coordinate vertices, area $\frac12$, and no side parallel to an axis?

A math contest consists of $9$ objective type questions and $6$ fill in the blanks questions. From a school some number of students took the test and it was noticed that all students had attempted exactly $14$ out of $15$ questions. Let $O_1, O_2, \dots , O_9$ be the nine objective questions and $F_1, F_2, \dots , F_6$ be the six fill inthe blanks questions. Let $a_{ij}$ be the number of students who attemoted both questions $O_i$ and $F_j$. If the sum of all the $a_{ij}$ for $i=1, 2,\dots , 9$ and $j=1, 2,\dots , 6$ is $972$, then find the number of students who took the test in the school.

Find all functions such that $ f: \mathbb{R}^\plus{} \rightarrow \mathbb{R}^\plus{}$ and $ f(x\plus{}f(y))\equal{}yf(xy\plus{}1)$ for every $ x,y\in \mathbb{R}^\plus{}$.

[i]Nyihaha[/i] and [i]Bruhaha[/i] are two neighbouring islands, both having $n$ inhabitants. On island [i]Nyihaha[/i] every inhabitant is either a Knight or a Knave. Knights always tell the truth and Knaves always lie. The inhabitants of island [i]Bruhaha[/i] are normal people, who can choose to tell the truth or lie. When a visitor arrives on any of the two islands, the following ritual is performed: every inhabitant points randomly to another inhabitant (indepently from each other with uniform distribution), and tells "He is a Knight" or "He is a Knave'". On sland [i]Nyihaha[/i], Knights have to tell the truth and Knaves have to lie. On island [i]Bruhaha[/i] every inhabitant tells the truth with probability $1/2$ independently from each other. Sinbad arrives on island [i]Bruhaha[/i], but he does not know whether he is on island [i]Nyihaha[/i] or island [i]Bruhaha[/i]. Let $p_n$ denote the probability that after observing the ritual he can rule out being on island [i]Nyihaha[/i]. Is it true that $p_n\to 1$ if $n\to\infty$? [i]Proposed by Dávid Matolcsi, Berkeley[/i]

Find the largest possible real part of \[(75+117i)z+\frac{96+144i}{z}\] where $z$ is a complex number with $|z|=4$.

(a) Find all positive integers $ n$ for which $ 2^n\minus{}1$ is divisible by $ 7$. (b) Prove that there is no positive integer $ n$ for which $ 2^n\plus{}1$ is divisible by $ 7$.

On the coordinate plane is given the square with vertices $T_1(1,0),T_2(0,1),T_3(-1,0),T_4(0,-1)$. For every $n\in\mathbb N$, point $T_{n+4}$ is defined as the midpoint of the segment $T_nT_{n+1}$. Determine the coordinates of the limit point of $T_n$ as $n\to\infty$, if it exists.

In a triangle $ABC$ with medians $AD$ and $BE$ , holds that $\angle CAD= \angle CBE=30^o$. Prove that triangle $ABC$ is equilateral.

A number is placed in each cell of an $n \times n$ board so that the following holds: (A) the cells on the boundary all contain 0; (B) other cells on the main diagonal are each1 greater than the mean of the numbers to the left and right; (C) other cells are the mean of the numbers to the left and right. Show that (B) and (C) remain true if ''left and right'' is replaced by ''above and below''.

A plane through the center of a torus is tangent to the torus. Prove that the intersection of the plane and the torus consists of two circles.

[b]p1.[/b] Ana, Bob, Cho, Dan, and Eve want to use a microwave. In order to be fair, they choose a random order to heat their food in (all orders have equal probability). Ana's food needs $5$ minutes to cook, Bob's food needs $7$ minutes, Cho's needs $1$ minute, Dan's needs $12$ minutes, and Eve's needs $5$ minutes. What is the expected number of minutes Bob has to wait for his food to be done? [b]p2.[/b] $ABC$ is an equilateral triangle. $H$ lies in the interior of $ABC$, and points $X$, $Y$, $Z$ lie on sides $AB, BC, CA$, respectively, such that $HX\perp AB$, $HY \perp BC$, $HZ\perp CA$. Furthermore, $HX =2$, $HY = 3$, $HZ = 4$. Find the area of triangle $ABC$. [b]p3.[/b] Amy, Ben, and Chime play a dice game. They each take turns rolling a die such that the $first$ person to roll one of his favorite numbers wins. Amy's favorite number is $1$, Ben's favorite numbers are $2$ and $3$, and Chime's are $4$, $5$, and $6$. Amy rolls first, Ben rolls second, and Chime rolls third. If no one has won after Chime's turn, they repeat the sequence until someone has won. What's the probability that Chime wins the game? [b]p4.[/b] A point $P$ is chosen randomly in the interior of a square $ABCD$. What is the probability that the angle $\angle APB$ is obtuse? [b]p5.[/b] Let $ABCD$ be the quadrilateral with vertices $A = (3, 9)$, $B = (1, 1)$, $C = (5, 3)$, and $D = (a, b)$, all of which lie in the first quadrant. Let $M$ be the midpoint of $AB$, $N$ the midpoint of $BC$, $O$ the midpoint of $CD$, and $P$ the midpoint of $AD$. If $MNOP$ is a square, find $(a, b)$. [b]p6.[/b] Let $M$ be the number of positive perfect cubes that divide $60^{60}$. What is the prime factorization of $M$? [b]p7.[/b] Given that $x$, $y$, and $z$ are complex numbers with $|x|=|y| =|z|= 1$, $x + y + z = 1$ and $xyz = 1$, find $|(x + 2)(y + 2)(z + 2)|$. [b]p8.[/b] If $f(x)$ is a polynomial of degree $2008$ such that $f(m) = \frac{1}{m}$ for $m = 1, 2, ..., 2009$, find $f(2010)$. [b]p9.[/b] A drunkard is randomly walking through a city when he stumbles upon a $2 \times 2$ sliding tile puzzle. The puzzle consists of a $2 \times 2$ grid filled with a blank square, as well as $3$ square tiles, labeled $1$, $2$, and $3$. During each turn you may fill the empty square by sliding one of the adjacent tiles into it. The following image shows the puzzle's correct state, as well as two possible moves you can make: [img]https://cdn.artofproblemsolving.com/attachments/c/6/7ddd9305885523deeee2a530dc90505875d1cc.png[/img] Assuming that the puzzle is initially in an incorrect (but solvable) state, and that the drunkard will make completely random moves to try and solve it, how many moves is he expected to make before he restores the puzzle to its correct state? [b]p10.[/b] How many polynomials $p(x)$ exist such that the coeffients of $p(x)$ are a rearrangement of $\{0, 1, 2, .., deg \, p(x)\}$ and all of the roots of $p(x)$ are rational? (Note that the leading coefficient of $p(x)$ must be nonzero.) PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a triangle $ABC$, let $D$ be the midpoint of the side $BC$, and let $E$ be a point on the side $AC$. The lines $BE$ and $AD$ meet at a point $F$. Prove: If $\frac{BF}{FE}=\frac{BC}{AB}+1$, then the line $BE$ bisects the angle $ABC$.

Let $f(x) = \sin \frac{x}{3}+ \cos \frac{3x}{10}$ for all real $x$. Find the least natural number $n$ such that $f(n\pi + x)= f(x)$ for all real $x$.

Let $S$ be a subset of $\{1, 2, \dots, 9\}$, such that the sums formed by adding each unordered pair of distinct numbers from $S$ are all different. For example, the subset $\{1, 2, 3, 5\}$ has this property, but $\{1, 2, 3, 4, 5\}$ does not, since the pairs $\{1, 4\}$ and $\{2, 3\}$ have the same sum, namely 5. What is the maximum number of elements that $S$ can contain?

Prove that if one of the numbers $25x+31y, 3x+7y$ (where $x,y \in Z$) is a multiple of $41$, then so is the other.

Consider for a real number $t>1$, $I(t)=\int_{-4}^{4t-4} (x-4)\sqrt{x+4}\ dx.$ Find the minimum value of $I(t)\ (t>1).$

Given are a circle and an ellipse lying inside it with focus $C$. Find the locus of the circumcenters of triangles $ABC$, where $AB$ is a chord of the circle touching the ellipse.

Let $n>1$ be an integer and $d_1<d_2<\dots<d_m$ the list of its positive divisors, including $1$ and $n$. The $m$ instruments of a mathematical orchestra will play a musical piece for $m$ seconds, where the instrument $i$ will play a note of tone $d_i$ during $s_i$ seconds (not necessarily consecutive), where $d_i$ and $s_i$ are positive integers. This piece has "sonority" $S=s_1+s_2+\dots s_n$. A pair of tones $a$ and $b$ are harmonic if $\frac ab$ or $\frac ba$ is an integer. If every instrument plays for at least one second and every pair of notes that sound at the same time are harmonic, show that the maximum sonority achievable is a composite number.

In triangle $ABC$, the incircle touches the side $AC$ at point $B_1$ and one excircle is touching the same side at point $B_2$. It is known that the segments $BB_1$ and $BB_2$ are equal. Is it true that $\vartriangle ABC$ is isosceles?

Let $(X, <)$ be an arbitrary ordered set. Show that the elements of $X$ can be coloured by two colours in such a way that between any two points of the same colour there is a point of the opposite colour. (translated by L. Erdős)

If $a$ and $b$ are arbitrary positive real numbers and $m$ an integer, prove that \[\Bigr( 1+\frac ab \Bigl)^m +\Bigr( 1+\frac ba \Bigl)^m \geq 2^{m+1}.\]

Let $a_1,a_2,\ldots ,a_9$ be any non-negative numbers such that $a_1=a_9=0$ and at least one of the numbers is non-zero. Prove that for some $i$, $2\le i\le 8$, the inequality $a_{i-1}+a_{i+1}<2a_i$ holds. Will the statement remain true if we change the number $2$ in the last inequality to $1.9$?

If the real numbers $x, y, z$ are such that $x^2 + 4y^2 + 16z^2 = 48$ and $xy + 4yz + 2zx = 24$, what is the value of $x^2 + y^2 + z^2$?