Prove that for every positive integer $m$ there exists a positive integer N such that $S(2^n) > m$ for every positive integer $n > N$, where by $S(x)$ we denote the sum of digits of a positive integer $x$.

Let $S$ be the set of ordered pairs $(x, y)$ such that $0<x\le 1$, $0<y\le 1$, and $\left[\log_2{\left(\frac 1x\right)}\right]$ and $\left[\log_5{\left(\frac 1y\right)}\right]$ are both even. Given that the area of the graph of $S$ is $m/n$, where $m$ and $n$ are relatively prime positive integers, find $m+n$. The notation $[z]$ denotes the greatest integer that is less than or equal to $z$.

Triangle $ABC$ is such that $\angle BAC>\angle ABC>60^o$. The perpendicular bisector of $\overline{AB}$ intersects the segment $\overline {BC}$ at $O$. Suppose there exists a point $D$ on the segment $\overline{AC}$ such that $OD=AB$ and $\angle ODA=30^o$. Find $\angle BAC$. [i](Vlad Robu)[/i]

Each set of a finite family of subsets of a line is a union of two closed intervals. Moreover, any three of the sets of the family have a point in common. Prove that there is a point which is common to at least half the sets of the family.

Let $E$ be a point inside the rhombus $ABCD$ such that $|AE|=|EB|$, $m(\widehat{EAB})=12^\circ$, and $m(\widehat{DAE})=72^\circ$. What is $m(\widehat{CDE})$ in degrees? $ \textbf{(A)}\ 64 \qquad\textbf{(B)}\ 66 \qquad\textbf{(C)}\ 68 \qquad\textbf{(D)}\ 70 \qquad\textbf{(E)}\ 72 $

A $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ where $h_i\left(x_1,x_2, \cdots , x_n\right)$ are $n$ variable polynomials with real coefficients is called [i]good[/i] if the following condition holds: For any $n$ functions $f_1,f_2, \cdots ,f_n : \mathbb R \to \mathbb R$ if for all $1 \le i \le n+1$, $P_i(x)=h_i \left(f_1(x),f_2(x), \cdots, f_n(x) \right)$ is a polynomial with variable $x$, then $f_1(x),f_2(x), \cdots, f_n(x)$ are polynomials. $a)$ Prove that for all positive integers $n$, there exists a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that the degree of all $h_i$ is more than $1$. $b)$ Prove that there doesn't exist any integer $n>1$ that for which there is a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that all $h_i$ are symmetric polynomials. [i]Proposed by Alireza Shavali[/i]

Let $M,a,b,r$ be non-negative integers with $a,r\ge 2$, and suppose there exists a function $f:\mathbb{Z}\rightarrow\mathbb{Z}$ satisfying the following conditions: (1) For all $n\in \mathbb{Z}$, $f^{(r)}(n)=an+b$ where $f^{(r)}$ denotes the composition of $r$ copies of $f$ (2) For all $n\ge M$, $f(n)\ge 0$ (3) For all $n>m>M$, $n-m|f(n)-f(m)$ Show that $a$ is a perfect $r$-th power.

Which family of elements has solid, liquid, and gaseous members at $25^{\circ} \text{C}$ and $1 \text{atm}$ pressure? $ \textbf{(A)}\hspace{.05in}\text{alkali metals (Li-Cs)} \qquad\textbf{(B)}\hspace{.05in}\text{pnictogens (N-Bi)} \qquad$ $\textbf{(C)}\hspace{.05in}\text{chalcogens (O-Te)} \qquad\textbf{(D)}\hspace{.05in}\text{halogens (F-I)}\qquad$

Let $x_0+\sqrt{2003}y_0$ be the minimum positive integer root of Pell function $x^2-2003y^2=1$. Find all the positive integer solutions $(x,y)$ of the equation, such that $x_0$ is divisible by any prime factor of $x$.

In a triangle $ABC$ we have $\angle B = 2 \cdot \angle C$ and the angle bisector drawn from $A$ intersects $BC$ in a point $D$ such that $|AB| = |CD|$. Find $\angle A$.

Prove that $2024!$ is divisible by a) $2024^2$; b) $2024^8$. ($n!=1\cdot 2 \cdot 3 \cdot ... \cdot n$) [i]Z.Smysl[/i]

