The diagram below shows equilateral $\triangle ABC$ with side length $2$. Point $D$ lies on ray $\overrightarrow{BC}$ so that $CD = 4$. Points $E$ and $F$ lie on $\overline{AB}$ and $\overline{AC}$, respectively, so that $E$, $F$, and $D$ are collinear, and the area of $\triangle AEF$ is half of the area of $\triangle ABC$. Then $\tfrac{AE}{AF}=\tfrac m n$, where $m$ and $n$ are relatively prime positive integers. Find $m + 2n$. [asy] import math; size(7cm); pen dps = fontsize(10); defaultpen(dps); dotfactor=4; pair A,B,C,D,E,F; B=origin; C=(2,0); D=(6,0); A=(1,sqrt(3)); E=(1/3,sqrt(3)/3); F=extension(A,C,E,D); draw(C--A--B--D,linewidth(1.1)); draw(E--D,linewidth(.7)); dot(A); dot(B); dot(C); dot(D); dot(E); dot(F); label("$A$",A,N); label("$B$",B,S); label("$C$",C,S); label("$D$",D,S); label("$E$",E,NW); label("$F$",F,NE); [/asy]

[b]p1.[/b] Solve: $INK + INK + INK + INK + INK + INK = PEN$ ($INK$ and $PEN$ are $3$-digit numbers, and different letters stand for different digits). [b]p2. [/b]Two people play a game. They put $3$ piles of matches on the table: the first one contains $1$ match, the second one $3$ matches, and the third one $4$ matches. Then they take turns making moves. In a move, a player may take any nonzero number of matches FROM ONE PILE. The player who takes the last match from the table loses the game. a) The player who makes the first move can win the game. What is the winning first move? b) How can he win? (Describe his strategy.) [b]p3.[/b] The planet Naboo is under attack by the imperial forces. Three rebellion camps are located at the vertices of a triangle. The roads connecting the camps are along the sides of the triangle. The length of the first road is less than or equal to $20$ miles, the length of the second road is less than or equal to $30$ miles, and the length of the third road is less than or equal to $45$ miles. The Rebels have to cover the area of this triangle with a defensive field. What is the maximal area that they may need to cover? [b]p4.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. What is the smallest amount of money you need to buy a slice of pizza that costs $\$ 1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do, since the pizza man can only give you $\$5$ back. [b]p5.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line. (b) Do the same with $6$ points. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $p > 10^9$ be a prime number such that $4p + 1$ is also prime. Prove that the decimal expansion of $\frac{1}{4p+1}$ contains all the digits $0,1, \ldots, 9$.

Let the sequences $(x_n)$ and $(y_n)$ be defined by $x_0 = 0$, $x_1 = 1$, $x_{n + 2} = 3x_{n + 1}-2x_n$ for $n = 0, 1, ...$ and $y_n = x^2_n+2^{n + 2}$ for $n = 0, 1, ...,$ respectively. Show that for all n> 0, and n is the square of a odd integer.

For any natural number $n = \overline{a_i...a_2a_1}$, consider the number $$T(n) =10 \sum_{i \,\, even} a_i+\sum_{i \,\, odd} a_i.$$ Let's find the smallest positive integer $A$ such that is sum of the natural numbers $n_1,n_2,...,n_{148}$ as well as of $m_1,m_2,...,m_{149}$ and matches the pattern: $A=n_1+n_2+...+n_{148}=m_1+m_2+...+m_{149}$ $T(n_1)=T(n_2)=...=T(n_{148})$ $T(m_1)=T(m_2)=...=T(m_{148})$

Find a solution to the equation $x^2-2x-2007y^2=0$ in positive integers.

Let $x,y,z\in \mathbb{R}^*$ such that $xy,yz,zx\in \mathbb{Q}$. a) Prove that $x^2+y^2+z^2$ is rational; b) If $x^3+y^3+z^3$ is rational, prove that $x,y,z$ are rational. [i]Marius Ghergu[/i]

