Let $a$, $b$ be positive integers such that $b^n+n$ is a multiple of $a^n+n$ for all positive integers $n$. Prove that $a=b$. [i]Proposed by Mohsen Jamali, Iran[/i]

A real number $f(X)\neq 0$ is assigned to each point $X$ in the space. It is known that for any tetrahedron $ABCD$ with $O$ the center of the inscribed sphere, we have : \[ f(O)=f(A)f(B)f(C)f(D). \] Prove that $f(X)=1$ for all points $X$. [i]Proposed by Aleksandar Ivanov[/i]

Is it possible to draw $10$ bus routes with stops such that for any $8$ routes there is a stop that does not belong to any of the routes, but any $9$ routes pass through all the stops?

Half the people in a room left. One third of those remaining started to dance. There were then $12$ people who were not dancing. The original number of people in the room was $\text{(A)}\ 24 \qquad \text{(B)}\ 30 \qquad \text{(C)}\ 36 \qquad \text{(D)}\ 42 \qquad \text{(E)}\ 72$

A group of $n > 1$ pirates of different age owned total of $2009$ coins. Initially each pirate (except the youngest one) had one coin more than the next younger. a) Find all possible values of $n$. b) Every day a pirate was chosen. The chosen pirate gave a coin to each of the other pirates. If $n = 7$, find the largest possible number of coins a pirate can have after several days.

Show that for all integers $a \ge 1$,$ \lfloor \sqrt{a}+\sqrt{a+1}+\sqrt{a+2}\rfloor = \lfloor \sqrt{9a+8}\rfloor$

[b]p1.[/b] A tennis net is made of strings tied up together which make a grid consisting of small squares as shown below. [img]https://cdn.artofproblemsolving.com/attachments/9/4/72077777d57408d9fff0ea5e79be5ecb6fe8c3.png[/img] The size of the net is $100\times 10$ small squares. What is the maximal number of sides of small squares which can be cut without breaking the net into two separate pieces? (The side is cut only in the middle, not at the ends). [b]p2.[/b] What number is bigger $2^{300}$ or $3^{200}$ ? [b]p3.[/b] All noble knights participating in a medieval tournament in Camelot used nicknames. In the tournament each knight had combats with all other knights. In each combat one knight won and the second one lost. At the end of tournament the losers reported their real names to the winners and to the winners of their winners. Was there a person who knew the real names of all knights? [b]p4.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $10$ rocks in the first pile and $12$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game? [b]p5.[/b] There is an interesting $5$-digit integer. With a $1$ after it, it is three times as large as with a $1$ before it. What is the number? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The positive real numbers $a_1,\ldots ,a_n$ and $k$ are such that $a_1+\cdots +a_n=3k$, $a_1^2+\cdots +a_n^2=3k^2$ and $a_1^3+\cdots +a_n^3>3k^3+k$. Prove that the difference between some two of $a_1,\ldots,a_n$ is greater than $1$.

Edward's formula for the stock market predicts correctly that the price of HMMT is directly proportional to a secret quantity $ x$ and inversely proportional to $ y$, the number of hours he slept the night before. If the price of HMMT is $ \$12$ when $ x\equal{}8$ and $ y\equal{}4$, how many dollars does it cost when $ x\equal{}4$ and $ y\equal{}8$?

Show that for any natural number $n$, the number $A = [\frac{n + 3}{4}] + [ \frac{n + 5}{4} ] + [\frac{n}{2} ] +n^2 + 3n + 3$ is a perfect square. ($[x]$ denotes the integer part of the real number x.)

A set of positive integers is called [i]fragrant[/i] if it contains at least two elements and each of its elements has a prime factor in common with at least one of the other elements. Let $P(n)=n^2+n+1$. What is the least possible positive integer value of $b$ such that there exists a non-negative integer $a$ for which the set $$\{P(a+1),P(a+2),\ldots,P(a+b)\}$$ is fragrant?

Aida made three cubes with positive integer side lengths $a,b,c$. They were too small for her, so she divided them into unit cubes and attempted to construct a cube of side $a+b+c$. Unfortunately, she was $648$ blocks off. How many possibilities of the ordered triple $\left(a,b,c\right)$ are there? [i]2017 CCA Math Bonanza Team Round #9[/i]

