[b]p1.[/b] Alan leaves home when the clock in his cardboard box says $7:35$ AM and his watch says $7:41$ AM. When he arrives at school, his watch says $7:47$ AM and the $7:45$ AM bell rings. Assuming the school clock, the watch, and the home clock all go at the same rate, how many minutes behind the school clock is the home clock? [b]p2.[/b] Compute $$\left( \frac{2012^{2012-2013} + 2013}{2013} \right) \times 2012.$$ Express your answer as a mixed number. [b]p3.[/b] What is the last digit of $$2^{3^{4^{5^{6^{7^{8^{9^{...^{2013}}}}}}}}} ?$$ [b]p4.[/b] Let $f(x)$ be a function such that $f(ab) = f(a)f(b)$ for all positive integers $a$ and $b$. If $f(2) = 3$ and $f(3) = 4$, find $f(12)$. [b]p5.[/b] Circle $X$ with radius $3$ is internally tangent to circle $O$ with radius $9$. Two distinct points $P_1$ and $P_2$ are chosen on $O$ such that rays $\overrightarrow{OP_1}$ and $\overrightarrow{OP_2}$ are tangent to circle $X$. What is the length of line segment $P_1P_2$? [b]p6.[/b] Zerglings were recently discovered to use the same $24$-hour cycle that we use. However, instead of making $12$-hour analog clocks like humans, Zerglings make $24$-hour analog clocks. On these special analog clocks, how many times during $ 1$ Zergling day will the hour and minute hands be exactly opposite each other? [b]p7.[/b] Three Small Children would like to split up $9$ different flavored Sweet Candies evenly, so that each one of the Small Children gets $3$ Sweet Candies. However, three blind mice steal one of the Sweet Candies, so one of the Small Children can only get two pieces. How many fewer ways are there to split up the candies now than there were before, assuming every Sweet Candy is different? [b]p8.[/b] Ronny has a piece of paper in the shape of a right triangle $ABC$, where $\angle ABC = 90^o$, $\angle BAC = 30^o$, and $AC = 3$. Holding the paper fixed at $A$, Ronny folds the paper twice such that after the first fold, $\overline{BC}$ coincides with $\overline{AC}$, and after the second fold, $C$ coincides with $A$. If Ronny initially marked $P$ at the midpoint of $\overline{BC}$, and then marked $P'$ as the end location of $P$ after the two folds, find the length of $\overline{PP'}$ once Ronny unfolds the paper. [b]p9.[/b] How many positive integers have the same number of digits when expressed in base $3$ as when expressed in base $4$? [b]p10.[/b] On a $2 \times 4$ grid, a bug starts at the top left square and arbitrarily moves north, south, east, or west to an adjacent square that it has not already visited, with an equal probability of moving in any permitted direction. It continues to move in this way until there are no more places for it to go. Find the expected number of squares that it will travel on. Express your answer as a mixed number. PS. You had better use hide for answers.

Let be some rational numbers with the property that their sum, as well as the product of any two of them is integer. Prove that all these are integers.

Consider the set $A=\{1,2,...,120\}$ and $M$ a subset of $A$ such that $|M|=30$.Prove that there are $5$ different subsets of $M$,each of them having two elements,such that the absolute value of the difference of the elements of each subset is the same.

The function $f : N \to N$ is defined by $f(n) = n + S(n)$, where $S(n)$ is the sum of digits in the decimal representation of positive integer $n$. a) Prove that there are infinitely many numbers $a \in N$ for which the equation $f(x) = a$ has no natural roots. b) Prove that there are infinitely many numbers $a \in N$ for which the equation $f(x) = a$ has at least two distinct natural roots. (I. Voronovich)

For a positive integer $m$, prove that the number of pairs of positive integers $(x,y)$ which satisfies the following two conditions is even or $0$. (i): $x^2-3y^2+2=16m$ (ii): $2y \le x-1$

Find all triplets of nonnegative integers $(x, y, z)$ that satisfy: $x^2-3y^2=y^2-3z^2=22$.