[b]p1.[/b] The number $2020$ is very special: the sum of its digits is equal to the product of its nonzero digits. How many such four digit numbers are there? (Numbers with only one nonzero digit, like $3000$, also count) [b]p2.[/b] A locker has a combination which is a sequence of three integers between $ 0$ and $49$, inclusive. It is known that all of the numbers in the combination are even. Let the total of a lock combination be the sum of the three numbers. Given that the product of the numbers in the combination is $12160$, what is the sum of all possible totals of the locker combination? [b]p3.[/b] Given points $A = (0, 0)$ and $B = (0, 1)$ in the plane, the set of all points P in the plane such that triangle $ABP$ is isosceles partitions the plane into $k$ regions. The sum of the areas of those regions that are bounded is $s$. Find $ks$. [b]p4.[/b] Three families sit down around a circular table, each person choosing their seat at random. One family has two members, while the other two families have three members. What is the probability that every person sits next to at least one person from a different family? [b]p5.[/b] Jacob and Alexander are walking up an escalator in the airport. Jacob walks twice as fast as Alexander, who takes $18$ steps to arrive at the top. Jacob, however, takes $27$ steps to arrive at the top. How many of the upward moving escalator steps are visible at any point in time? [b]p6.[/b] Points $A, B, C, D, E$ lie in that order on a circle such that $AB = BC = 5$, $CD = DE = 8$, and $\angle BCD = 150^o$ . Let $AD$ and $BE$ intersect at $P$. Find the area of quadrilateral $PBCD$. [b]p7.[/b] Ivan has a triangle of integers with one number in the first row, two numbers in the second row, and continues up to eight numbers in the eighth row. He starts with the first $8$ primes, $2$ through $19$, in the bottom row. Each subsequent row is filled in by writing the least common multiple of two adjacent numbers in the row directly below. For example, the second last row starts with$ 6, 15, 35$, etc. Let P be the product of all the numbers in this triangle. Suppose that P is a multiple of $a/b$, where $a$ and $b$ are positive integers and $a > 1$. Given that $b$ is maximized, and for this value of $b, a$ is also maximized, find $a + b$. [b]p8.[/b] Let $ABCD$ be a cyclic quadrilateral. Given that triangle $ABD$ is equilateral, $\angle CBD = 15^o$, and $AC = 1$, what is the area of $ABCD$? [b]p9.[/b] Let $S$ be the set of all integers greater than $ 1$. The function f is defined on $S$ and each value of $f$ is in $S$. Given that $f$ is nondecreasing and $f(f(x)) = 2x$ for all $x$ in $S$, find $f(100)$. [b]p10.[/b] An [i]origin-symmetric[/i] parallelogram $P$ (that is, if $(x, y)$ is in $P$, then so is $(-x, -y)$) lies in the coordinate plane. It is given that P has two horizontal sides, with a distance of $2020$ between them, and that there is no point with integer coordinates except the origin inside $P$. Also, $P$ has the maximum possible area satisfying the above conditions. The coordinates of the four vertices of P are $(a, 1010)$, $(b, 1010)$, $(-a, -1010)$, $(-b, -1010)$, where a, b are positive real numbers with $a < b$. What is $b$? [b]p11.[/b] What is the remainder when $5^{200} + 5^{50} + 2$ is divided by $(5 + 1)(5^2 + 1)(5^4 + 1)$? [b]p12.[/b] Let $f(n) = n^2 - 4096n - 2045$. What is the remainder when $f(f(f(... f(2046)...)))$ is divided by $2047$, where the function $f$ is applied $47$ times? [b]p13.[/b] What is the largest possible area of a triangle that lies completely within a $97$-dimensional hypercube of side length $1$, where its vertices are three of the vertices of the hypercube? [b]p14.[/b] Let $N = \left \lfloor \frac{1}{61} \right \rfloor + \left \lfloor\frac{3}{61} \right \rfloor+\left \lfloor \frac{3^2}{61} \right \rfloor+... +\left \lfloor\frac{3^{2019}}{61} \right \rfloor$. Given that $122N$ can be expressed as $3^a - b$, where $a, b$ are positive integers and $a$ is as large as possible, find $a + b$. Note: $\lfloor x \rfloor$ is defined as the greatest integer less than or equal to $x$. [b]p15.[/b] Among all ordered triples of integers $(x, y, z)$ that satisfy $x + y + z = 8$ and $x^3 + y^3 + z^3 = 134$, what is the maximum possible value of $|x| + |y| + |z|$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Show that a positive integer $m$ is a sum of two triangular numbers if and only if $4m+1$ is a sum of two squares.

