Denote the sequence $a_{i,j}$ in positive reals such that $a_{i,j}$.$a_{j,i}=1$. Let $c_i=\sum_{k=1}^{n}a_{k,i}$. Prove that $1\ge$$\sum_{i=1}^{n}\dfrac {1}{c_i}$

Determine all positive integers $a,b,c$ satisfying $a^{(b^c)}=(b^a)^c$

Find all positive integers such that $3^{2n}+3n^2+7$ is a perfect square.

Does there exist a function $f : \mathbb{R} \rightarrow \mathbb{R}$, which satisfies both conditions : [b]a)[/b] $f( x + y + z) \leq 3(xy + yz + zx)$ for all real numbers $x , y , z$ and [b]b)[/b] there exist function $g$ and natural number $n$, such that $g(g(x)) = x ^ {2n + 1}$ and $f(g(x)) = (g(x)) ^2$ for every real number $x$ ?

Prove that $cos \frac{2\pi}{5} +cos \frac{4\pi}{5} = -\frac{1}{2}$.

[b]p1.[/b] You are on a flat planet. There are $100$ cities at points $x = 1, ..., 100$ along the line $y = -1$, and another $100$ cities at points $x = 1, ... , 100$ along the line $y = 1$. The planet’s terrain is scalding hot, and you cannot walk over it directly. Instead, you must cross archways from city to city. There are archways between all pairs of cities with different $y$ coordinates, but no other pairs: for instance, there is an archway from $(1, -1)$ to $(50, 1)$, but not from $(1, -1)$ to $(50, -1)$. The amount of “effort” necessary to cross an archway equals the square of the distance between the cities it connects. You are at $(1, -1)$, and you want to get to $(100, -1)$. What is the least amount of effort this journey can take? [b]p2.[/b] Let $f(x) = x^4 + ax^3 + bx^2 + cx + 25$. Suppose $a, b, c$ are integers and $f(x)$ has $4$ distinct integer roots. Find $f(3)$. [b]p3.[/b] Frankenstein starts at the point $(0, 0, 0)$ and walks to the point $(3, 3, 3)$. At each step he walks either one unit in the positive $x$-direction, one unit in the positive $y$-direction, or one unit in the positive $z$-direction. How many distinct paths can Frankenstein take to reach his destination? [b]p4.[/b] Let $ABCD$ be a rectangle with $AB = 20$, $BC = 15$. Let $X$ and $Y$ be on the diagonal $\overline{BD}$ of $ABCD$ such that $BX > BY$ . Suppose $A$ and $X$ are two vertices of a square which has two sides on lines $\overline{AB}$ and $\overline{AD}$, and suppose that $C$ and $Y$ are vertices of a square which has sides on $\overline{CB}$ and $\overline{CD}$. Find the length $XY$ . [img]https://cdn.artofproblemsolving.com/attachments/2/8/a3f7706171ff3c93389ff80a45886e306476d1.png[/img] [b]p5.[/b] $n \ge 2$ kids are trick-or-treating. They enter a haunted house in a single-file line such that each kid is friends with precisely the kids (or kid) adjacent to him. Inside the haunted house, they get mixed up and out of order. They meet up again at the exit, and leave in single file. After leaving, they realize that each kid (except the first to leave) is friends with at least one kid who left before him. In how many possible orders could they have left the haunted house? [b]p6.[/b] Call a set $S$ sparse if every pair of distinct elements of S differ by more than $1$. Find the number of sparse subsets (possibly empty) of $\{1, 2,... , 10\}$. [b]p7.[/b] How many ordered triples of integers $(a, b, c)$ are there such that $1 \le a, b, c \le 70$ and $a^2 + b^2 + c^2$ is divisible by $28$? [b]p8.[/b] Let $C_1$, $C_2$ be circles with centers $O_1$, $O_2$, respectively. Line $\ell$ is an external tangent to $C_1$ and $C_2$, it touches $C_1$ at $A$ and $C_2$ at $B$. Line segment $\overline{O_1O_2}$ meets $C_1$ at $X$. Let $C$ be the circle through $A, X, B$ with center $O$. Let $\overline{OO_1}$ and $\overline{OO_2}$ intersect circle $C$ at $D$ and $E$, respectively. Suppose the radii of $C_1$ and $C_2$ are $16$ and $9$, respectively, and suppose the area of the quadrilateral $O_1O_2BA$ is $300$. Find the length of segment $DE$. [b]p9.[/b] What is the remainder when $5^{5^{5^5}}$ is divided by $13$? [b]p10.[/b] Let $\alpha$ and $\beta$ be the smallest and largest real numbers satisfying $$x^2 = 13 + \lfloor x \rfloor + \left\lfloor \frac{x}{2} \right\rfloor +\left\lfloor \frac{x}{3} \right\rfloor + \left\lfloor \frac{x}{4} \right\rfloor .$$ Find $\beta - \alpha$ . ($\lfloor a \rfloor$ is defined as the largest integer that is not larger than $a$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Integers $a, b, c$ satisfy $a+b-c=1$ and $a^2+b^2-c^2=-1$. What is the sum of all possible values of $a^2+b^2+c^2$ ?

