The alphabet in its natural order $\text{ABCDEFGHIJKLMNOPQRSTUVWXYZ}$ is $T_0$. We apply a permutation to $T_0$ to get $T_1$ which is $\text{JQOWIPANTZRCVMYEGSHUFDKBLX}$. If we apply the same permutation to $T_1$, we get $T_2$ which is $\text{ZGYKTEJMUXSODVLIAHNFPWRQCB}$. We continually apply this permutation to each $T_m$ to get $T_{m+1}$. Find the smallest positive integer $n$ so that $T_n=T_0$.

Determine all integer solutions (a,b,c) with $c\leq 94$ for which: $(a+\sqrt c)^2+(b+\sqrt c)^2 = 60 + 20\sqrt c$

For every natural number $a$ and $b$, define the notation $[a,b]$ as the least common multiple of $a $ and $b$ and the notation $(a,b)$ as the greatest common divisor of $a$ and $b$. Find all $n \in \mathbb{N}$ that satisfies \[ 4 \sum_{k=1}^{n} [n,k] = 1 + \sum_{k=1}^{n} (n,k) + 2n^2 \sum_{k=1}^{n} \frac{1}{(n,k)} \]

Find all primes $p$ such that $p^2 + 2543$ has at most $16$ divisors.

A sequence $a_1,a_2,\dots$ satisfy $$ \sum_{i =1}^n a_{\lfloor \frac{n}{i}\rfloor }=n^{10}, $$ for every $n\in\mathbb{N}$. Let $c$ be a positive integer. Prove that, for every positive integer $n$, $$ \frac{c^{a_n}-c^{a_{n-1}}}{n} $$ is an integer.

There are $32$ students in the class with $10$ interesting group. Each group contains exactly $16$ students. For each couple of students, the square of the number of the groups which are only involved by just one of the two students is defined as their $interests-disparity$. Define $S$ as the sum of the $interests-disparity$ of all the couples, $\binom{32}{2}\left ( =\: 496 \right )$ ones in total. Determine the minimal possible value of $S$.

The Fibonacci sequence is defined by $F_1 = F_2 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for every integer $n$. Let $k$ be a fixed integer. A sequence $(a_n)$ of integers is said to be $\textit{phirme}$ if $a_n + a_{n+1} = F_{n+k}$ for all $n \geq 1$. Find all $\textit{phirme}$ sequences in terms of $n$ and $k$.

Let $a$, $b$, and $c$ be three distinct one-digit numbers. What is the maximum value of the sum of the roots of the equation $(x-a)(x-b)+(x-b)(x-c)=0$? $ \textbf {(A) } 15 \qquad \textbf {(B) } 15.5 \qquad \textbf {(C) } 16 \qquad \textbf {(D) } 16.5 \qquad \textbf {(E) } 17 $

Find all pairs of positive integers $(a, b)$ such that $$11ab \le a^3 - b^3 \le 12ab.$$

How many positive integers less that $200$ are relatively prime to either $15$ or $24$?

Consider all pairs of positive integers $(a,b)$, with $a<b$, such that $\sqrt{a} +\sqrt{b} = \sqrt{2,160}$ Determine all possible values of $a$.

At each vertex of a regular $2008$-gon is placed a coin. We choose two coins and move each of them to an adjacent vertex, one in the clock-wise direction and the other in the anticlock-wise direction. Determine whether or not it is possible, by making several such pairs of moves, to move all the coins into (a) $8$ heaps of $251$ coins each, (b) $251$ heaps of $8$ coins each.

Let $\vartriangle ABC$ be a right triangle with $AB = 4, BC = 5$, and hypotenuse $AC$. Let I be the incenter of $\vartriangle ABC$ and $E$ be the excenter of $\vartriangle ABC$ opposite $A$ (the center of the circle tangent to $BC$ and the extensions of segments $AB$ and $AC$). Suppose the circle with diameter $IE$ intersects line $AB$ beyond $B$ at $D$. If $BD =\sqrt{a}- b$, where a and b are positive integers. Find $a + b$.

A non-isosceles triangle is given. Prove that one of the circles touching internally its incircle and circumcircle and externally one of its excircles passes through a vertex of the triangle.

There are $n$ straight lines in the plane such that each intersects exactly $1999$ of the others . Find all posssible values of $n$. (R Zhenodarov)

