Let $A$ be a set of positive integers such that for any two distinct elements $x, y\in A$ we have $|x-y| \geq \frac{xy}{25}.$ Prove that $A$ contains at most nine elements. Give an example of such a set of nine elements.

The following sequence of positive integers $a_1, a_2, ..., a_{400}$ satisfies the relationship $a_{n+1} = \tau (a_n) + \tau (n)$ for all $1 \le n \le 399$, where $\tau (k) $ is the number of positive integer divisors that $k$ has. Prove that in the sequence there are no more than $210$ prime numbers.

How many positive integers smaller than $1000$ and not divisible by $5$ and by $7$ are there?

Prove that some (or one) of any $100$ integers can always be chosen so that the sum of the chosen integers is divisible by $100$.

Find all positive integers $x$, $y$ such that $2^x+5^y+2$ is a perfect square.

The product $1\times 2\times 3\times ...\times n$ is written on the board. For what integers $n \ge 2$, we can add exclamation marks to some factors to convert them into factorials, in such a way that the final product can be a perfect square?

The sum of the digits of a natural number is $k{}.$ What is the largest possible sum of digits for[list=a] [*] the square of this number; [*]the fourth power of this number, [/list] given that $k\geqslant 4.$ [i]From the folklore[/i]

Find all polynomials $f(x)$ with integer coefficients such that $f(n)$ and $f(2^{n})$ are co-prime for all natural numbers $n$.

Denote by $S(n)$ the sum of digits of $n$. Given a positive integer $N$, we consider the following process: We take the sum of digits $S(N)$, then take its sum of digits $S(S(N))$, then its sum of digits $S(S(S(N)))$... We continue this until we are left with a one-digit number. We call the number of times we had to activate $S(\cdot)$ the [b]depth[/b] of $N$. For example, the depth of 49 is 2, since $S(49)=13\rightarrow S(13)=4$, and the depth of 45 is 1, since $S(45)=9$. [list=a] [*] Prove that every positive integer $N$ has a finite depth, that is, at some point of the process we get a one-digit number. [*] Define $x(n)$ to be the [u]minimal[/u] positive integer with depth $n$. Find the residue of $x(5776)\mod 6$. [*] Find the residue of $x(5776)-x(5708)\mod 2016$. [/list]