Determine all $f:\mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ such that $f(m)\geq m$ and $f(m+n) \mid f(m)+f(n)$ for all $m,n\in \mathbb{Z}^+$

A magician wants to demonstrate the following trick to an audience of $n \ge 16$ people. He gives them $15$ hats and after giving instructions to his assistant (which the audience does not hear), leaves the hall. Some $15$ people in the audience put on one of the hats. The assistant tags in front of everyone, one of the hats with a marker and then the person with an unmarked hat takes it off. The magician then returns back to the hall and after surveying the situation, knows who in the audience has taken off his hat. For what $n$ is this possible? [hide=original wording]Магьосник иска да покаже следния фокус пред публика от $n \ge 16$ души. Той им дава $15$ шапки и след като даде инструкции на помощника си (които публиката не чува), напуска залата. Някои $15$ души от публиката си слагат по една от шапките. Асистентът маркира пред всички една от шапките с маркер и след това човек с немаркирана шапка си я сваля. След това магьосникът се връща обратно в залата и след оглед на ситуацията познава кой от публиката си е свалил шапката. За кои $n$ е възможно това?[/hide]

the positive divisors $d_1,d_2,\cdots,d_k$ of a positive integer $n$ are ordered \[1=d_1<d_2<\cdots<d_k=n\] Suppose $d_7^2+d_{15}^2=d_{16}^2$. Find all possible values of $d_{17}$.

[b]p1.[/b] Alex and Sam have a friend Pat, who is younger than they are. Alex, Sam and Pat all share a birthday. When Pat was born, Alex’s age times Sam’s age was $42$. Now Pat’s age is $33$ and Alex’s age is a prime number. How old is Sam now? Show your work and justify your answer. (All ages are whole numbers.) [b]p2.[/b] Let $ABCD$ be a square with side length $2$. The four sides of $ABCD$ are diameters of four semicircles, each of which lies inside the square. The set of all points which lie on or inside two of these semicircles is a four petaled flower. Find (with proof) the area of this flower. [img]https://cdn.artofproblemsolving.com/attachments/5/5/bc724b9f74c3470434c322020997a533986d33.png[/img] [b]p3.[/b] A prime number is called [i]strongly prime[/i] if every integer obtained by permuting its digits is also prime. For example $113$ is strongly prime, since $113$, $131$, and $311$ are all prime numbers. Prove that there is no strongly prime number such that each of the digits $1, 3, 7$, and $9$ appears at least once in its decimal representation. [b]p4.[/b] Suppose $n$ is a positive integer. Let an be the number of permutations of $1, 2, . . . , n$, where $i$ is not in the $i$-th position, for all $i$ with $1 \le i \le n$. For example $a_3 = 2$, where the two permutations that are counted are $231$, and $312$. Let bn be the number of permutations of $1, 2, . . . , n$, where no $i$ is followed by $i + 1$, for all $i$ with $1 \le i \le n - 1$. For example $b_3 = 3$, where the three permutations that are counted are $132$, $213$, and $321$. For every $n \ge 1$, find (with proof) a simple formula for $\frac{a_{n+1}}{b_n}$. Your formula should not involve summations. Use your formula to evaluate $\frac{a_{2020}}{b_{2019}}$. [b]p5.[/b] Let $n \ge 2$ be an integer and $a_1, a_2, ... , a_n$ be positive real numbers such that $a_1 + a_2 +... + a_n = 1$. Prove that $$\sum^n_{k=1}\frac{a_k}{1 + a_{k+1} - a_{k-1}}\ge 1.$$ (Here $a_0 = a_n$ and $a_{n+1} = a_1$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all natural numbers $ n $ for which there exists two natural numbers $ a,b $ such that $$ n=S(a)=S(b)=S(a+b) , $$ where $ S(k) $ denotes the sum of the digits of $ k $ in base $ 10, $ for any natural number $ k. $ [i]Vasile Zidaru[/i] and [i]Mircea Lascu[/i]

