Prove that the integer $1^1 + 3^3 + 5^5 + .. + (2^n - 1)^{2^n-1}$ is a multiple of $2^n$ but not a multiple of $2^{n+1}$.

Given $m\in\mathbb{N}$ and a prime number $p$, $p>m$, let \[M=\{n\in\mathbb{N}\mid m^2+n^2+p^2-2mn-2mp-2np \,\,\, \text{is a perfect square} \} \] Prove that $|M|$ does not depend on $p$. [i]Proposed by Aleksandar Ivanov[/i]

Let $ \varphi(x)$ be a cubic polynomial with integer coefficients. Given that $ \varphi(x)$ has have 3 distinct real roots $u,v,w $ and $u,v,w $ are not rational number. there are integers $ a, b,c$ such that $u=av^2+bv+c$. Prove that $b^2 -2b -4ac - 7$ is a square number .

Let $g(n)$ be defined as follows: \[ g(1) = 0, g(2) = 1 \] and \[ g(n+2) = g(n) + g(n+1) + 1, n \geq 1. \] Prove that if $n > 5$ is a prime, then $n$ divides $g(n) \cdot (g(n) + 1).$

[u]Round 1[/u] [b]p1.[/b] Ten children arrive at a birthday party and leave their shoes by the door. All the children have different shoe sizes. Later, as they leave one at a time, each child randomly grabs a pair of shoes their size or larger. After some kids have left, all of the remaining shoes are too small for any of the remaining children. What is the greatest number of shoes that might remain by the door? [b]p2.[/b] Turans, the king of Saturn, invented a new language for his people. The alphabet has only $6$ letters: A, N, R, S, T, U; however, the alphabetic order is different than in English. A word is any sequence of $6$ different letters. In the dictionary for this language, the first word is SATURN. Which word follows immediately after TURANS? [b]p3.[/b] Benji chooses five integers. For each pair of these numbers, he writes down the pair's sum. Can all ten sums end with different digits? [b]p4.[/b] Nine dwarves live in a house with nine rooms arranged in a $3\times3$ square. On Monday morning, each dwarf rubs noses with the dwarves in the adjacent rooms that share a wall. On Monday night, all the dwarves switch rooms. On Tuesday morning, they again rub noses with their adjacent neighbors. On Tuesday night, they move again. On Wednesday morning, they rub noses for the last time. Show that there are still two dwarves who haven't rubbed noses with one another. [b]p5.[/b] Anna and Bobby take turns placing rooks in any empty square of a pyramid-shaped board with $100$ rows and $200$ columns. If a player places a rook in a square that can be attacked by a previously placed rook, he or she loses. Anna goes first. Can Bobby win no matter how well Anna plays? [img]https://cdn.artofproblemsolving.com/attachments/7/5/b253b655b6740b1e1310037da07a0df4dc9914.png[/img] [u]Round 2[/u] [b]p6.[/b] Some boys and girls, all of different ages, had a snowball fight. Each girl threw one snowball at every kid who was older than her. Each boy threw one snowball at every kid who was younger than him. Three friends were hit by the same number of snowballs, and everyone else took fewer hits than they did. Prove that at least one of the three is a girl. [b]p7.[/b] Last year, jugglers from around the world travelled to Jakarta to participate in the Jubilant Juggling Jamboree. The festival lasted $32$ days, with six solo performances scheduled each day. The organizers noticed that for any two days, there was exactly one juggler scheduled to perform on both days. No juggler performed more than once on a single day. Prove there was a juggler who performed every day. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Steve needed to address a letter to $2743$ Becker Road. He remembered the digits of the address, but he forgot the correct order of the digits, so he wrote them down in random order. The probability that Steve got exactly two of the four digits in their correct positions is $\tfrac m n$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Consider the sequence given by $a_0 = 3$ and such that for $i \ge 1$, we have $ai = 2^{a_{i-1}} + 1$. Let $m$ be the smallest integer such that $a^3_3$ divides $a_m$. Let $m'$ the smallest integer such that $a^3_m$ divides $a_{m'}$ . Find the value of $m'$.

Given set $S = \{ xy\left( {x + y} \right)\; |\; x,y \in \mathbb{N}\}$.Let $a$ and $n$ natural numbers such that $a+2^k\in S$ for all $k=1,2,3,...,n$.Find the greatest value of $n$.

