The battery life on a computer decreases at a rate proportional to the display brightness. Austin starts off his day with both his battery life and brightness at $100\%$. Whenever his battery life (expressed as a percentage) reaches a multiple of $25$, he also decreases the brightness of his display to that multiple of $25$. If left at $100\%$ brightness, the computer runs out of battery in $1$ hour. Compute the amount of time, in minutes, it takes for Austin’s computer to reach $0\%$ battery using his modified scheme.

Prove that for any positive integer $M$ there exists an integer divisible by $M$ such that the sum of its digits (in its decimal representation) is odd. (D Fomin, St Petersburg)

In a jar of red, green, and blue marbles, all but 6 are red marbles, all but 8 are green, and all but 4 are blue. How many marbles are in the jar? $\textbf{(A)}\hspace{.05in}6 \qquad \textbf{(B)}\hspace{.05in}8 \qquad \textbf{(C)}\hspace{.05in}9 \qquad \textbf{(D)}\hspace{.05in}10 \qquad \textbf{(E)}\hspace{.05in}12$

Let $ABC$ be an acute triangle with $AB<BC$. Let $I$ be the incenter of $ABC$, and let $\omega$ be the circumcircle of $ABC$. The incircle of $ABC$ is tangent to the side $BC$ at $K$. The line $AK$ meets $\omega$ again at $T$. Let $M$ be the midpoint of the side $BC$, and let $N$ be the midpoint of the arc $BAC$ of $\omega$. The segment $NT$ intersects the circumcircle of $BIC$ at $P$. Prove that $PM\parallel AK$.

Let $n$ be a positive integer, $n\geq 2$. For each $t\in \mathbb{R}$, $t\neq k\pi$, $k\in\mathbb{Z}$, we consider the numbers \[ x_n(t) = \sum_{k=1}^n k(n-k)\cos{(tk)} \textrm{ and } y_n(t) = \sum_{k=1}^n k(n-k)\sin{(tk)}. \] Prove that if $x_n(t) = y_n(t) =0$ if and only if $\tan {\frac {nt}2} = n \tan {\frac t2}$. [i]Constantin Buse[/i]

The larger of two consecutive odd integers is three times the smaller. What is their sum? $ \textbf{(A)}\ 4 \qquad \textbf{(B)}\ 8 \qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 20$

How many functions $f : f\{1, 2, 3, 4, 5\}\longrightarrow\{1, 2, 3, 4, 5\}$ satisfy $f(f(x)) = f(x)$ for all $x\in\{ 1,2, 3, 4, 5\}$?

Let $a_1 = 20$, $a_2 = 16$, and for $k \ge 3$, let $a_k = \sqrt[3]{k-a_{k-1}^3-a_{k-2}^3}$. Compute $a_1^3+a_2^3+\cdots + a_{10}^3$.

Let $Z$ be the set of all integers. Find all the function $f: Z->Z$ such that $f(4x+3y)=f(3x+y)+f(x+2y)$ For all integers $x,y$

For $m$ a positive integer, let $s(m)$ be the sum of the digits of $m$. For $n\ge 2$, let $f(n)$ be the minimal $k$ for which there exists a set $S$ of $n$ positive integers such that $s\left(\sum_{x\in X} x\right)=k$ for any nonempty subset $X\subset S$. Prove that there are constants $0<C_1<C_2$ with \[C_1 \log_{10} n \le f(n) \le C_2 \log_{10} n.\]

Find all triples $ \left(p,x,y\right)$ such that $ p^x\equal{}y^4\plus{}4$, where $ p$ is a prime and $ x$ and $ y$ are natural numbers.

Prove that there exists a set $X \subseteq \mathbb{N}$ which contains exactly 2022 elements such that for every distinct $a, b, c \in X$ the following equality: \[ \gcd(a^n+b^n, c) = 1 \] is satisfied for every positive integer $n$.

A square of side $n$ ($n$ natural) is divided into $n^2$ squares of side $1$. Each pair of "horizontal" boundary lines and each pair of "vertical" boundary lines enclose a rectangle (a square is also considered a rectangle). A rectangle has a length and a width; the width is less than or equal to the length. (a) Prove that there are $8$ rectangles of width $n - 1$. (b) Determine the number of rectangles with width $n -k$ ($0\le k \le n -1,k$ integer). (c) Determine a formula for $1^3 + 2^3 +...+ n^3$.

$\vartriangle ABC$ is divided by a straight line $BD$ into two triangles. Prove that the sum of the radii of circles inscribed in triangles $ABD$ and $DBC$ is greater than the radius of the circle inscribed in $\vartriangle ABC$.