Let $ABC$ be a triangle which it not right-angled. Define a sequence of triangles $A_iB_iC_i$, with $i \ge 0$, as follows: $A_0B_0C_0$ is the triangle $ABC$ and, for $i \ge 0$, $A_{i+1},B_{i+1},C_{i+1}$ are the reflections of the orthocentre of triangle $A_iB_iC_i$ in the sides $B_iC_i$,$C_iA_i$,$A_iB_i$, respectively. Assume that $\angle A_m = \angle A_n$ for some distinct natural numbers $m,n$. Prove that $\angle A = 60^{\circ}$.

The triangle $ABC$ is inscribed in a circle $w_1$. Inscribed in a triangle circle touchs the sides $BC$ in a point $N$. $w_2$ — the circle inscribed in a segment $BAC$ circle of $w_1$, and passing through a point $N$. Let points $O$ and $J$ — the centers of circles $w_2$ and an extra inscribed circle (touching side $BC$) respectively. Prove, that lines $AO$ and $JN$ are parallel.

When rolling a certain unfair six-sided die with faces numbered $1, 2, 3, 4, 5$, and $6$, the probability of obtaining face $F$ is greater than $\frac{1}{6}$, the probability of obtaining the face opposite is less than $\frac{1}{6}$, the probability of obtaining any one of the other four faces is $\frac{1}{6}$, and the sum of the numbers on opposite faces is $7$. When two such dice are rolled, the probability of obtaining a sum of $7$ is $\frac{47}{288}$. Given that the probability of obtaining face $F$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.

Let $ABC$ be an acute angled triangle with $H$ as its orthocentre. For any point $P$ on the circumcircle of triangle $ABC$, let $Q$ be the point of intersection of the line $BH$ with line $AP$. Show that there is a unique point $X$ on the circumcircle of triangle $ABC$ such that for every $P$ other than $B,C$, the circumcircle of $HPQ$ passes through $X$.

Let $r$ and $s$ be positive integers. Define $a_0 = 0$, $a_1 = 1$, and $a_n = ra_{n-1} + sa_{n-2}$ for $n \geq 2$. Let $f_n = a_1a_2\cdots a_n$. Prove that $\displaystyle\frac{f_n}{f_kf_{n-k}}$ is an integer for all integers $n$ and $k$ such that $0 < k < n$. [i]Evan O' Dorney.[/i]

Draw an equilateral triangle with center $O$. Rotate the equilateral triangle $30^\circ, 60^\circ, 90^\circ$ with respect to $O$ so there would be four congruent equilateral triangles on each other. Look at the diagram. If the smallest triangle has area $1$, the area of the original equilateral triangle could be expressed as $p+q\sqrt r$ where $p,q,r$ are positive integers and $r$ is not divisible by a square greater than $1$. Find $p+q+r$.