Prove that for any positive integer $n$, the number \[ S_n = {2n+1\choose 0}\cdot 2^{2n}+{2n+1\choose 2}\cdot 2^{2n-2}\cdot 3 +\cdots + {2n+1 \choose 2n}\cdot 3^n \] is the sum of two consecutive perfect squares. [i]Dorin Andrica[/i]

Let $n \ne 0$ be a natural number and integers $x_1, x_2, ...., x_n, y_1, y_2, ...., y_n$ with the properties: a) $x_1 + x_2 + .... + x_n = y_1 + y_2 + .... + y_n = 0,$ b) $x_1 ^ 2 + y_1 ^ 2 = x_2 ^ 2 + y_2 ^ 2 = .... = x_n ^ 2 + y_n ^ 2$. Show that $n$ is even.

Given $2017$ positive real numbers $a_1,a_2,\dots ,a_{2017}$. For each $n>2017$, set $$a_n=\max\{ a_{i_1}a_{i_2}a_{i_3}|i_1+i_2+i_3=n, 1\leq i_1\leq i_2\leq i_3\leq n-1\}.$$ Prove that there exists a positive integer $m\leq 2017$ and a positive integer $N>4m$ such that $a_na_{n-4m}=a_{n-2m}^2$ for every $n>N$.

Let $n$ be a nonzero natural number, and $x_1, x_2,..., x_n$ positive real numbers that $ \frac{1}{x_1}+\frac{1}{x_2}+...+\frac{1}{x_n}= n$. Find the minimum value of the expression $x_1 +\frac{x_2^2}{2}++\frac{x_3^3}{3}+...++\frac{x_n^n}{n}$.

Let $A$ and $B$ be arbitrary finite sets and let $f: A\longrightarrow B$ and $g: B\longrightarrow A$ be functions such that $g$ is not onto. Prove that there is a subset $S$ of $A$ such that $\frac{A}{S}=g(\frac{B}{f(S)})$.

