Find all real numbers $ t $ not less than $1 $ that satisfy the following requirements: for any $a,b\in [-1,t]$ , there always exists $c,d \in [-1,t ]$ such that $ (a+c)(b+d)=1.$

A [i]sum decomposition[/i] of the number 100 is given by a positive integer $n$ and $n$ positive integers $x_1<x_2<\cdots <x_n$ such that $x_1 + x_2 + \cdots + x_n = 100$. Determine the largest possible value of the product $x_1x_2\cdots x_n$, and $n$ , as $x_1, x_2,\dots, x_n$ vary among all sum decompositions of the number $100$.

Let $x,y$ and $a_0, a_1, a_2, \cdots $ be integers satisfying $a_0 = a_1 = 0$, and $$a_{n+2} = xa_{n+1}+ya_n+1$$for all integers $n \geq 0$. Let $p$ be any prime number. Show that $\gcd(a_p,a_{p+1})$ is either equal to $1$ or greater than $\sqrt{p}$.

Let $a, b,c$ be distinct positive integers, and suppose that $p = ab+bc+ca$ is a prime number. $(a)$ Show that $a^2,b^,c^2$ give distinct remainders after division by $p$. (b) Show that $a^3,b^3,c^3$ give distinct remainders after division by $p$.

Find all polynomials \(P\) with real coefficients satisfying $$P(\frac{1}{1+x})=\frac{1}{1+P(x)}$$ for all real numbers \(x\neq -1\)

A triangle with vertices at $(1003,0)$, $(1004,3)$, and $(1005,1)$ in the $xy$-plane is revolved all the way around the $y$-axis. Find the volume of the solid thus obtained.

The diagonals of convex quadrilateral $ABCD$ are perpendicular. Points $A' , B' , C' , D' $ are the circumcenters of triangles $ABD, BCA, CDB, DAC$ respectively. Prove that lines $AA' , BB' , CC' , DD' $ concur. (A. Zaslavsky)

Maryam labels each vertex of a tetrahedron with the sum of the lengths of the three edges meeting at that vertex. She then observes that the labels at the four vertices of the tetrahedron are all equal. For each vertex of the tetrahedron, prove that the lengths of the three edges meeting at that vertex are the three side lengths of a triangle.

Triangle $ABC$ has $AB = 13$, $BC = 14$, and $CA = 15$. The internal angle bisector of $\angle ABC$ intersects side $CA$ at $X$. The circumcircles of triangles $AXB$ and $BXC$ intersect sides $BC$ and $AB$ at $M$ and $N$, respectively. The value of $MN^2$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find the remainder when $m+n$ is divided by $1000$. [i]Proposed by [b] Th3Numb3rThr33[/b][/i]

Let's call a function $f:\mathbb R\to\mathbb R$[i] weakly periodic[/i] if it is continuous and $f(x+1)=f(f(x))+1$ for all $x\in\mathbb R$. a) Does there exist a weakly periodic function such that $f(x)>x$ for all $x\in\mathbb R$? b) Does there exist a weakly periodic function such that $f(x)<x$ for all $x\in\mathbb R$? [i]Proposed by: András Imolay, Budapest[/i]

