Given are positive reals $x_1, x_2,..., x_n$ such that $\sum\frac {1}{1+x_i^2}=1$. Find the minimal value of the expression $\frac{\sum x_i}{\sum \frac{1}{x_i}}$ and find when it is achieved.

Two integers are called [i]relatively prime[/i] if they share no common factors other than $1.$ Determine the sum of all positive integers less than $162$ that are relatively prime to $162.$

Consider all $26^{26}$ words of length 26 in the Latin alphabet. Define the $\emph{weight}$ of a word as $1/(k+1)$, where $k$ is the number of letters not used in this word. Prove that the sum of the weights of all words is $3^{75}$. Proposed by Fedor Petrov, St. Petersburg State University

Each entry in an $n\times n$ table is either $+$ or $-$. At each step, one can choose a row or a column and reverse all signs in it. From the initial position, it is possible to obtain the table in which all signs are $+$. Prove that this can be accomplished in at most $n$ steps.

suppose that $S_{\mathbb N}$ is the set of all permutations of natural numbers. finite permutations are a subset of $S_{\mathbb N}$ that behave like the identity permutation from somewhere. in other words bijective functions like $\pi: \mathbb N \longrightarrow \mathbb N$ that only for finite natural numbers $i$, $\pi(i)\neq i$. prove that we cannot put probability measure that is countably additive on $\wp(S_{\mathbb N})$ (family of all the subsets of $S_{\mathbb N}$) that is invarient under finite permutations.

Solve the equation $3^x=2^xy+1$ in positive integers.

Let $ f$ be a polynomial with positive integer coefficients. Prove that if $ n$ is a positive integer, then $ f(n)$ divides $ f(f(n)\plus{}1)$ if and only if $ n\equal{}1.$

For a prime $p$ of the form $12k+1$ and $\mathbb{Z}_p=\{0,1,2,\cdots,p-1\}$, let \[\mathbb{E}_p=\{(a,b) \mid a,b \in \mathbb{Z}_p,\quad p\nmid 4a^3+27b^2\}\] For $(a,b), (a',b') \in \mathbb{E}_p$ we say that $(a,b)$ and $(a',b')$ are equivalent if there is a non zero element $c\in \mathbb{Z}_p$ such that $p\mid (a' -ac^4)$ and $p\mid (b'-bc^6)$. Find the maximal number of inequivalent elements in $\mathbb{E}_p$.

In an acute triangle $ ABC$, let $ D$ be a point on $ \left[AC\right]$ and $ E$ be a point on $ \left[AB\right]$ such that $ \angle ADB\equal{}\angle AEC\equal{}90{}^\circ$. If perimeter of triangle $ AED$ is 9, circumradius of $ AED$ is $ \frac{9}{5}$ and perimeter of triangle $ ABC$ is 15, then $ \left|BC\right|$ is $\textbf{(A)}\ 5 \qquad\textbf{(B)}\ \frac{24}{5} \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 8 \qquad\textbf{(E)}\ \frac{48}{5}$

Determine the real number $a$ having the property that $f(a)=a$ is a relative minimum of $f(x)=x^4-x^3-x^2+ax+1$.

Stairs are built by laying bricks as shown in the figure. If you have $2004$ bricks to build a staircase: a) How many steps (= escalones) will the ladder have? b) How many bricks will there be left over? [img]https://cdn.artofproblemsolving.com/attachments/4/b/c1b80b374daeda4e33e1bb45be1d11f4b89590.png[/img]

In the figure, equilateral hexagon $ABCDEF$ has three nonadjacent acute interior angles that each measure $30^\circ$. The enclosed area of the hexagon is $6\sqrt{3}$. What is the perimeter of the hexagon? [asy] size(6cm); pen p=black+linewidth(1),q=black+linewidth(5); pair C=(0,0),D=(cos(pi/12),sin(pi/12)),E=rotate(150,D)*C,F=rotate(-30,E)*D,A=rotate(150,F)*E,B=rotate(-30,A)*F; draw(C--D--E--F--A--B--cycle,p); dot(A,q); dot(B,q); dot(C,q); dot(D,q); dot(E,q); dot(F,q); label("$C$",C,2*S); label("$D$",D,2*S); label("$E$",E,2*S); label("$F$",F,2*dir(0)); label("$A$",A,2*N); label("$B$",B,2*W); [/asy] $(\textbf{A})\: 4\qquad(\textbf{B}) \: 4\sqrt3\qquad(\textbf{C}) \: 12\qquad(\textbf{D}) \: 18\qquad(\textbf{E}) \: 12\sqrt3$