[b]p1.[/b] The following number is the product of the divisors of $n$. $$2^63^3$$ What is $n$? [b]p2.[/b] Let a right triangle have the sides $AB =\sqrt3$, $BC =\sqrt2$, and $CA = 1$. Let $D$ be a point such that $AD = BD = 1$. Let $E$ be the point on line $BD$ that is equidistant from $D$ and $A$. Find the angle $\angle AEB$. [b]p3.[/b] There are twelve indistinguishable blackboards that are distributed to eight different schools. There must be at least one board for each school. How many ways are there of distributing the boards? [b]p4.[/b] A Nishop is a chess piece that moves like a knight on its first turn, like a bishop on its second turn, and in general like a knight on odd-numbered turns and like a bishop on even-numbered turns. A Nishop starts in the bottom-left square of a $3\times 3$-chessboard. How many ways can it travel to touch each square of the chessboard exactly once? [b]p5.[/b] Let a Fibonacci Spiral be a spiral constructed by the addition of quarter-circles of radius $n$, where each $n$ is a term of the Fibonacci series: $$1, 1, 2, 3, 5, 8,...$$ (Each term in this series is the sum of the two terms that precede it.) What is the arclength of the maximum Fibonacci spiral that can be enclosed in a rectangle of area $714$, whose side lengths are terms in the Fibonacci series? [b]p6.[/b] Suppose that $a_1 = 1$ and $$a_{n+1} = a_n -\frac{2}{n + 2}+\frac{4}{n + 1}-\frac{2}{n}$$ What is $a_{15}$? [b]p7.[/b] Consider $5$ points in the plane, no three of which are collinear. Let $n$ be the number of circles that can be drawn through at least three of the points. What are the possible values of $n$? [b]p8.[/b] Find the number of positive integers $n$ satisfying $\lfloor n /2014 \rfloor =\lfloor n/2016 \rfloor$. [b]p9.[/b] Let $f$ be a function taking real numbers to real numbers such that for all reals $x \ne 0, 1$, we have $$f(x) + f \left( \frac{1}{1 - x}\right)= (2x - 1)^2 + f\left( 1 -\frac{1}{ x}\right)$$ Compute $f(3)$. [b]p10.[/b] Alice and Bob split $5$ beans into piles. They take turns removing a positive number of beans from a pile of their choice. The player to take the last bean loses. Alice plays first. How many ways are there to split the piles such that Alice has a winning strategy? [b]p11.[/b] Triangle $ABC$ is an equilateral triangle of side length $1$. Let point $M$ be the midpoint of side $AC$. Another equilateral triangle $DEF$, also of side length $1$, is drawn such that the circumcenter of $DEF$ is $M$, point $D$ rests on side $AB$. The length of $AD$ is of the form $\frac{a+\sqrt{b}}{c}$ , where $b$ is square free. What is $a + b + c$? [b]p12.[/b] Consider the function $f(x) = \max \{-11x- 37, x - 1, 9x + 3\}$ defined for all real $x$. Let $p(x)$ be a quadratic polynomial tangent to the graph of $f$ at three distinct points with x values $t_1$, $t_2$ and $t_3$ Compute the maximum value of $t_1 + t_2 + t_3$ over all possible $p$. [b]p13.[/b] Circle $J_1$ of radius $77$ is centered at point $X$ and circle $J_2$ of radius $39$ is centered at point $Y$. Point $A$ lies on $J1$ and on line $XY$ , such that A and Y are on opposite sides of $X$. $\Omega$ is the unique circle simultaneously tangent to the tangent segments from point $A$ to $J_2$ and internally tangent to $J_1$. If $XY = 157$, what is the radius of $\Omega$ ? [b]p14.[/b] Find the smallest positive integer $n$ so that for any integers $a_1, a_2,..., a_{527}$,the number $$\left( \prod^{527}_{j=1} a_j\right) \cdot\left( \sum^{527}_{j=1} a^n_j\right)$$ is divisible by $527$. [b]p15.[/b] A circle $\Omega$ of unit radius is inscribed in the quadrilateral $ABCD$. Let circle $\omega_A$ be the unique circle of radius $r_A$ externally tangent to $\Omega$, and also tangent to segments $AB$ and $DA$. Similarly define circles $\omega_B$, $\omega_C$, and $\omega_D$ and radii $r_B$, $r_C$, and $r_D$. Compute the smallest positive real $\lambda$ so that $r_C < \lambda$ over all such configurations with $r_A > r_B > r_C > r_D$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Camila creates a pattern to write the following numbers: $2, 4$ $5, 7, 9, 11$ $12, 14, 16, 18, 20, 22$ $23, 25, 27, 29, 31, 33, 35, 37$ $…$ Following the same pattern, what is the sum of the numbers in the tenth row?

Prove that for all positive integers $n,m$, with $m$ odd, the following number is an integer \[ \frac 1{3^mn}\sum^m_{k=0} { 3m \choose 3k } (3n-1)^k. \]

There are $18$ children in the class. Parents decided to give children from this class a cake. To do this, they first learned from each child the area of ​​the piece he wants to get. After that, they showed a square-shaped cake, the area of ​​which is exactly equal to the sum of $18$ named numbers. However, when they saw the cake, the children wanted their pieces to be squares too. The parents cut the cake with lines parallel to the sides of the cake (cuts do not have to start or end on the side of the cake). For what maximum k the parents are guaranteed to cut out $k$ square pieces from the cake, which you can give to $k$ children so that each of them gets what they want?