[b]p1.[/b] Compute $17^2 + 17 \cdot 7 + 7^2$. [b]p2.[/b] You have $\$1.17$ in the minimum number of quarters, dimes, nickels, and pennies required to make exact change for all amounts up to $\$1.17$. How many coins do you have? [b]p3.[/b] Suppose that there is a $40\%$ chance it will rain today, and a $20\%$ chance it will rain today and tomorrow. If the chance it will rain tomorrow is independent of whether or not it rained today, what is the probability that it will rain tomorrow? (Express your answer as a percentage.) [b]p4.[/b] A number is called boxy if the number of its factors is a perfect square. Find the largest boxy number less than $200$. [b]p5.[/b] Alice, Bob, Carl, and Dave are either lying or telling the truth. If the four of them make the following statements, who has the coin? [i]Alice: I have the coin. Bob: Carl has the coin. Carl: Exactly one of us is telling the truth. Dave: The person who has the coin is male.[/i] [b]p6.[/b] Vicky has a bag holding some blue and some red marbles. Originally $\frac23$ of the marbles are red. After Vicky adds $25$ blue marbles, $\frac34$ of the marbles are blue. How many marbles were originally in the bag? [b]p7.[/b] Given pentagon $ABCDE$ with $BC = CD = DE = 4$, $\angle BCD = 90^o$ and $\angle CDE = 135^o$, what is the length of $BE$? [b]p8.[/b] A Berkeley student decides to take a train to San Jose, stopping at Stanford along the way. The distance from Berkeley to Stanford is double the distance from Stanford to San Jose. From Berkeley to Stanford, the train's average speed is $15$ meters per second. From Stanford to San Jose, the train's average speed is $20$ meters per second. What is the train's average speed for the entire trip? [b]p9.[/b] Find the area of the convex quadrilateral with vertices at the points $(-1, 5)$, $(3, 8)$, $(3,-1)$, and $(-1,-2)$. [b]p10.[/b] In an arithmetic sequence $a_1$, $a_2$, $a_3$, $...$ , twice the sum of the first term and the third term is equal to the fourth term. Find $a_4/a_1$. [b]p11.[/b] Alice, Bob, Clara, David, Eve, Fred, Greg, Harriet, and Isaac are on a committee. They need to split into three subcommittees of three people each. If no subcommittee can be all male or all female, how many ways are there to do this? [b]p12.[/b] Usually, spaceships have $6$ wheels. However, there are more advanced spaceships that have $9$ wheels. Aliens invade Earth with normal spaceships, advanced spaceships, and, surprisingly, bicycles (which have $2$ wheels). There are $10$ vehicles and $49$ wheels in total. How many bicycles are there? [b]p13.[/b] If you roll three regular six-sided dice, what is the probability that the three numbers showing will form an arithmetic sequence? (The order of the dice does matter, but we count both $(1,3, 2)$ and $(1, 2, 3)$ as arithmetic sequences.) [b]p14.[/b] Given regular hexagon $ABCDEF$ with center $O$ and side length $6$, what is the area of pentagon $ABODE$? [b]p15.[/b] Sophia, Emma, and Olivia are eating dinner together. The only dishes they know how to make are apple pie, hamburgers, hotdogs, cheese pizza, and ice cream. If Sophia doesn't eat dessert, Emma is vegetarian, and Olivia is allergic to apples, how many dierent options are there for dinner if each person must have at least one dish that they can eat? [b]p16.[/b] Consider the graph of $f(x) = x^3 + x + 2014$. A line intersects this cubic at three points, two of which have $x$-coordinates $20$ and $14$. Find the $x$-coordinate of the third intersection point. [b]p17.[/b] A frustum can be formed from a right circular cone by cutting of the tip of the cone with a cut perpendicular to the height. What is the surface area of such a frustum with lower radius $8$, upper radius $4$, and height $3$? [b]p18.[/b] A quadrilateral $ABCD$ is dened by the points $A = (2,-1)$, $B = (3, 6)$, $C = (6, 10)$ and $D = (5,-2)$. Let $\ell$ be the line that intersects and is perpendicular to the shorter diagonal at its midpoint. What is the slope of $\ell$? [b]p19.[/b] Consider the sequence $1$, $1$, $2$, $2$, $3$, $3$, $3$, $5$, $5$, $5$, $5$, $5$, $...$ where the elements are Fibonacci numbers and the Fibonacci number $F_n$ appears $F_n$ times. Find the $2014$th element of this sequence. (The Fibonacci numbers are defined as $F_1 = F_2 = 1$ and for $n > 2$, $F_n = F_{n-1}+F_{n-2}$.) [b]p20.[/b] Call a positive integer top-heavy if at least half of its digits are in the set $\{7, 8, 9\}$. How many three digit top-heavy numbers exist? (No number can have a leading zero.) PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$x$ and $y$ are positive and relatively prime and $z$ is an integer. They satisfy $(5z-4x)(5z-4y)=25xy$. Show that at least one of $10z+x+y$ or quotient of this number divided by $3$ is a square number (i.e. prove that $10z+x+y$ or integer part of $\frac{10z+x+y}{3}$ is a square number).

Let's call a power of two [i]compact[/i] if it can be represented as the sum of no more than $10^9$ not necessarily distinct factorials of positive integer numbers. Prove that the set of compact powers of two is finite.

Find all positive integers \(k\) for which there is an irrational \(\alpha>1\) and a positive integer \(N\) such that \(\left\lfloor\alpha^{n}\right\rfloor\) is a perfect square minus \(k\) for every integer \(n\) with \(n>N\).

Prove that for all primes $p>3$, $\binom{2p}{p}-2$ is divisible by $p^3$