The quadrilateral $ABCD$ is known to have $BC = CD = AC$, and the angle $\angle ABC= 70^o$. Calculate the degree measure of the angle $\angle ADB$. (Alexey Panasenko)

The numbers $1,2,\dots,10$ are written on a board. Every minute, one can select three numbers $a$, $b$, $c$ on the board, erase them, and write $\sqrt{a^2+b^2+c^2}$ in their place. This process continues until no more numbers can be erased. What is the largest possible number that can remain on the board at this point? [i]Proposed by Evan Chen[/i]

The incircle of triangle $\vartriangle ABC$ is tangent to side $AB$ at point $P$ and to side $BC$ at point $Q$. The circle passing through points $A,P,Q$ intersects line $BC$ a second time at $M$ and the circle passes through the points $C,P,Q$ and cuts the line $AB$ a second time at point$ N$. Prove that $NM$ is tangent to the incircle of $ABC$.

In terms of the real numbers $a$ and $b$ determine the minimum value of $$ \sqrt{(x+a)^2+1}+\sqrt{(x+1-a)^2+1}+\sqrt{(x+b)^2+1}+\sqrt{(x+1-b)^2+1}$$ as well as all values of $x$ which attain it.

$ABCD$ is a trapezoid with $AB$ parallel to $CD$. The external bisectors of the angles at $ B$ and $C$ intersect at $ P$. The external bisectors of the angles at $ A$ and $D$ intersect at $Q$. Show that the length of $PQ$ is equal to half the perimeter of the trapezoid $ABCD$.

RyNo, a little rhinoceros, has $17$ scratch marks on its body. Some are horizontal and the rest are vertical. Some are on the left side and the rest are on the right side. If RyNo rubs one side of its body against a tree, two scratch marks, either both horizontal or both vertical, will disappear from that side. However, at the same time, two new scratch marks, one horizontal and one vertical, will appear on the other side. If there are less than two horizontal and less than two vertical scratch marks on the side being rubbed, then nothing happens. If RyNo continues to rub its body against trees, is it possible that at some point in time, the numbers of horizontal and vertical scratch marks have interchanged on each side of its body?

In the arrangement of letters and numerals below, by how many different paths can one spell AMC8? Beginning at the A in the middle, a path allows only moves from one letter to an adjacent (above, below, left, or right, but not diagonal) letter. One example of such a path is traced in the picture. [asy] fill((0.5, 4.5)--(1.5,4.5)--(1.5,2.5)--(0.5,2.5)--cycle,lightgray); fill((1.5,3.5)--(2.5,3.5)--(2.5,1.5)--(1.5,1.5)--cycle,lightgray); label("$8$", (1, 0)); label("$C$", (2, 0)); label("$8$", (3, 0)); label("$8$", (0, 1)); label("$C$", (1, 1)); label("$M$", (2, 1)); label("$C$", (3, 1)); label("$8$", (4, 1)); label("$C$", (0, 2)); label("$M$", (1, 2)); label("$A$", (2, 2)); label("$M$", (3, 2)); label("$C$", (4, 2)); label("$8$", (0, 3)); label("$C$", (1, 3)); label("$M$", (2, 3)); label("$C$", (3, 3)); label("$8$", (4, 3)); label("$8$", (1, 4)); label("$C$", (2, 4)); label("$8$", (3, 4));[/asy] $\textbf{(A) }8\qquad\textbf{(B) }9\qquad\textbf{(C) }12\qquad\textbf{(D) }24\qquad\textbf{(E) }36$

