For any natural number, let $S(n)$ denote sum of digits of $n$. Find the number of $3$ digit numbers for which $S(S(n)) = 2$.

Ted's favorite number is equal to \[1\cdot\binom{2007}1+2\cdot\binom{2007}2+3\cdot\binom{2007}3+\cdots+2007\cdot\binom{2007}{2007}.\] Find the remainder when Ted's favorite number is divided by $25$. $\begin{array}{@{\hspace{-1em}}l@{\hspace{14em}}l@{\hspace{14em}}l} \textbf{(A) }0&\textbf{(B) }1&\textbf{(C) }2\\\\ \textbf{(D) }3&\textbf{(E) }4&\textbf{(F) }5\\\\ \textbf{(G) }6&\textbf{(H) }7&\textbf{(I) }8\\\\ \textbf{(J) }9&\textbf{(K) }10&\textbf{(L) }11\\\\ \textbf{(M) }12&\textbf{(N) }13&\textbf{(O) }14\\\\ \textbf{(P) }15&\textbf{(Q) }16&\textbf{(R) }17\\\\ \textbf{(S) }18&\textbf{(T) }19&\textbf{(U) }20\\\\ \textbf{(V) }21&\textbf{(W) }22 & \textbf{(X) }23\\\\ \textbf{(Y) }24 \end{array}$

[hide=Intro]The answers to each of the ten questions in this section are integers containing only the digits $ 1$ through $ 8$, inclusive. Each answer can be written into the grid on the answer sheet, starting from the cell with the problem number, and continuing across or down until the entire answer has been written. Answers may cross dark lines. If the answers are correctly filled in, it will be uniquely possible to write an integer from $ 1$ to $ 8$ in every cell of the grid, so that each number will appear exactly once in every row, every column, and every marked $2$ by $4$ box. You will get $7$ points for every correctly filled answer, and a $15$ point bonus for filling in every gridcell. It will help to work back and forth between the grid and the problems, although every problem is uniquely solvable on its own. Please write clearly within the boxes. No points will be given for a cell without a number, with multiple numbers, or with illegible handwriting.[/hide] [img]https://cdn.artofproblemsolving.com/attachments/9/b/f4db097a9e3c2602b8608be64f06498bd9d58c.png[/img] [b]1 ACROSS:[/b] Jack puts $ 10$ red marbles, $ 8$ green marbles and 4 blue marbles in a bag. If he takes out $11$ marbles, what is the expected number of green marbles taken out? [b]2 DOWN:[/b] What is the closest integer to $6\sqrt{35}$ ? [b]3 ACROSS: [/b]Alan writes the numbers $ 1$ to $64$ in binary on a piece of paper without leading zeroes. How many more times will he have written the digit $ 1$ than the digit $0$? [b]4 ACROSS:[/b] Integers a and b are chosen such that $-50 < a, b \le 50$. How many ordered pairs $(a, b)$ satisfy the below equation? $$(a + b + 2)(a + 2b + 1) = b$$ [b]5 DOWN: [/b]Zach writes the numbers $ 1$ through $64$ in binary on a piece of paper without leading zeroes. How many times will he have written the two-digit sequence “$10$”? [b]6 ACROSS:[/b] If you are in a car that travels at $60$ miles per hour, $\$1$ is worth $121$ yen, there are $8$ pints in a gallon, your car gets $10$ miles per gallon, a cup of coffee is worth $\$2$, there are 2 cups in a pint, a gallon of gas costs $\$1.50$, 1 mile is about $1.6$ kilometers, and you are going to a coffee shop 32 kilometers away for a gallon of coffee, how much, in yen, will it cost? [b]7 DOWN:[/b] Clive randomly orders the letters of “MIXING THE LETTERS, MAN”. If $\frac{p}{m^nq}$ is the probability that he gets “LMT IS AN EXTREME THING” where p and q are odd integers, and $m$ is a prime number, then what is $m + n$? [b]8 ACROSS:[/b] Joe is playing darts. A dartboard has scores of $10, 7$, and $4$ on it. If Joe can throw $12$ darts, how many possible scores can he end up with? [b]9 ACROSS:[/b] What is the maximum number of bounded regions that $6$ overlapping ellipses can cut the plane into? [b]10 DOWN:[/b] Let $ABC$ be an equilateral triangle, such that $A$ and $B$ both lie on a unit circle with center $O$. What is the maximum distance between $O$ and $C$? Write your answer be in the form $\frac{a\sqrt{b}}{c}$ where $b$ is not divisible by the square of any prime, and $a$ and $c$ share no common factor. What is $abc$ ? PS. You had better use hide for answers.