Prove that there doesn't exist a function $f:\mathbb{N} \rightarrow \mathbb{N}$, such that $(m+f(n))^2 \geq 3f(m)^2+n^2$ for all $m, n \in \mathbb{N}$.

Let $ K$ be a finite field of $ p$ elements, where $ p$ is a prime. For every polynomial $ f(x)\equal{}\sum_{i\equal{}0}^na_ix^i$ ($ \in K[x]$) put $ \overline{f(x)}\equal{}\sum_{i\equal{}0}^n a_ix^{p^i}$. Prove that for any pair of polynomials $ f(x),g(x)\in K[x]$, $ \overline{f(x)}|\overline{g(x)}$ if and only if $ f(x)|g(x)$.

Let $a,b,c,d$ be integers such that the number $a-b+c-d$ is odd and it divides the number $a^2-b^2+c^2-d^2$. Show that, for every positive integer $n$, $a-b+c-d$ divides $a^n-b^n+c^n-d^n$.

Let $f: \mathbb{R}^2\rightarrow \mathbb{R}$ be a function for which for arbitrary $x,y,z\in \mathbb{R}$ we have that $f(x,y)+f(y,z)+f(z,x)=0$. Prove that there exist function $g:\mathbb{R}\rightarrow \mathbb{R}$ for which: $f(x,y)=g(x)-g(y),\, \forall x,y\in \mathbb{R}$.

Given a real polynomial $P(x)=a_{2024}x^{2024}+\cdots+a_1x+a_0$ with degree $2024$, such that for all positive reals $b_1, b_2,\cdots, b_{2025}$ with product $1$, then; $$P(b_1)+P(b_2)+\cdots +P(b_{2025})\ge 0$$ Suppose there exist positive reals $c_1, c_2, \cdots, c_{2025}$ with product $1$, such that; $$P(c_1)+P(c_2)+ \cdots +P(c_{2025})=0$$ Is it possible that the values $c_1, c_2, \cdots, c_{2025}$ are all distinct? [i]Proposed by Ivan Chan Kai Chin[/i]

Let $a$ and $b$ be real numbers such that $a + b \ne 0$. Solve the equation $$\frac{1}{(x + a)^2 - b^2} +\frac{1}{(x +b)^2 - a^2}=\frac{1}{x^2 -(a + b)^2}+\frac{1}{x^2-(a -b)^2}$$

Let ${a_1,a_2,\dots,a_n}$ be positive real numbers, ${n>1}$. Denote by $g_n$ their geometric mean, and by $A_1,A_2,\dots,A_n$ the sequence of arithmetic means defined by \[ A_k=\frac{a_1+a_2+\cdots+a_k}{k},\qquad k=1,2,\dots,n. \] Let $G_n$ be the geometric mean of $A_1,A_2,\dots,A_n$. Prove the inequality \[ n \root n\of{\frac{G_n}{A_n}}+ \frac{g_n}{G_n}\le n+1 \] and establish the cases of equality. [i]Proposed by Finbarr Holland, Ireland[/i]

Let $a_1 < a_2 < a_3 < a_4$ be given positive numbers. Find all real values of parameter $c$ for which the system $$\begin{cases} x_1 + x_2 + x_3 + x_4 = 1 \\ a_1x_1 + a_2 x_2 + a_3x_3 + a_4 x_4 = c \\ a_1^2x_1 + a_2^2 x_2 + a_3^2x_3 + a_4^2 x_4 = c^2\end{cases}$$ has a solution in nonnegative $(x_1,x_2,x_3,x_4)$ real numbers.

a)Does there exist for any rational number $\frac{a}{b}$ some rational numbers $x_1,x_2,....x_n$ such that $x_1*x_2*....*x_n=1$ and $x_1+x_2+....+x_n=\frac{a}{b}$ a)Does there exist for any rational number $\frac{a}{b}$ some rational numbers $x_1,x_2,....x_n$ such that $x_1*x_2*....*x_n=\frac{a}{b}$ and $x_1+x_2+....+x_n=1$