The real numbers $a, b, c, d$ are such that $a\geq b\geq c\geq d>0$ and $a+b+c+d=1$. Prove that \[(a+2b+3c+4d)a^ab^bc^cd^d<1\] [i]Proposed by Stijn Cambie, Belgium[/i]

Two distinct real numbers are written on each vertex of a convex $2012-$gon. Show that we can remove a number from each vertex such that the remaining numbers on any two adjacent vertices are different.

Let $p$ be a prime, $n$ be a positive integer, and let $\mathbb{Z}_{p^n}$ denote the set of congruence classes modulo $p^n.$ Determine the number of functions $f: \mathbb{Z}_{p^n} \to \mathbb{Z}_{p^n}$ satisfying the condition \[ f(a)+f(b) \equiv f(a+b+pab) \pmod{p^n} \] for all $a,b \in \mathbb{Z}_{p^n}.$

A small bottle of shampoo can hold 35 milliliters of shampoo, whereas a large bottle can hold 500 milliliters of shampoo. Jasmine wants to buy the minimum number of small bottles necessary to completely fill a large bottle. How many bottles must she buy? $ \textbf{(A)}\ 11 \qquad\textbf{(B)}\ 12 \qquad\textbf{(C)}\ 13\qquad\textbf{(D)}\ 14\qquad\textbf{(E)}\ 15 $

Let $\mathcal{B}$ be the set of rectangular boxes that have volume $23$ and surface area $54$. Suppose $r$ is the least possible radius of a sphere that can fit any element of $\mathcal{B}$ inside it. Then $r^{2}$ can be expressed as $\tfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Let $ S_{\nu}\equal{}\sum_{j\equal{}1}^n b_jz_j^{\nu} \;(\nu\equal{}0,\pm 1, \pm 2 ,...) $, where the $ b_j$ are arbitrary and the $ z_j$ are nonzero complex numbers . Prove that \[ |S_0| \leq n \max_{0<|\nu| \leq n} |S_{\nu}|.\] [i]G. Halasz[/i]

(a) Given a positive integer $k$, prove that there do not exist two distinct integers in the open interval $(k^2, (k + 1)^2)$ whose product is a perfect square. (b) Given an integer $n > 2$, prove that there exist $n$ distinct integers in the open interval $(k^n, (k + 1)^n)$ whose product is the $n$-th power of an integer, for all but a finite number of positive integers $k$. [i]AMM Magazine[/i]

The sets of rational numbers $A = \{a_1, \dots, a_5\}$ and $B = \{b_1, \dots, b_5\}$ both contain $0$ and satisfy the condition that $$ \{a_i + b_j\}_{i,j} = \{0, 1, 2, \dots, 23, 24\}. $$ Determine these sets. (The set $\{a_i + b_j\}_{i,j}$ consists of all possible sums between an element of $A$ and an element of $B$)

Write a positive integer in each box so that: All six numbers are different. The sum of the six numbers is $100$. If each number is multiplied by its neighbor (in a clockwise direction) and the six results of those six multiplications are added, the smallest possible value is obtained. Explain why a lower value cannot be obtained. [img]https://cdn.artofproblemsolving.com/attachments/7/1/6fdadd6618f91aa03cdd6720cc2d6ee296f82b.gif[/img]

100 people from 50 countries, two from each countries, stay on a circle. Prove that one may partition them onto 2 groups in such way that neither no two countrymen, nor three consecutive people on a circle, are in the same group.

Let $\overline{abcd}$ be $4$ digit number, such that we can do transformations on it. If some two neighboring digits are different than $0$, then we can decrease both digits by $1$ (we can transform $9870$ to $8770$ or $9760$). If some two neighboring digits are different than $9$, then we can increase both digits by $1$ (we can transform $9870$ to $9980$ or $9881$). Can we transform number $1220$ to: $a)$ $2012$ $b)$ $2021$

Circles $ C_1$ and $ C_2$ with centers at $ O_1$ and $ O_2$ respectively meet at points $ A$ and $ B$. The radii $ O_1B$ and $ O_2B$ meet $ C_1$ and $ C_2$ at $ F$ and$ E$. The line through $ B$ parallel to $ EF$ intersects $ C_1$ again at $ M$ and $ C_2$ again at $ N$. Prove that $ MN \equal{} AE \plus{} AF$.

In the table are written the positive integers $1, 2,3,...,2018$. John and Mary have the ability to make together the following move: [i]They select two of the written numbers in the table, let $a,b$ and they replace them with the numbers $5a-2b$ and $3a-4b$.[/i] John claims that after a finite number of such moves, it is possible to triple all the numbers in the table, e.g. have the numbers: $3, 6, 9,...,6054$. Mary thinks a while and replies that this is not possible. Who of them is right?