Let $p$, $q$ be two distinct prime numbers and $n$ be a natural number, such that $pq$ divides $n^{pq}+1$. Prove that, if $p^3 q^3$ divides $n^{pq}+1$, then $p^2$ or $q^2$ divides $n+1$.

Find the greatest positive integer $n$ for which there exist $n$ nonnegative integers $x_1, x_2,\ldots , x_n$, not all zero, such that for any $\varepsilon_1, \varepsilon_2, \ldots, \varepsilon_n$ from the set $\{-1, 0, 1\}$, not all zero, $\varepsilon_1 x_1 + \varepsilon_2 x_2 + \cdots + \varepsilon_n x_n$ is not divisible by $n^3$.

For any positive integer $n$, let $r_n$ denote the greatest odd divisor of $n$. Compute $T =r_{100}+ r_{101} + r_{102}+...+r_{200}$

Given is a permutation of $1, 2, \ldots, 2023, 2024$ and two positive integers $a, b$, such that for any two adjacent numbers, at least one of the following conditions hold: 1) their sum is $a$; 2) the absolute value of their difference is $b$. Find all possible values of $b$.

Find all 2-digit numbers$ n$ having the property: 'Number $n^2$ is 4-digit number of form $\overline{xxyy}$.

An integer $n$ is called $k$-special, with $k$ a positive integer, if it's the sum of the squares of $k$ consecutive integers. For example, $13$ is $2$-special, since $13=2^2+3^2$, and $2$ is $3$-special, since $2=(-1)^2+0^2+1^2$. a) Prove that there's no perfect square that is $4$-special. b) Find a perfect square that is $I^2$-special, for some odd positive integer $I$ with $I\ge 3$.

Let $p$ be a prime. It is given that there exists a unique nonconstant function $\chi:\{1,2,\ldots, p-1\}\to\{-1,1\}$ such that $\chi(1) = 1$ and $\chi(mn) = \chi(m)\chi(n)$ for all $m, n \not\equiv 0 \pmod p$ (here the product $mn$ is taken mod $p$). For how many positive primes $p$ less than $100$ is it true that \[\sum_{a=1}^{p-1}a^{\chi(a)}\equiv 0\pmod p?\] Here as usual $a^{-1}$ denotes multiplicative inverse. [i]Proposed by David Altizio[/i]

Find all 4-tuples $(a,b,c,n)$ of naturals such that $n^a + n^b = n^c$

Does there exists a base in which the numbers of the form: \[ 10101, 101010101, 1010101010101,\cdots \] are all prime numbers?

$ x^2 \plus{} y^2 \plus{} z^2 \equal{} 1993$ then prove $ x \plus{} y \plus{} z$ can't be a perfect square:

[u]Round 1 [/u] [b]p1.[/b] Ben the bear has an algorithm he runs on positive integers- each second, if the integer is even, he divides it by $2$, and if the integer is odd, he adds $1$. The algorithm terminates after he reaches $1$. What is the least positive integer n such that Ben's algorithm performed on n will terminate after seven seconds? (For example, if Ben performed his algorithm on $3$, the algorithm would terminate after $3$ seconds: $3 \to 4 \to 2 \to 1$.) [b]p2.[/b] Suppose that a rectangle $R$ has length $p$ and width $q$, for prime integers $p$ and $q$. Rectangle $S$ has length $p + 1$ and width $q + 1$. The absolute difference in area between $S$ and $R$ is $21$. Find the sum of all possible values of $p$. [b]p3.[/b] Owen the origamian takes a rectangular $12 \times 16$ sheet of paper and folds it in half, along the diagonal, to form a shape. Find the area of this shape. [u]Round 2[/u] [b]p4.[/b] How many subsets of the set $\{G, O, Y, A, L, E\}$ contain the same number of consonants as vowels? (Assume that $Y$ is a consonant and not a vowel.) [b]p5.[/b] Suppose that trapezoid $ABCD$ satisfies $AB = BC = 5$, $CD = 12$, and $\angle ABC = \angle BCD = 90^o$. Let $AC$ and $BD$ intersect at $E$. The area of triangle $BEC$ can be expressed as $\frac{a}{b}$, for positive integers $a$ and $b$ with $gcd(a, b) = 1$. Find $a + b$. [b]p6.[/b] Find the largest integer $n$ for which $\frac{101^n + 103^n}{101^{n-1} + 103^{n-1}}$ is an integer. [u]Round 3[/u] [b]p7.[/b] For each positive integer n between $1$ and $1000$ (inclusive), Ben writes down a list of $n$'s factors, and then computes the median of that list. He notices that for some $n$, that median is actually a factor of $n$. Find the largest $n$ for which this is true. [b]p8.[/b] ([color=#f00]voided[/color]) Suppose triangle $ABC$ has $AB = 9$, $BC = 10$, and $CA = 17$. Let $x$ be the maximal possible area of a rectangle inscribed in $ABC$, such that two of its vertices lie on one side and the other two vertices lie on the other two sides, respectively. There exist three rectangles $R_1$, $R_2$, and $R_3$ such that each has an area of $x$. Find the area of the smallest region containing the set of points that lie in at least two of the rectangles $R_1$, $R_2$, and $R_3$. [b]p9.[/b] Let $a, b,$ and $c$ be the three smallest distinct positive values of $\theta$ satisfying $$\cos \theta + \cos 3\theta + ... + \cos 2021\theta = \sin \theta+ \sin 3 \theta+ ... + \sin 2021\theta. $$ What is $\frac{4044}{\pi}(a + b + c)$? [color=#f00]Problem 8 is voided. [/color] PS. You should use hide for answers.Rounds 4-5 have been posted [url=https://artofproblemsolving.com/community/c4h3131422p28368457]here [/url] and 6-7 [url=https://artofproblemsolving.com/community/c4h3131434p28368604]here [/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $P(x)$ denote the polynomial \[3\sum_{k=0}^{9}x^k + 2\sum_{k=10}^{1209}x^k + \sum_{k=1210}^{146409}x^k.\]Find the smallest positive integer $n$ for which there exist polynomials $f,g$ with integer coefficients satisfying $x^n - 1 = (x^{16} + 1)P(x) f(x) + 11\cdot g(x)$. [i]Victor Wang.[/i]

Let $a , b , c$ positive integers, coprime. For each whole number $n \ge 1$, we denote by $s ( n )$ the number of elements in the set $\{ a , b , c \}$ that divide $n$. We consider $k_1< k_2< k_3<...$ .the sequence of all positive integers that are divisible by some element of $\{ a , b , c \}$. Finally we define the characteristic sequence of $( a , b , c )$ like the succession $ s ( k_1) , s ( k_2) , s ( k_3) , .... $ . Prove that if the characteristic sequences of $( a , b , c )$ and $( a', b', c')$ are equal, then $a = a', b = b'$ and $c=c'$

Let $A$ be an infinite subset of $\mathbb{N}$, and $n$ a fixed integer. For any prime $p$ not dividing $n$, There are infinitely many elements of $A$ not divisible by $p$. Show that for any integer $m >1, (m,n) =1$, There exist finitely many elements of $A$, such that their sum is congruent to 1 modulo $m$ and congruent to 0 modulo $n$.

On the board is written a number with nine non-zero and distinct digits. Prove that we can delete at most seven digits so that the number formed by the digits left to be a perfect square.

Prove that a positive integer of the form $n^4 +1$ can have more than $1000$ divisors of the form $a^4 +1$ with integral $a$.

What is the last digit of $777^{777}$?

Find all pairs of positive integers $(x,y) $ for which $x^3 + y^3 = 4(x^2y + xy^2 - 5) .$

Let $p_1 = 2012$ and $p_n = 2012^{p_{n-1}}$ for $n > 1$. Find the largest integer $k$ such that $p_{2012}- p_{2011}$ is divisible by $2011^k$.

For some positive integer $n$, the number $110n^3$ has $110$ positive integer divisors, including $1$ and the number $110n^3$. How many positive integer divisors does the number $81n^4$ have? $\textbf{(A) }110 \qquad \textbf{(B) } 191 \qquad \textbf{(C) } 261 \qquad \textbf{(D) } 325 \qquad \textbf{(E) } 425$

Let $\mathbb{Z} _{>0}$ be the set of positive integers. Find all functions $f: \mathbb{Z} _{>0}\rightarrow \mathbb{Z} _{>0}$ such that \[ m^2 + f(n) \mid mf(m) +n \] for all positive integers $m$ and $n$.

Prove the following two inequalities: 1) If $n > 49$, then exist positive integers $a, b > 1$ such that $a+b=n$ and $$\frac{\phi (a)}{a}+\frac{\phi (b)}{b}<1$$ 2) If $n > 4$, then exist integer integers $a, b > 1$ such that $a+b=n$ and $$\frac{\phi (a)}{a}+\frac{\phi (b)}{b}>1$$