[url=https://artofproblemsolving.com/community/c678145][b]Czech-Polish-Slovak Match 2018[/b][/url] [b]Austria, 24 - 27 June 2018[/b] [url=http://artofproblemsolving.com/community/c6h1667029p10595005][b]Problem 1.[/b][/url] Determine all functions $f : \mathbb R \to \mathbb R$ such that for all real numbers $x$ and $y$, $$f(x^2 + xy) = f(x)f(y) + yf(x) + xf(x+y).$$ [i]Proposed by Walther Janous, Austria[/i] [url=http://artofproblemsolving.com/community/c6h1667030p10595011][b]Problem 2.[/b][/url] Let $ABC$ be an acute scalene triangle. Let $D$ and $E$ be points on the sides $AB$ and $AC$, respectively, such that $BD=CE$. Denote by $O_1$ and $O_2$ the circumcentres of the triangles $ABE$ and $ACD$, respectively. Prove that the circumcircles of the triangles $ABC, ADE$, and $AO_1O_2$ have a common point different from $A$. [i]Proposed by Patrik Bak, Slovakia[/i] [url=http://artofproblemsolving.com/community/c6h1667031p10595016][b]Problem 3.[/b][/url] There are $2018$ players sitting around a round table. At the beginning of the game we arbitrarily deal all the cards from a deck of $K$ cards to the players (some players may receive no cards). In each turn we choose a player who draws one card from each of the two neighbors. It is only allowed to choose a player whose each neighbor holds a nonzero number of cards. The game terminates when there is no such player. Determine the largest possible value of $K$ such that, no matter how we deal the cards and how we choose the players, the game always terminates after a finite number of turns. [i]Proposed by Peter Novotný, Slovakia[/i] [url=http://artofproblemsolving.com/community/c6h1667033p10595021][b]Problem 4.[/b][/url] Let $ABC$ be an acute triangle with the perimeter of $2s$. We are given three pairwise disjoint circles with pairwise disjoint interiors with the centers $A, B$, and $C$, respectively. Prove that there exists a circle with the radius of $s$ which contains all the three circles. [i]Proposed by Josef Tkadlec, Czechia[/i] [url=http://artofproblemsolving.com/community/c6h1667034p10595023][b]Problem 5.[/b][/url] In a $2 \times 3$ rectangle there is a polyline of length $36$, which can have self-intersections. Show that there exists a line parallel to two sides of the rectangle, which intersects the other two sides in their interior points and intersects the polyline in fewer than $10$ points. [i]Proposed by Josef Tkadlec, Czechia and Vojtech Bálint, Slovakia[/i] [url=http://artofproblemsolving.com/community/c6h1667036p10595032][b]Problem 6.[/b][/url] We say that a positive integer $n$ is [i]fantastic[/i] if there exist positive rational numbers $a$ and $b$ such that $$ n = a + \frac 1a + b + \frac 1b.$$ [b](a)[/b] Prove that there exist infinitely many prime numbers $p$ such that no multiple of $p$ is fantastic. [b](b)[/b] Prove that there exist infinitely many prime numbers $p$ such that some multiple of $p$ is fantastic. [i]Proposed by Walther Janous, Austria[/i]

A sequence $a_2, a_3, \dots, a_n$ of positive integers is said to be [i]campechana[/i], if for each $i$ such that $2 \leq i \leq n$ it holds that exactly $a_i$ terms of the sequence are relatively prime to $i$. We say that the [i]size[/i] of such a sequence is $n - 1$. Let $m = p_1p_2 \dots p_k$, where $p_1, p_2, \dots, p_k$ are pairwise distinct primes and $k \geq 2$. Show that there exist at least two different campechana sequences of size $m$.

Show that there are no integers $x$ and $y$ satisfying $x^2 + 5 = y^3$. Daniel Harrer

Prove that if for natural numbers $ a, b $ the number $ \sqrt[3]{a} + \sqrt[3]{b} $ is rational, then $ a, b $ are cubes of natural numbers.

Find all numbers $p\le q\le r$ such that all the numbers \[pq+r,pq+r^2,qr+p,qr+p^2,rp+q,rp+q^2 \] are prime.

For each positive integer $n$ let $a_n$ be the largest positive integer satisfying \[(a_n)!\left| \prod_{k=1}^n \left\lfloor \frac{n}{k}\right\rfloor\right.\] Show that there are infinitely many positive integers $m$ for which $a_{m+1}<a_m$.

Let $k\ge 0$ be an integer and suppose the integers $a_1,a_2,\dots,a_n$ give at least $2k$ different residues upon division by $(n+k)$. Show that there are some $a_i$ whose sum is divisible by $n+k$.

Find all functions $f: \mathbb{N} \rightarrow \mathbb{Z}$ such that $|f(k)| \leq k$ for all positive integers $k$ and there is a prime number $p>2024$ which satisfies both of the following conditions: $1)$ For all $a \in \mathbb{N}$ we have $af(a+p) = af(a)+pf(a),$ $2)$ For all $a \in \mathbb{N}$ we have $p|a^{\frac{p+1}{2}}-f(a).$ [i]Authored by Nikola Velov[/i]

Let $a_n$ be the least positive integer the sum of whose digits is $n$. Find $a_1 + a_2 + a_3 + \dots + a_{20}$.