[u]Set 1[/u] [b]p1.[/b] Farmer John has $4000$ gallons of milk in a bucket. On the first day, he withdraws $10\%$ of the milk in the bucket for his cows. On each following day, he withdraws a percentage of the remaining milk that is $10\%$ more than the percentage he withdrew on the previous day. For example, he withdraws $20\%$ of the remaining milk on the second day. How much milk, in gallons, is left after the tenth day? [b]p2.[/b] Will multiplies the first four positive composite numbers to get an answer of $w$. Jeremy multiplies the first four positive prime numbers to get an answer of $j$. What is the positive difference between $w$ and $j$? [b]p3.[/b] In Nathan’s math class of $60$ students, $75\%$ of the students like dogs and $60\%$ of the students like cats. What is the positive difference between the maximum possible and minimum possible number of students who like both dogs and cats? [u]Set 2[/u] [b]p4.[/b] For how many integers $x$ is $x^4 - 1$ prime? [b]p5.[/b] Right triangle $\vartriangle ABC$ satisfies $\angle BAC = 90^o$. Let $D$ be the foot of the altitude from $A$ to $BC$. If $AD = 60$ and $AB = 65$, find the area of $\vartriangle ABC$. [b]p6.[/b] Define $n! = n \times (n - 1) \times ... \times 1$. Given that $3! + 4! + 5! = a^2 + b^2 + c^2$ for distinct positive integers $a, b, c$, find $a + b + c$. [u]Set 3[/u] [b]p7.[/b] Max nails a unit square to the plane. Let M be the number of ways to place a regular hexagon (of any size) in the same plane such that the square and hexagon share at least $2$ vertices. Vincent, on the other hand, nails a regular unit hexagon to the plane. Let $V$ be the number of ways to place a square (of any size) in the same plane such that the square and hexagon share at least $2$ vertices. Find the nonnegative difference between $M$ and $V$ . [b]p8.[/b] Let a be the answer to this question, and suppose $a > 0$. Find $\sqrt{a +\sqrt{a +\sqrt{a +...}}}$ . [b]p9.[/b] How many ordered pairs of integers $(x, y)$ are there such that $x^2 - y^2 = 2019$? [u]Set 4[/u] [b]p10.[/b] Compute $\frac{p^3 + q^3 + r^3 - 3pqr}{p + q + r}$ where $p = 17$, $q = 7$, and $r = 8$. [b]p11.[/b] The unit squares of a $3 \times 3$ grid are colored black and white. Call a coloring good if in each of the four $2 \times 2$ squares in the $3 \times 3$ grid, there is either exactly one black square or exactly one white square. How many good colorings are there? Consider rotations and reflections of the same pattern distinct colorings. [b]p12.[/b] Define a $k$-[i]respecting [/i]string as a sequence of $k$ consecutive positive integers $a_1$, $a_2$, $...$ , $a_k$ such that $a_i$ is divisible by $i$ for each $1 \le i \le k$. For example, $7$, $8$, $9$ is a $3$-respecting string because $7$ is divisible by $1$, $8$ is divisible by $2$, and $9$ is divisible by $3$. Let $S_7$ be the set of the first terms of all $7$-respecting strings. Find the sum of the three smallest elements in $S_7$. [u]Set 5[/u] [b]p13.[/b] A triangle and a quadrilateral are situated in the plane such that they have a finite number of intersection points $I$. Find the sum of all possible values of $I$. [b]p14.[/b] Mr. DoBa continuously chooses a positive integer at random such that he picks the positive integer $N$ with probability $2^{-N}$ , and he wins when he picks a multiple of 10. What is the expected number of times Mr. DoBa will pick a number in this game until he wins? [b]p15.[/b] If $a, b, c, d$ are all positive integers less than $5$, not necessarily distinct, find the number of ordered quadruples $(a, b, c, d)$ such that $a^b - c^d$ is divisible by $5$. PS. You had better use hide for answers. Last 4 sets have been posted [url=https://artofproblemsolving.com/community/c4h2777362p24370554]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If the ratio of $2x-y$ to $x+y$ is $\frac{2}{3}$, what is the ratio of $x$ to $y$? $\text{(A)} \ \frac{1}{5} \qquad \text{(B)} \ \frac{4}{5} \qquad \text{(C)} \ 1 \qquad \text{(D)} \ \frac{6}{5} \qquad \text{(E)} \ \frac{5}{4}$

$n$ children want to divide $m$ identical pieces of chocolate into equal amounts, each piece being broken not more than once. (a) For what $n$ is it possible, if $m = 9$? (b) For what $n$ and $m$ is it possible? (Y. Tschekanov, Moscow)

There are circles $\omega_1$ and $\omega_2$. They intersect in two points, one of which is the point $A$. $B$ lies on $\omega_1$ such that $AB$ is tangent to $\omega_2$. The tangent to $\omega_1$ at $B$ intersects $\omega_2$ at $C$ and $D$, where $D$ is the closer to $B$. $AD$ intersects $\omega_1$ again at $E$. If $BD = 3$ and $CD = 13$, find $EB/ED$.

Let $ G$ be a locally compact solvable group, let $ c_1,\ldots, c_n$ be complex numbers, and assume that the complex-valued functions $ f$ and $ g$ on $ G$ satisfy \[ \sum_{k=1}^n c_k f(xy^k)=f(x)g(y) \;\textrm{for all} \;x,y \in G \ \ .\] Prove that if $ f$ is a bounded function and \[ \inf_{x \in G} \textrm{Re} f(x) \chi(x) >0\] for some continuous (complex) character $ \chi$ of $ G$, then $ g$ is continuous. [i]L. Szekelyhidi[/i]

On the plane are given unit vectors $\overrightarrow{a_1},\overrightarrow{a_2},\overrightarrow{a_3}$. Show that one can choose numbers $c_1,c_2,c_3 \in \{-1,1\}$ such that the length of the vector $c_1\overrightarrow{a_1}+c_2\overrightarrow{a_2}+c_3\overrightarrow{a_3}$ is at least $2$.

Let $E$ be a finite set of points such that $E$ is not contained in a plane and no three points of $E$ are collinear. Show that at least one of the following alternatives holds: (i) $E$ contains five points that are vertices of a convex pyramid having no other points in common with $E;$ (ii) some plane contains exactly three points from $E.$

Determine, with proof, the smallest positive multiple of $99$ all of whose digits are either $1$ or $2$.

Given a line segment $AB$ and a point $C$ lies inside it such that $AB=3 \cdot AC$ . Construct a parallelogram $ACDE$ such that $AC=DE=CE>AR$. Let $Z$ be a point on $AC$ such that $\angle AEZ=\angle ACE =\omega$. Prove that the line passing through point $B$ and perpendicular on side $EC$, and the line passing through point $D$ and perpendicular on side $AB$, intersect on point , let it be $K$, lying on line $EZ$.

Define the function $f(n)$ for positive integers $n$ as follows: if $n$ is prime, then $f(n) = 1$; and $f(ab) = a \cdot f(b)+f(a)\cdot b$ for all positive integers $a$ and $b$. How many positive integers $n$ less than $5^{50}$ have the property that $f(n) = n$?

$a,b,c$ are positive reals satisfying $\frac{2}{5} \leq c \leq \min{a,b}$ ; $ac \geq \frac{4}{15}$ and $bc \geq \frac{1}{5}$ Find the maximum value of $\left(\frac{1}{a}+\frac{2}{b}+\frac{3}{c}\right)$.

Prove that there exist an infinite number of ordered pairs $(a,b)$ of integers such that for every positive integer $t$, the number $at+b$ is a triangular number if and only if $t$ is a triangular number.

Let $C$ be the set of points $(x,y)$ with integer coordinates in the plane where $1\leq x\leq 900$ and $1\leq y\leq 1000$. A polygon $P$ with vertices in $C$ is called [i]emerald[/i] if $P$ has exactly zero or two vertices in each row and each column and all the internal angles of $P$ are $90^\circ$ or $270^\circ$. Find the greatest value of $k$ such that we can color $k$ points in $C$ such that any subset of these $k$ points is not the set of vertices of an [i]emerald[/i] polygon. [img]https://cdn.discordapp.com/attachments/954427908359876608/1299737432010395678/image.png?ex=671e4a4f&is=671cf8cf&hm=ce008541975226a0e9ea53a93592a7469d8569baca945c1c207d4a722126bb60&[/img] On the left, an example of an emerald polygon; on the right, an example of a non-emerald polygon.

[b]p1.[/b] To convert between Fahrenheit, $F$, and Celsius, $C$, the formula is $F = \frac95 C + 32$. Jennifer, having no time to be this precise, instead approximates the temperature of Fahrenheit, $\widehat F$, as $\widehat F = 2C + 30$. There is a range of temperatures $C_1 \le C \le C_2$ such that for any $C$ in this range, $| \widehat F - F| \le 5$. Compute the ordered pair $(C_1,C_2)$. [b]p2.[/b] Compute integer $x$ such that $x^{23} = 27368747340080916343$. [b]p3.[/b] The number of ways to flip $n$ fair coins such that there are no three heads in a row can be expressed with the recurrence relation $$ S(n + 1) = a_0 S(n) + a_1 S(n - 1) + ... + a_k S(n - k) $$ for sufficiently large $n$ and $k$ where $S(n)$ is the number of valid sequences of length $n$. What is $\sum^k_{n=0}|a_n|$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a polynomial$$P(x)=x^n+a_{n-1}x^{n-1}+...+a_1x+a_0\in \mathbb{Z}[x]$$ with degree $n\ge 2$ and $a_o\ne 0.$ Prove that if $|a_{n-1}|>1+|a_{n-2}|+...+|a_1|+|a_0|$, then $P(x)$ is irreducible in $\mathbb{Z}[x].$