[u]Round 5[/u] [b]p13.[/b] A unit square is rotated $30^o$ counterclockwise about one of its vertices. Determine the area of the intersection of the original square with the rotated one. [b]p14.[/b] Suppose points $A$ and $B$ lie on a circle of radius $4$ with center $O$, such that $\angle AOB = 90^o$. The perpendicular bisectors of segments $OA$ and $OB$ divide the interior of the circle into four regions. Find the area of the smallest region. [b]p15.[/b] Let $ABCD$ be a quadrilateral such that $AB = 4$, $BC = 6$, $CD = 5$, $DA = 3$, and $\angle DAB = 90^o$. There is a point $I$ inside the quadrilateral that is equidistant from all the sides. Find $AI$. [u]Round 6[/u] [i]The answer to each of the three questions in this round depends on the answer to one of the other questions. There is only one set of correct answers to these problems; however, each question will be scored independently, regardless of whether the answers to the other questions are correct. [/i] [b]p16.[/b] Let $C$ be the answer to problem $18$. Compute $$\left( 1 - \frac{1}{2^2} \right) \left( 1 - \frac{1}{3^2} \right) ... \left( 1 - \frac{1}{C^2} \right).$$ [b]p17.[/b] Let $A$ be the answer to problem $16$. Let $PQRS$ be a square, and let point $M$ lie on segment $PQ$ such that $MQ = 7PM$ and point $N$ lie on segment $PS$ such that $NS = 7PN$. Segments $MS$ and $NQ$ meet at point $X$. Given that the area of quadrilateral $PMXN$ is $A - \frac12$, find the side length of the square. [b]p18.[/b] Let $B$ be the answer to problem $17$ and let $N = 6B$. Find the number of ordered triples $(a, b, c)$ of integers between $0$ and $N - 1$, inclusive, such that $a + b + c$ is divisible by $N$. [u]Round 7[/u] [b]p19.[/b] Let $k$ be the units digit of $\underbrace{7^{7^{7^{7^{7^{7^{7}}}}}}}_{Seven \,\,7s}$ . What is the largest prime factor of the number consisting of $k$ $7$’s written in a row? [b]p20.[/b] Suppose that $E = 7^7$ , $M = 7$, and $C = 7·7·7$. The characters $E, M, C, C$ are arranged randomly in the following blanks. $$... \times ... \times ... \times ... $$ Then one of the multiplication signs is chosen at random and changed to an equals sign. What is the probability that the resulting equation is true? [b]p21[/b]. During a recent math contest, Sophy Moore made the mistake of thinking that $133$ is a prime number. Fresh Mann replied, “To test whether a number is divisible by $3$, we just need to check whether the sum of the digits is divisible by $3$. By the same reasoning, to test whether a number is divisible by $7$, we just need to check that the sum of the digits is a multiple of $7$, so $133$ is clearly divisible by $7$.” Although his general principle is false, $133$ is indeed divisible by $7$. How many three-digit numbers are divisible by $7$ and have the sum of their digits divisible by $7$? [u]Round 8[/u] [b]p22.[/b] A [i]look-and-say[/i] sequence is defined as follows: starting from an initial term $a_1$, each subsequent term $a_k$ is found by reading the digits of $a_{k-1}$ from left to right and specifying the number of times each digit appears consecutively. For example, $4$ would be succeeded by $14$ (“One four.”), and $31337$ would be followed by $13112317$ (“One three, one one, two three, one seven.”) If $a_1$ is a random two-digit positive integer, find the probability that $a_4$ is at least six digits long. [b]p23.[/b] In triangle $ABC$, $\angle C = 90^o$. Point $P$ lies on segment $BC$ and is not $B$ or $C$. Point $I$ lies on segment $AP$, and $\angle BIP = \angle PBI = \angle CAB$. If $\frac{AP}{BC} = k$, express $\frac{IP}{CP}$ in terms of $k$. [b]p24.[/b] A subset of $\{1, 2, 3, ... , 30\}$ is called [i]delicious [/i] if it does not contain an element that is $3$ times another element. A subset is called super delicious if it is delicious and no delicious set has more elements than it has. Determine the number of super delicious subsets. PS. You sholud use hide for answers. First rounds have been posted [url=https://artofproblemsolving.com/community/c4h2784267p24464980]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For a positive integer \( n \), let \( \tau(n) \) denote the number of positive divisors of \( n \). Determine whether there exists a positive integer triple \( a, b, c \) such that there are exactly $1012$ positive integers \( K \) not greater than $2024$ that satisfies the following: the equation \[ \tau(x) = \tau(y) = \tau(z) = \tau(ax + by + cz) = K \] holds for some positive integers $x,y,z$.

What is the smallest positive integer $n$ such that $2016n$ is a perfect cube?

[b]p1.[/b] If the pairwise sums of the three numbers $x$, $y$, and $z$ are $22$, $26$, and $28$, what is $x + y + z$? [b]p2.[/b] Suhas draws a quadrilateral with side lengths $7$, $15$, $20$, and $24$ in some order such that the quadrilateral has two opposite right angles. Find the area of the quadrilateral. [b]p3.[/b] Let $(n)*$ denote the sum of the digits of $n$. Find the value of $((((985^{998})*)*)*)*$. [b]p4.[/b] Everyone wants to know Andy's locker combination because there is a golden ticket inside. His locker combination consists of 4 non-zero digits that sum to an even number. Find the number of possible locker combinations that Andy's locker can have. [b]p5.[/b] In triangle $ABC$, $\angle ABC = 3\angle ACB$. If $AB = 4$ and $AC = 5$, compute the length of $BC$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a natural number such that $n!$ is a multiple of $2023$ and is not divisible by $37$. Find the largest power of $11$ that divides $n!$.

Let $ m \equal{} 2007^{2008}$, how many natural numbers n are there such that $ n < m$ and $ n(2n \plus{} 1)(5n \plus{} 2)$ is divisible by $ m$ (which means that $ m \mid n(2n \plus{} 1)(5n \plus{} 2)$) ?

$P(x)$ is a nonzero polynomial with integer coefficients. Prove that there exists infinitely many prime numbers $q$ such that for some natural number $n$, $q|2^n+P(n)$. [i]Proposed by Mohammad Gharakhani[/i]

Let $P(x)$ be a polynomial with rational coefficients such that $P(n)$ is integer for all integers $n$. Moreover: $gcd(P(1), \ldots , P(k), \ldots) = 1$. Prove that every integer $k$ can be represented in infinitely many ways of the form $\pm P(1) \pm P(2) \pm \ldots \pm P(m)$, for some positive integer $m$ and certain choices of $\pm$.

[b]a)[/b] Find all solutions of the equation $p^2+q^2+r^2=pqr$, where $p,q,r$ are positive primes.\\ [b]b)[/b] Show that for every positive integer $N$, there exist three integers $a,b,c\geq N$ with $a^2+b^2+c^2=abc$.