Let $ I $ be the incentre of $ ABC $ and $ D,E,F $ be the feet of the perpendiculars from $ I $ to $ BC,CA,AB, $ respectively. Show that $$ \frac{AB}{DE} +\frac{BC}{EF} +\frac{CA}{FD}\ge 6. $$

Find the sum of the real roots of $2x^4 + 4x^3 + 6x^2 + 4x - 4$. [i]Individual #12[/i]

For any real number $ x$ prove that: \[ x\in \mathbb{Z}\Leftrightarrow \lfloor x\rfloor \plus{}\lfloor 2x\rfloor\plus{}\lfloor 3x\rfloor\plus{}...\plus{}\lfloor nx\rfloor\equal{}\frac{n(\lfloor x\rfloor\plus{}\lfloor nx\rfloor)}{2}\ ,\ (\forall)n\in \mathbb{N}^*\]

Show that [list=a] [*] if $n>49$, then there are positive integers $a>1$ and $b>1$ such that $a+b=n$ and $\frac{\phi(a)}{a}+\frac{\phi(b)}{b}<1$. [*] if $n>4$, then there are $a>1$ and $b>1$ such that $a+b=n$ and $\frac{\phi(a)}{a}+\frac{\phi(b)}{b}>1$.[/list]

Two numbers $(z_1,z_2)\in \mathbb{C}^*\times \mathbb{C}^*$ have the property $(P)$ if there is a real number $a\in [-2,2]$ such that $z_1^2-az_1z_2+z_2^2=0$. Prove that if $(z_1,z_2)$ have the property $(P)$, then $(z_1^n,z_2^n)$ satisfy this property, for any positive integer $n$. [i]Dorin Andrica[/i]

Find all ordered pairs $(a,b)$, of natural numbers, where $1<a,b\leq 100$, such that $\frac{1}{\log_{a}{10}}+\frac{1}{\log_{b}{10}}$ is a natural number.

Show that the triangle whose angles satisfy the equality \[\frac{\sin^2A+\sin^2B+\sin^2C}{\cos^2A+\cos^2B+\cos^2C} = 2\] is right angled.

Let $R$ be an $20 \times 18$ grid of points such that adjacent points are $1$ unit apart. A fly starts at a point and jumps in straight lines to other points in $R$ in turn, such that each point in R is visited exactly once and no two jumps intersect at a point other than an endpoint of a jump, for a total of $359$ jumps. Call a jump small if it is of length $1$. What is the least number of small jumps? (The left configuration for a $4 \times 4$ grid has $9$ small jumps and $15$ total jumps, while the right configuration is invalid.)

For positive integers $a$ and $b$, consider the curve $x^a + y^b = 1$ over real numbers $x$, $y$ and let $S(a, b)$ be the sum $P$ of the number of $x$-intercepts and $y$-intercepts of this curve. Compute $\sum^{10}_{a=1}\sum^5_{b=1} S(a, b).$

Let $a \spadesuit b = \frac{a^2-b^2}{2b-2a}$ . Given that $3 \spadesuit x = -10$, compute $x$.

Find all integers $n$ with $n \geq 4$ for which there exists a sequence of distinct real numbers $x_1, \ldots, x_n$ such that each of the sets $$\{x_1, x_2, x_3\}, \{x_2, x_3, x_4\},\ldots,\{x_{n-2}, x_{n-1}, x_n\}, \{x_{n-1}, x_n, x_1\},\text{ and } \{x_n, x_1, x_2\}$$ forms a 3-term arithmetic progression when arranged in increasing order.

Find the least positive integer that cannot be represented as $\frac{2^a-2^b}{2^c-2^d}$ for some positive integers $a, b, c, d$.

Let $\triangle ABC$ be a acute triangle. Let $H$ the foot of the C-altitude in $AB$ such that $AH=3BH$, let $M$ and $N$ the midpoints of $AB$ and $AC$ and let $P$ be a point such that $NP=NC$ and $CP=CB$ and $B$, $P$ are located on different sides of the line $AC$. Prove that $\measuredangle APM=\measuredangle PBA$.