[u]Round 5[/u] [b]p13.[/b] Points $A, B, C$, and $D$ lie in a plane with $AB = 6$, $BC = 5$, and $CD = 5$, and $AB$ is perpendicular to $BC$. Point E lies on line $AD$ such that $D \ne E$, $AE = 3$ and $CE = 5$. Find $DE$. [b]p14.[/b] How many ordered pairs of integers $(x,y)$ are solutions to $x^2y = 36 + y$? [b]p15.[/b] Chicken nuggets come in boxes of two sizes, $a$ nuggets per box and $b$ nuggets per box. We know that $899$ nuggets is the largest number of nuggets we cannot obtain with some combination of $a$-sized boxes and $b$-sized boxes. How many different pairs $(a, b)$ are there with $a < b$? [u]Round 6[/u] [b]p16.[/b] You are playing a game with coins with your friends Alice and Bob. When all three of you flip your respective coins, the majority side wins. For example, if Alice, Bob, and you flip Heads, Tails, Heads in that order, then you win. If Alice, Bob, and you flip Heads, Heads, Tails in that order, then you lose. Notice that more than one person will “win.” Alice and Bob design their coins as follows: a value $p$ is chosen randomly and uniformly between $0$ and $1$. Alice then makes a biased coin that lands on heads with probability $p$, and Bob makes a biased coin that lands on heads with probability $1 -p$. You design your own biased coin to maximize your chance of winning without knowing $p$. What is the probability that you win? [b]p17.[/b] There are $N$ distinct students, numbered from $1$ to $N$. Each student has exactly one hat: $y$ students have yellow hats, $b$ have blue hats, and $r$ have red hats, where $y + b + r = N$ and $y, b, r > 0$. The students stand in a line such that all the $r$ people with red hats stand in front of all the $b$ people with blue hats. Anyone wearing red is standing in front of everyone wearing blue. The $y$ people with yellow hats can stand anywhere in the line. The number of ways for the students to stand in a line is $2016$. What is $100y + 10b + r$? [b]p18.[/b] Let P be a point in rectangle $ABCD$ such that $\angle APC = 135^o$ and $\angle BPD = 150^o$. Suppose furthermore that the distance from P to $AC$ is $18$. Find the distance from $P$ to $BD$. [u]Round 7 [/u] [b]p19.[/b] Let triangle $ABC$ be an isosceles triangle with $|AB| = |AC|$. Let $D$ and $E$ lie on $AB$ and $AC$, respectively. Suppose $|AD| = |BC| = |EC|$ and triangle $ADE$ is isosceles. Find the sum of all possible values of $\angle BAC$ in radians. Write your answer in the form $2 arcsin \left( \frac{a}{b}\right) + \frac{c}{d} \pi$, where $\frac{a}{b}$ and $\frac{c}{d}$ are in lowest terms, $-1 \le \frac{a}{b} \le 1$, and $-1 \le \frac{c}{d} \le 1$. [b]p20.[/b] Kevin is playing a game in which he aims to maximize his score. In the $n^{th}$ round, for $n \ge 1$, a real number between $0$ and $\frac{1}{3^n}$ is randomly generated. At each round, Kevin can either choose to have the randomly generated number from that round as his score and end the game, or he can choose to pass on the number and continue to the next round. Once Kevin passes on a number, he CANNOT claim that number as his score. Kevin may continue playing for as many rounds as he wishes. If Kevin plays optimally, the expected value of his score is $a + b\sqrt{c}$ where $a, b$, and $c$ are integers and $c$ is positive and not divisible by any positive perfect square other than $1$. What is $100a + 10b + c$? [b]p21.[/b] Lisa the ladybug (a dimensionless ladybug) lives on the coordinate plane. She begins at the origin and walks along the grid, at each step moving either right or up one unit. The path she takes ends up at $(2016, 2017)$. Define the “area” of a path as the area below the path and above the $x$-axis. The sum of areas over all paths that Lisa can take can be represented as as $a \cdot {{4033} \choose {2016}}$ . What is the remainder when $a$ is divided by $1000$? PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c4h2782871p24446475]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose $a,b,c,d$ are positive reals such that $ab+cd=1$ and $x_i,y_i$ are real numbers such that $x_i^2+y_i^2=1$ for $i=1,2,3,4$. Prove that \[(ax_1+bx_2+cx_3+dx_4)^2+(ay_4+by_3+cy_2+dy_1)^2\le 2\left(\frac{a^2+b^2}{ab}+\frac{c^2+d^2}{cd}\right).\] [i]Li Shenghong[/i]

Suppose that $a_0, a_1, \cdots $ and $b_0, b_1, \cdots$ are two sequences of positive integers such that $a_0, b_0 \ge 2$ and \[ a_{n+1} = \gcd{(a_n, b_n)} + 1, \qquad b_{n+1} = \operatorname{lcm}{(a_n, b_n)} - 1. \] Show that the sequence $a_n$ is eventually periodic; in other words, there exist integers $N \ge 0$ and $t > 0$ such that $a_{n+t} = a_n$ for all $n \ge N$.

Determine the value of $$\prod^{\infty}_{n=1} 3^{n/3^n}= \sqrt[3]{3} \sqrt[3^2]{3^2} \sqrt[3^3]{3^3} ...$$

Let $n>k \geq 1$ be integers and let $p$ be a prime dividing $\tbinom{n}{k}$. Prove that the $k$-element subsets of $\{1,\ldots,n\}$ can be split into $p$ classes of equal size, such that any two subsets with the same sum of elements belong to the same class. [i]Ankan Bhattacharya[/i]

In an infinite grid of regular triangles, Niels and Henrik are playing a game they made up. Every other time, Niels picks a triangle and writes $\times$ in it, and every other time, Henrik picks a triangle where he writes a $o$. If one of the players gets four in a row in some direction (see figure), he wins the game. Determine whether one of the players can force a victory. [img]https://cdn.artofproblemsolving.com/attachments/6/e/5e80f60f110a81a74268fded7fd75a71e07d3a.png[/img]

Let $AD$ and $BE$ be angle bisectors in triangle $ABC$. Let $x$, $y$ and $z$ be distances from point $M$, which lies on segment $DE$, from sides $BC$, $CA$ and $AB$, respectively. Prove that $z=x+y$

Find the number of ordered triplets $(a,b,c)$ of positive integers such that $a<b<c$ and $abc=2008$.