Let $\mathbb N$ be the set of positive integers. Find all functions $f: \mathbb N \to \mathbb N$ that satisfy the equation \[ f^{abc-a}(abc) + f^{abc-b}(abc) + f^{abc-c}(abc) = a + b + c \] for all $a,b,c \ge 2$. (Here $f^1(n) = f(n)$ and $f^k(n) = f(f^{k-1}(n))$ for every integer $k$ greater than $1$.)

Given a positive integer $k\geq2$, set $a_1=1$ and, for every integer $n\geq 2$, let $a_n$ be the smallest solution of equation \[x=1+\sum_{i=1}^{n-1}\left\lfloor\sqrt[k]{\frac{x}{a_i}}\right\rfloor\] that exceeds $a_{n-1}$. Prove that all primes are among the terms of the sequence $a_1,a_2,\ldots$

Find all $10$ digit numbers $a_0a_1...a_9$ such that for each $k, a_k$ is the number of times that the digit $k$ appears in the number.

[b]p1.[/b] Al usually arrives at the train station on the commuter train at $6:00$, where his wife Jane meets him and drives him home. Today Al caught the early train and arrived at $5:00$. Rather than waiting for Jane, he decided to jog along the route he knew Jane would take and hail her when he saw her. As a result, Al and Jane arrived home $12$ minutes earlier than usual. If Al was jogging at a constant speed of $5$ miles per hour, and Jane always drives at the constant speed that would put her at the station at $6:00$, what was her speed, in miles per hour? [b]p2.[/b] In the figure, points $M$ and $N$ are the respective midpoints of the sides $AB$ and $CD$ of quadrilateral $ABCD$. Diagonal $AC$ meets segment $MN$ at $P$, which is the midpoint of $MN$, and $AP$ is twice as long as $PC$. The area of triangle $ABC$ is $6$ square feet. (a) Find, with proof, the area of triangle $AMP$. (b) Find, with proof, the area of triangle $CNP$. (c) Find, with proof, the area of quadrilateral $ABCD$. [img]https://cdn.artofproblemsolving.com/attachments/a/c/4bdcd8390bae26bc90fc7eae398ace06900a67.png[/img] [b]p3.[/b] (a) Show that there is a triangle whose angles have measure $\tan^{-1}1$, $\tan^{-1}2$ and $\tan^{-1}3$. (b) Find all values of $k$ for which there is a triangle whose angles have measure $\tan^{-1}\left(\frac12 \right)$, $\tan^{-1}\left(\frac12 +k\right)$, and $\tan^{-1}\left(\frac12 +2k\right)$ [b]p4.[/b] (a) Find $19$ consecutive integers whose sum is as close to $1000$ as possible. (b) Find the longest possible sequence of consecutive odd integers whose sum is exactly $1000$, and prove that your sequence is the longest. [b]p5.[/b] Let $AB$ and $CD$ be chords of a circle which meet at a point $X$ inside the circle. (a) Suppose that $\frac{AX}{BX}=\frac{CX}{DX}$. Prove that $|AB|=|CD|$. (b) Suppose that $\frac{AX}{BX}>\frac{CX}{DX}>1$. Prove that $|AB|>|CD|$. ($|PQ|$ means the length of the segment $PQ$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the solutions in prime numbers of the following equation $p^4 + q^4 + r^4 + 119 = s^2 .$

There are nine cards that have the digits $1, 2, 3, 4, 5, 6, 7, 8$ and $9$ written on them, with one digit on each card. Using all the cards, some numbers are formed (for example, the numbers $8$, $213$, $94$, $65$ and $7$). a) If all the numbers formed are prime, determine the smallest possible value of their sum. b) If all formed numbers are composite, determine the smallest possible value of their sum. Note: A number $p$ is prime if its only divisors are $1$ and $p$. A number is composite if it has more than two dividers. The number $1$ is neither prime nor composite.

Let $({{A}_{n}})_{n=1}^{\infty }$ and $({{a}_{n}})_{n=1}^{\infty }$ be sequences of positive integers. Assume that for each positive integer $x$, there is a unique positive integer $N$ and a unique $N-tuple$ $({{x}_{1}},...,{{x}_{N}})$ such that $0\le {{x}_{k}}\le {{a}_{k}}$ for $k=1,2,...N$, ${{x}_{N}}\ne 0$, and $x=\sum\limits_{k=1}^{N}{{{A}_{k}}{{x}_{k}}}$. (a) Prove that ${{A}_{k}}=1$ for some $k$; (b) Prove that ${{A}_{k}}={{A}_{j}}\Leftrightarrow k=j$; (c) Prove that if ${{A}_{k}}\le {{A}_{j}}$, then $\left. {{A}_{k}} \right|{{A}_{j}}$.

Prove that the number (a) $97^{97}$ (b) $1997^{17}$ cannot be equal to a sum of cubes of several consecutive integers. (AA Egorov)