Archimedes planned to count all of the prime numbers between $2$ and $1000$ using the Sieve of Eratosthenes as follows: (a) List the integers from $2$ to $1000$. (b) Circle the smallest number in the list and call this $p$. (c) Cross out all multiples of $p$ in the list except for $p$ itself. (d) Let $p$ be the smallest number remaining that is neither circled nor crossed out. Circle $p$. (e) Repeat steps $(c)$ and $(d)$ until each number is either circled or crossed out. At the end of this process, the circled numbers are prime and the crossed out numbers are composite. Unfortunately, while crossing out the multiples of $2$, Archimedes accidentally crossed out two odd primes in addition to crossing out all the even numbers (besides $2$). Otherwise, he executed the algorithm correctly. If the number of circled numbers remaining when Archimedes finished equals the number of primes from $2$ to $1000$ (including $2$), then what is the largest possible prime that Archimedes accidentally crossed out?

For any integer $d > 0,$ let $f(d)$ be the smallest possible integer that has exactly $d$ positive divisors (so for example we have $f(1)=1, f(5)=16,$ and $f(6)=12$). Prove that for every integer $k \geq 0$ the number $f\left(2^k\right)$ divides $f\left(2^{k+1}\right).$ [i]Proposed by Suhaimi Ramly, Malaysia[/i]