[b]p1.[/b] A large square is cut into four smaller, congruent squares. If each of the smaller squares has perimeter $4$, what was the perimeter of the original square? [b]p2.[/b] Pie loves to bake apples so much that he spends $24$ hours a day baking them. If Pie bakes a dozen apples in one day, how many minutes does it take Pie to bake one apple, on average? [b]p3.[/b] Bames Jond is sent to spy on James Pond. One day, Bames sees James type in his $4$-digit phone password. Bames remembers that James used the digits $0$, $5$, and $9$, and no other digits, but he does not remember the order. How many possible phone passwords satisfy this condition? [b]p4.[/b] What do you get if you square the answer to this question, add $256$ to it, and then divide by $32$? [b]p5.[/b] Chloe the Horse and Flower the Chicken are best friends. When Chloe gets sad for any reason, she calls Flower, so Chloe must remember Flower's $3$ digit phone number, which can consist of any digits $0-5$. Given that the phone number's digits are unique and add to $5$, the number does not start with $0$, and the $3$ digit number is prime, what is the sum of all possible phone numbers? [b]p6.[/b] Anuj has a circular pizza with diameter $A$ inches, which is cut into $B$ congruent slices, where $A$,$B$ are positive integers. If one of Anuj's pizza slices has a perimeter of $3\pi + 30$ inches, find $A + B$. [b]p7.[/b] Bob really likes to study math. Unfortunately, he gets easily distracted by messages sent by friends. At the beginning of every minute, there is an $\frac{6}{10}$ chance that he will get a message from a friend. If Bob does get a message from a friend, there is a $\frac{9}{10}$ chance that he will look at the message, causing him to waste $30$ seconds before resuming his studying. If Bob doesn't get a message from a friend, there is a $\frac{3}{10}$ chance Bob will still check his messages hoping for a message from his friends, wasting $10$ seconds before he resumes his studying. What is the expected number of minutes in $100$ minutes for which Bob will be studying math? [b]p8.[/b] Suppose there is a positive integer $n$ with $225$ distinct positive integer divisors. What is the minimum possible number of divisors of n that are perfect squares? [b]p9.[/b] Let $a, b, c$ be positive integers. $a$ has $12$ divisors, $b$ has $8$ divisors, $c$ has $6$ divisors, and $lcm(a, b, c) = abc$. Let $d$ be the number of divisors of $a^2bc$. Find the sum of all possible values of $d$. [b]p10.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 17$, $BC = 28$, $AC = 25$. Let the altitude from $A$ to $BC$ and the angle bisector of angle $B$ meet at $P$. Given the length of $BP$ can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a$, $b$, $c$ where $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime, find $a + b + c$. [b]p11.[/b] Let $a$, $b$, and $c$ be the roots of the cubic equation $x^3-5x+3 = 0$. Let $S = a^4b+ab^4+a^4c+ac^4+b^4c+bc^4$. Find $|S|$. [b]p12.[/b] Call a number palindromeish if changing a single digit of the number into a different digit results in a new six-digit palindrome. For example, the number $110012$ is a palindromeish number since you can change the last digit into a $1$, which results in the palindrome $110011$. Find the number of $6$ digit palindromeish numbers. [b]p13.[/b] Let $P(x)$ be a polynomial of degree $3$ with real coecients and leading coecient $1$. Let the roots of $P(x)$ be $a$, $b$, $c$. Given that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}= 4$ and $a^2 + b^2 + c^2 = 36$, the coefficient of $x^2$ is negative, and $P(1) = 2$, let the $S$ be the sum of possible values of $P(0)$. Then $|S|$ can be expressed as $\frac{a + b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ such that $gcd(a, b, d) = 1$ and $c$ is not divisible by the square of any prime. Find $a + b + c + d$. [b]p14.[/b] Let $ABC$ be a triangle with side lengths $AB = 7$, $BC = 8$, $AC = 9$. Draw a circle tangent to $AB$ at $B$ and passing through $C$. Let the center of the circle be $O$. The length of $AO$ can be expressed as $\frac{a\sqrt{b}}{c\sqrt{d}}$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, c) = gcd(b, d) = 1$ and $b$,$ d$ are not divisible by the square of any prime. Find $a + b + c + d$. [b]p15.[/b] Many students in Mr. Noeth's BC Calculus class missed their first test, and to avoid taking a makeup, have decided to never leave their houses again. As a result, Mr. Noeth decides that he will have to visit their houses to deliver the makeup tests. Conveniently, the $17$ absent students in his class live in consecutive houses on the same street. Mr. Noeth chooses at least three of every four people in consecutive houses to take a makeup. How many ways can Mr. Noeth select students to take makeups? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider the following function $ f(x)=\frac{1}{1+2^{1-2x}}$. Compute the value of $$f\left(\frac{1}{10}\right)+f\left(\frac{2}{10}\right)+...+f\left(\frac{9}{10}\right).$$

Points $P$ and $Q$ lie in a plane with $PQ=8$. How many locations for point $R$ in this plane are there such that the triangle with vertices $P,$ $Q,$ and $R$ is a right triangle with area $12$ square units? $\textbf{(A) } 2 \qquad\textbf{(B) } 4 \qquad\textbf{(C) } 6 \qquad\textbf{(D) }8 \qquad\textbf{(E) } 12$