[b]p1.[/b] The Evergreen School booked buses for a field trip. Altogether, $138$ people went to West Lake, while $115$ people went to East Lake. The buses all had the same number of seats, and every bus has more than one seat. All seats were occupied and everybody had a seat. How many seats were there in each bus? [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $50$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a 6 cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $150$ coins? [b]p3.[/b] Pinocchio multiplied two $2$ digit numbers. But witch Masha erased some of the digits. The erased digits are the ones marked with a $*$. Could you help Pinocchio to restore all the erased digits? $\begin{tabular}{ccccc} & & & 9 & 5 \\ x & & & * & * \\ \hline & & & * & * \\ + & 1 & * & * & \\ \hline & * & * & * & * \\ \end{tabular}$ Find all solutions. [b]p4.[/b] There are $50$ senators and $435$ members of House of Representatives. On Friday all of them voted a very important issue. Each senator and each representative was required to vote either "yes" or "no". The announced results showed that the number of "yes" votes was greater than the number of "no" votes by $24$. Prove that there was an error in counting the votes. [b]p5.[/b] Was there a year in the last millennium (from $1000$ to $2000$) such that the sum of the digits of that year is equal to the product of the digits? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all positive integer triples $(x,y,z)$ such that $x<y<z$, $\gcd (x,y)=6$, $\gcd (y,z)=10$, $\gcd (x,z)=8$, and lcm$(x,y,z)=2400$. Note that the problems of the TST are not arranged in difficulty (Problem 1 of day 1 was probably the most difficult!)

A positive integer is called special if its digits can be arranged to form an integer divisible by $4$. How many of the integers from $1$ to $2018$ are special?

Let $(m,n)$ be a pair of positive integers. (a) Prove that the set of all positive integers can be partitioned into four pairwise disjoint nonempty subsets such that none of them has two numbers with absolute value of their difference equal to either $m$, $n$, or $m+n$. (b) Find all pairs $(m,n)$ such that the set of all positive integers can not be partitioned into three pairwise disjoint nonempty subsets satisfying the above condition.

Kelvin and $15$ other frogs are in a meeting, for a total of $16$ frogs. During the meeting, each pair of distinct frogs becomes friends with probability $\frac{1}{2}$. Kelvin thinks the situation after the meeting is [I]cool[/I] if for each of the $16$ frogs, the number of friends they made during the meeting is a multiple of $4$. Say that the probability of the situation being cool can be expressed in the form $\frac{a}{b}$, where $a$ and $b$ are relatively prime. Find $a$.

Find all positive integers $ x$ and $ y$ such that $ 5^{x}-3^{y}= 16$.

Of the integers $a$, $b$, and $c$ that satisfy $0 < c < b < a$ and $$a^3 - b^3 - c^3 - abc + 1 = 2022,$$ let $c'$ be the least value of $ c$ appearing in any solution, let $a'$ be the least value of $a$ appearing in any solution with $c = c'$, and let $b'$ be the value of $b$ in the solution where $c = c'$ and $a = a'$. Find $a' + b' + c'$.

Let $x, y$ be positive integers such that $\gcd(x,y)=1$ and $x+3y^2$ is a perfect square. Prove that $x^2+9y^4$ can't be a perfect square.

For every positive integer $n$, the symbol $a_n/b_n$ is the simplest form of the fraction $1+1/2+...+1/n$. Prove that for every pair of positive integers $(M, N)$ we can always find a positive integer $m$ where $(a_n, N) = 1$ for all $n = m, m + 1, ...,m + M$.

Find all positive integers $n$ which have exactly $\sqrt{n}$ positive divisors.

Let $a_1<a_2<a_3<\dots$ be positive integers such that $a_{k+1}$ divides $2(a_1+a_2+\dots+a_k)$ for every $k\geqslant 1$. Suppose that for infinitely many primes $p$, there exists $k$ such that $p$ divides $a_k$. Prove that for every positive integer $n$, there exists $k$ such that $n$ divides $a_k$.