We say that a polynomial $p$ is respectful if $\forall x, y \in Z$, $y - x$ divides $p(y) - p(x)$, and $\forall x \in Z$, $p(x) \in Z$. We say that a respectful polynomial is disguising if it is nonzero, and all of its non-zero coefficients lie between $0$ and $ 1$, exclusive. Determine $\sum deg(f)\cdot f(2)$, where the sum includes all disguising polynomials $f$ of degree at most $5$.

Maya lists all the positive divisors of $ 2010^2$. She then randomly selects two distinct divisors from this list. Let $ p$ be the probability that exactly one of the selected divisors is a perfect square. The probability $ p$ can be expressed in the form $ \frac{m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$.

Prove that there exists an integer $n \geq 1$, such that number of all pairs $(a, b)$ of positive integers, satisfying $$\frac{1}{a-b}-\frac{1}{a}+\frac{1}{b}=\frac{1}{n}$$ exceeds $2024.$

Let a sequence of integers $a_0, a_1, a_2, \cdots, a_{2010}$ such that $a_0 = 1$ and $2011$ divides $a_{k-1}a_k - k$ for all $k = 1, 2, \cdots, 2010$. Prove that $2011$ divides $a_{2010} + 1$.

Given nine positive integers, is it always possible to choose four different numbers $a,b,c,d$ such that $a+b$ and $c+d$ are congruent modulo $20$?

It is given that $n$ and $\sqrt{12n^2+1}$ are both positive integers. Prove that: $$ \sqrt{ \frac{\sqrt{12n^2+1}+1}{2}} $$ is also positive integer.

For any positive integer $k$ define $f_1(k)$ as the square of the digital sum of $k$ in the decimal system, and $f_{n}(k)=f_1(f_{n-1}(k))$ $\forall n>1$. Compute $f_{1992}(2^{1991})$.

Let $n$ be a positive integer. Each number $1, 2, ..., 1000$ has been colored with one of $n$ colours. Each two numbers , such that one is a divisor of second of them, are colored with different colours. Determine minimal number $n$ for which it is possible.

For which integers $n\ge 2$ can the numbers $1$ to $16$ be written each in one square of a squared $4\times 4$ paper such that the $8$ sums of the numbers in rows and columns are all different and divisible by $n$?

For each positive integer $n$, let an be the smallest nonnegative integer such that there is only one positive integer at most $n$ that is relatively prime to all of $n$, $n + 1$, .. , $n + a_n$. If $n < 100$, compute the largest possible value of $n - a_n$.

Find all functions $g:\mathbb{N}\rightarrow\mathbb{N}$ such that \[\left(g(m)+n\right)\left(g(n)+m\right)\] is a perfect square for all $m,n\in\mathbb{N}.$ [i]Proposed by Gabriel Carroll, USA[/i]

$\mathbb{N}$ is the set of positive integers and $a\in\mathbb{N}$. We know that for every $n\in\mathbb{N}$, $4(a^n+1)$ is a perfect cube. Prove that $a=1$.

Determine all the pairs of positive integers $(a,b),$ such that $$14\varphi^2(a)-\varphi(ab)+22\varphi^2(b)=a^2+b^2,$$ where $\varphi(n)$ is Euler's totient function.

Find all natural numbers $n$ for which both $n^n + 1$ and $(2n)^{2n} + 1$ are prime numbers.