Let $ r$ be the distance from the origion to a point $ P$ with coordinates $ x$ and $ y$. Designate the ratio $ \frac{y}{r}$ by $ s$ and the ratio $ \frac{x}{r}$ by $ c$. Then the values of $ s^2 \minus{} c^2$ are limited to the numbers: $ \textbf{(A)}\ \text{less than }{\minus{}1}\text{ are greater than }{\plus{}1}\text{, both excluded}\qquad\\ \textbf{(B)}\ \text{less than }{\minus{}1}\text{ are greater than }{\plus{}1}\text{, both included}\qquad \\ \textbf{(C)}\ \text{between }{\minus{}1}\text{ and }{\plus{}1}\text{, both excluded}\qquad \\ \textbf{(D)}\ \text{between }{\minus{}1}\text{ and }{\plus{}1}\text{, both included}\qquad \\ \textbf{(E)}\ {\minus{}1}\text{ and }{\plus{}1}\text{ only}$

Find the number of different quadruples $(a, b, c, d)$ of positive integers such that $ab =cd = a + b + c + d - 3$.

$AB=CD,AD \parallel BC$ and $AD>BC$. $\Omega$ is circumcircle of $ABCD$. Point $E$ is on $\Omega$ such that $BE \perp AD$. Prove that $AE+BC>DE$

Given the natural $n$. We shall call [i]word [/i] sequence from $n$ letters of the alphabet, and [i]distance [/i] $\rho(A, B)$ between [i]words [/i] $A=a_1a_2\dots a_n$ and $B=b_1b_2\dots b_n$ , the number of digits in which they differ (that is, the number of such $i$, for which $a_i\ne b_i$). We will say that the [i]word [/i] $C$ [i]lies [/i] between words $A$ and $B$ , if $\rho (A,B)=\rho(A,C)+\rho(C,B)$. What is the largest number of [i]words [/i] you can choose so that among any three, there is a [i]word lying[/i] between the other two?

Let $A,B,C$ be fixed points in the plane , and $D$ be a variable point on the circle $ABC$, distinct from $A,B,C$ . Let $I_{A},I_{B},I_{C},I_{D}$ be the Simson lines of $A,B,C,D$ with respect to triangles $BCD,ACD,ABD,ABC$ respectively. Find the locus of the intersection points of the four lines $I_{A},I_{B},I_{C},I_{D}$ when point $D$ varies.

Let $ABCDA'B'C'D'$ be a right parallelepiped, $E$ and $F$ the projections of $A$ on the lines $A'D$, $A'C$, respectively, and $P, Q$ the projections of $B'$ on the lines $A'C'$ and $A'C$ Prove that a) the planes $(AEF)$ and $(B'PQ)$ are parallel b) the triangles $AEF$ and $B'PQ$ are similar.

In a small pond there are eleven lily pads in a row labeled $0$ through $10$. A frog is sitting on pad $1$. When the frog is on pad $N$, $0<N<10$, it will jump to pad $N-1$ with probability $\frac{N}{10}$ and to pad $N+1$ with probability $1-\frac{N}{10}$. Each jump is independent of the previous jumps. If the frog reaches pad $0$ it will be eaten by a patiently waiting snake. If the frog reaches pad $10$ it will exit the pond, never to return. What is the probability that the frog will escape being eaten by the snake? $ \textbf {(A) } \frac{32}{79} \qquad \textbf {(B) } \frac{161}{384} \qquad \textbf {(C) } \frac{63}{146} \qquad \textbf {(D) } \frac{7}{16} \qquad \textbf {(E) } \frac{1}{2} $

The third-degree polynomial $P(x)=x^3+2x^2-3x-5$ has the three roots $a$, $b$ and $c$. State a third degree polynomial with roots $\frac{1}{a}$, $\frac{1}{b}$ and $\frac{1}{c}$.

A tennis player computes her win ratio by dividing the number of matches she has won by the total number of matches she has played. At the start of a weekend, her win ratio is exactly $.500$. During the weekend, she plays four matches, winning three and losing one. At the end of the weekend, her win ratio is greater than $.503$. What's the largest number of matches she could've won before the weekend began?

Given a finite sequence of real numbers $a_1,a_2,...,a_n$ such that $$a_1 + a_2 + ... + a_n > 0.$$ Prove that there is at least one index $ i$ such that $$a_i > 0, a_i + a_{i+1} > 0, ..., a_i + a_{i+1} + ...+ a_n > 0.$$

In $\triangle{ABC}$ with side lengths $AB = 13$, $AC = 12$, and $BC = 5$, let $O$ and $I$ denote the circumcenter and incenter, respectively. A circle with center $M$ is tangent to the legs $AC$ and $BC$ and to the circumcircle of $\triangle{ABC}$. What is the area of $\triangle{MOI}$? $\textbf{(A)}\ 5/2\qquad\textbf{(B)}\ 11/4\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 13/4\qquad\textbf{(E)}\ 7/2$