A sequence of positive integer numbers $a_1,a_2,\ldots$ for $i \geq 3$ satisfies $$a_{i+1}=a_i+gcd(a_{i-1},a_{i-2})$$ Prove that there exist two positive integer numbers $N, M$, such that $a_{n+1}-a_n=M$ for all $n \geq N$

Define $f\left(n\right)=\textrm{LCM}\left(1,2,\ldots,n\right)$. Determine the smallest positive integer $a$ such that $f\left(a\right)=f\left(a+2\right)$. [i]2017 CCA Math Bonanza Lightning Round #2.4[/i]

Determine the greatest number with $n$ digits in the decimal representation which is divisible by $429$ and has the sum of all digits less than or equal to $11$.

Determine all positive integers $n>2$, such that $n = a^3 + b^3$, where $a$ is the smallest positive divisor of $n$ greater than $1$ and $b$ is an arbitrary positive divisor of $n$.

Given a positive integer whose base-$10$ representation is $\overline{d_k\ldots d_0}$ for some integer $k \geq 0$, where $d_k \neq 0$, a move consists of selecting some integers $0 \leq i \leq j \leq k$, such that the digits $d_j,\ldots,d_i$ are not all $0$, erasing them from $n$, and replacing them with a divisor of $\overline{d_j\ldots d_i}$ (this divisor need not have the same number of digits as $\overline{d_j\ldots d_i}$). Prove that for all sufficiently large even integers $n$, we may apply some sequence of moves to $n$ to transform it into $2024$. [i]Allen Wang[/i]

Determine all positive integers $n$ such that all positive integers less than $n$ and coprime to $n$ are powers of primes.

Prove that there are infinitely many primes representable in the form $m^2+mn+n^2$ for some integers $m,n$ .

Find all natural numbers $ n$,such that there exist $ x_1,x_2,\dots,x_{n\plus{}1}\in\mathbb{N}$,such that $ \frac{1}{x_1^2}\plus{}\frac{1}{x_2^2}\plus{}\dots\plus{}\frac{1}{x_n^2}\equal{}\frac{n\plus{}1}{x_{n\plus{}1}^2}$.

Find all triples $(p, q, r)$ of prime numbers for which $4q - 1$ is a prime number and $$\frac{p + q}{p + r} = r - p$$ holds. [i](Walther Janous)[/i]

Let $ x, y, z$ be positive real numbers such that $ x^n, y^n$ and $ z^n$ are side lengths of some triangle for all positive integers $ n$. Prove that at least two of x, y and z are equal.

Let $n$ be a positive integer and $f(x)=a_mx^m+\ldots + a_1X+a_0$, with $m\ge 2$, a polynomial with integer coefficients such that: a) $a_2,a_3\ldots a_m$ are divisible by all prime factors of $n$, b) $a_1$ and $n$ are relatively prime. Prove that for any positive integer $k$, there exists a positive integer $c$, such that $f(c)$ is divisible by $n^k$.

The positive integer $ n $ verifies $$\frac{1}{1\cdot(\sqrt{2}+\sqrt{1})+\sqrt{1}}+\frac{1}{2\cdot(\sqrt{3}+\sqrt{2})+\sqrt{2}}+\cdots+\frac{1}{n\cdot(\sqrt{n+1}+\sqrt{n})+\sqrt{n}}=\frac{2022}{2023}.$$ Find the sum of digits of number $ n $.

Find the greatest positive integer $m$ with the following property: For every permutation $a_1, a_2, \cdots, a_n,\cdots$ of the set of positive integers, there exists positive integers $i_1<i_2<\cdots <i_m$ such that $a_{i_1}, a_{i_2}, \cdots, a_{i_m}$ is an arithmetic progression with an odd common difference.

Let $ABCDE$ be a pentagon inscribed in a circle such that $AB=CD=3$, $BC=DE=10$, and $AE=14$. The sum of the lengths of all diagonals of $ABCDE$ is equal to $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$? $\textbf{(A) }129\qquad \textbf{(B) }247\qquad \textbf{(C) }353\qquad \textbf{(D) }391\qquad \textbf{(E) }421\qquad$