Let $a, b, m, n$ be positive integers such that $gcd(a, b) = 1$ and $a > 1$. Prove that if $$a^m+b^m \mid a^n+b^n$$then $m \mid n$.

When the number $2^{1000}$ is divided by $13$, the remainder in the division is $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }7\qquad \textbf{(E) }11$

Define a function $g :\mathbb{N} \rightarrow \mathbb{R}$ Such that $g(x)=\sqrt{4^x+\sqrt {4^{x+1}+\sqrt{4^{x+2}+...}}}$. Find the last 2 digits in the decimal representation of $g(2021)$.

Let $$N = {2^{2012} \choose 0} {2^{2012} \choose 1} {2^{2012} \choose 2} {2^{2012} \choose 3}... {2^{2012} \choose 2^{2012}}.$$ Let M be the number of $0$’s when $N$ is written in binary. How many $0$’s does $M$ have when written in binary? (Warning: this question is very hard.)

Prove that for any odd number $a$ there exists an integer $b$ such that $2^b-1$ is divisible by $a$.

For each positive integer $n$, let $s(n)$ be the sum of the squares of the digits of $n$. For example, $s(15)=1^2+5^2=26$. Determine all integers $n\geq 1$ such that $s(n)=n$.

Determine all natural numbers$ n> 1$ with the property: For each divisor $d> 1$ of number $n$, then $d - 1$ is a divisor of $n - 1$.

Find all integer solution triple $(x,y,z)$ such that $x^2+y^2+z^2-2xyz=0.$

For any positive integer $n$ define $$E(n)=n(n+1)(2n+1)(3n+1)\cdots (10n+1).$$ Find the greatest common divisor of $E(1),E(2),E(3),\dots ,E(2009).$

It is possible to perform three operations $f, g$, and $h$ for positive integers: $f(n) = 10n, g(n) = 10n + 4$, and $h(2n) = n$; in other words, one may write $0$ or $4$ in the end of the number and one may divide an even number by $2$. Prove: every positive integer can be constructed starting from $4$ and performing a finite number of the operations $f, g,$ and $h$ in some order.

Consider 90 distinct positive integers. Show that there exist two of them whose least common multiple is greater than 2024.

Given natural numbers $a,b$ and function $f: \mathbb{N} \to \mathbb{N} $ such that for any natural number $n, f\left( n+a \right)$ is divided by $f\left( {\left[ {\sqrt n } \right] + b} \right)$. Prove that for any natural $n$ exist $n$ pairwise distinct and pairwise relatively prime natural numbers ${{a}_{1}}$, ${{a}_{2}}$, $\ldots$, ${{a}_{n}}$ such that the number $f\left( {{a}_{i+1}} \right)$ is divided by $f\left( {{a}_{i}} \right)$ for each $i=1,2, \dots ,n-1$ . (Here $[x]$ is the integer part of number $x$, that is, the largest integer not exceeding $x$.)

[b]p1.[/b] How many lines of symmetry does a square have? [b]p2.[/b] Compute$ 1/2 + 1/6 + 1/12 + 1/4$. [b]p3.[/b] What is the maximum possible area of a rectangle with integer side lengths and perimeter $8$? [b]p4.[/b] Given that $1$ printer weighs $400000$ pennies, and $80$ pennies weighs $2$ books, what is the weight of a printer expressed in books? [b]p5.[/b] Given that two sides of a triangle are $28$ and $3$ and all three sides are integers, what is the sum of the possible lengths of the remaining side? [b]p6.[/b] What is half the sum of all positive integers between $1$ and $15$, inclusive, that have an even number of positive divisors? [b]p7.[/b] Austin the Snowman has a very big brain. His head has radius $3$, and the volume of his torso is one third of his head, and the volume of his legs combined is one third of his torso. If Austin's total volume is $a\pi$ where $a$ is an integer, what is $a$? [b]p8.[/b] Neethine the Kiwi says that she is the eye of the tiger, a fighter, and that everyone is gonna hear her roar. She is standing at point $(3, 3)$. Neeton the Cat is standing at $(11,18)$, the farthest he can stand from Neethine such that he can still hear her roar. Let the total area of the region that Neeton can stand in where he can hear Neethine's roar be $a\pi$ where $a$ is an integer. What is $a$? [b]p9.[/b] Consider $2018$ identical kiwis. These are to be divided between $5$ people, such that the first person gets $a_1$ kiwis, the second gets $a_2$ kiwis, and so forth, with $a_1 \le a_2 \le a_3 \le a_4 \le a_5$. How many tuples $(a_1, a_2, a_3, a_4, a_5)$ can be chosen such that they form an arithmetic sequence? [b]p10.[/b] On the standard $12$ hour clock, each number from $1$ to $12$ is replaced by the sum of its divisors. On this new clock, what is the number of degrees in the measure of the non-reflex angle between the hands of the clock at the time when the hour hand is between $7$ and $6$ while the minute hand is pointing at $15$? [b]p11.[/b] In equiangular hexagon $ABCDEF$, $AB = 7$, $BC = 3$, $CD = 8$, and $DE = 5$. The area of the hexagon is in the form $\frac{a\sqrt{b}}{c}$ with $b$ square free and $a$ and $c$ relatively prime. Find $a+b+c$ where $a, b,$ and $c$ are integers. [b]p12.[/b] Let $\frac{p}{q} = \frac15 + \frac{2}{5^2} + \frac{3}{5^3} + ...$ . Find $p + q$, where $p$ and $q$ are relatively prime positive integers. [b]p13.[/b] Two circles $F$ and $G$ with radius $10$ and $4$ respectively are externally tangent. A square $ABMC$ is inscribed in circle $F$ and equilateral triangle $MOP$ is inscribed in circle $G$ (they share vertex $M$). If the area of pentagon $ABOPC$ is equal to $a + b\sqrt{c}$, where $a$, $b$, $c$ are integers $c$ is square free, then find $a + b + c$. [b]p14.[/b] Consider the polynomial $P(x) = x^3 + 3x^2 + ax + 8$. Find the sum of all integer $a$ such that the sum of the squares of the roots of $P(x)$ divides the sum of the coecients of $P(x)$. [b]p15.[/b] Nithin and Antonio play a number game. At the beginning of the game, Nithin picks a prime $p$ that is less than $100$. Antonio then tries to find an integer $n$ such that $n^6 + 2n^5 + 2n^4 + n^3 + (n^2 + n + 1)^2$ is a multiple of $p$. If Antonio can find such a number n, then he wins, otherwise, he loses. Nithin doesn't know what he is doing, and he always picks his prime randomly while Antonio always plays optimally. The probability of Antonio winning is $a/b$ where $a$ and $b$ are relatively prime positive integers. Find$a + b$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $A = \{1,2,..., 100\}$ and $B$ is a subset of $A$ having $48$ elements. Show that $B$ has two distint elements $x$ and $y$ whose sum is divisible by $11$.

Solve in integers $20^x+13^y=2013^z$.

There are $100$ numbers on circle, and no one number is divided by other. In same time for all numbers we make next operation: If $(a,b)$ are two neighbors ($a$ is left neighbor) , then we write between $a,b$ number $\frac{a}{(a,b)}$ and erase $a,b$ This operation was repeated some times. What maximum number of $1$ we can receive ? Example: If we have circle with $3$ numbers $4,5,6$ then after operation we receive circle with numbers $\frac{4}{(4,5)}=4,\frac{5}{(5,6)}=5, \frac{6}{(6,4)}=3$.