[b]p1.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square? [b]p2.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from $1$ to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number $3$? The total number of all obtained points is $264$. [b]p2.[/b] There are exactly $n$ students in a high school. Girls send messages to boys. The first girl sent messages to $5$ boys, the second to $7$ boys, the third to $6$ boys, the fourth to $8$ boys, the fifth to $7$ boys, the sixth to $9$ boys, the seventh to $8$, etc. The last girl sent messages to all the boys. Prove that $n$ is divisible by $3$. [b]p4.[/b] In what minimal number of triangles can one cut a $25 \times 12$ rectangle in such a way that one can tile by these triangles a $20 \times 15$ rectangle. [b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $C_{1}$, $C_{2}$ be circles intersecting in $X$, $Y$ . Let $A$, $D$ be points on $C_{1}$ and $B$, $C$ on $C_2$ such that $A$, $X$, $C$ are collinear and $D$, $X$, $B$ are collinear. The tangent to circle $C_{1}$ at $D$ intersects $BC$ and the tangent to $C_{2}$ at $B$ in $P$, $R$ respectively. The tangent to $C_2$ at $C$ intersects $AD$ and tangent to $C_1$ at $A$, in $Q$, $S$ respectively. Let $W$ be the intersection of $AD$ with the tangent to $C_{2}$ at $B$ and $Z$ the intersection of $BC$ with the tangent to $C_1$ at $A$. Prove that the circumcircles of triangles $YWZ$, $RSY$ and $PQY$ have two points in common, or are tangent in the same point. Proposed by Misiakos Panagiotis

An arbitrary line passing through vertex $B$ of triangle $ABC$ meets side $AC$ at point $K$ and the circumcircle in point $M$. Find the locus of circumcenters of triangles $AMK$.

A solitaire game is played as follows. Six distinct pairs of matched tiles are placed in a bag. The player randomly draws tiles one at a time from the bag and retains them, except that matching tiles are put aside as soon as they appear in the player's hand. The game ends if the player ever holds three tiles, no two of which match; otherwise the drawing continues until the bag is empty. The probability that the bag will be emptied is $p/q,$ where $p$ and $q$ are relatively prime positive integers. Find $p+q.$

In triangle $ABC$, $M\in(BC)$, $\frac{BM}{BC}=\alpha$, $N\in(CA)$, $\frac{CN}{CA}=\beta$, $P\in(AB)$, $\frac{AP}{AB}=\gamma$. Let $AM\cap BN=\{D\}$, $BN\cap CP=\{E\}$, $CP\cap AM=\{F\}$. Prove that $S_{DEF}=S_{BMD}+S_{CNE}+S_{APF}$ iff $\alpha+\beta+\gamma=1$.

Find all positive integers $a\in \{1,2,3,4\}$ such that if $b=2a$, then there exist infinitely many positive integers $n$ such that $$\underbrace{aa\dots aa}_\textrm{$2n$}-\underbrace{bb\dots bb}_\textrm{$n$}$$ is a perfect square.

Find all natural numbers $ a,b $ such that $ a^3+b^3 $ a power of $3.$

If $a$ and $b$ are positive integers such that $a^2-b^4= 2009$, find $a+b$.

$ x$ and $ y$ are real numbers. $A)$ If it is known that $ x \plus{} y$ and $ x \plus{} y^2$ are rational numbers, can we conclude that $ x$ and $ y$ are also rational numbers. $B)$ If it is known that $ x \plus{} y$ , $ x \plus{} y^2$ and $ x \plus{} y^3$ are rational numbers, can we conclude that $ x$ and $ y$ are also rational numbers.

In a group of $n$ people $A_1,A_2… A_n$ each one has a different height. On each turn we can choose any three of them and figure out which one of them is the highest and which one is the shortest. What’s the least number of turns one has to make in order to arrange these people by height, if: a) $n=5$; b) $n=6$; c) $n=7$?

$2020*N$ is a perfect cube. If $N$ can be expressed as $2^a*5^b*101^c,$ find the least possible value of $a+b+c$ such that $a,b,c$ are all positive integers and not necessarily distinct. [i]Proposed by Ephram Chun[/i]

Consider an odd prime number $p$ and $p$ consecutive positive integers $m_1,m_2,…,m_p$. Choose a permutation $\sigma$ of $1,2,…,p$ . Show that there exist two different numbers $k,l\in{(1,2,…,p)}$ such that $p\mid{m_k.m_{\sigma(k)}-m_l.m_{\sigma(l)}}$

An acute triangle is a triangle that has all angles less that $90^{\circ}$ ($90^{\circ}$ is a Right Angle). Let $ABC$ be a right-angled triangle with $\angle ACB =90^{\circ}.$ Let $CD$ be the altitude from $C$ to $AB,$ and let $E$ be the intersection of the angle bisector of $\angle ACD$ with $AD.$ Let $EF$ be the altitude from $E$ to $BC.$ Prove that the circumcircle of $BEF$ passes through the midpoint of $CE.$

$D, \: E , \: F$ are points on the sides $AB, \: BC, \: CA,$ respectively, of a triangle $ABC$ such that $AD=AF, \: BD=BE,$ and $DE=DF.$ Let $I$ be the incenter of the triangle $ABC,$ and let $K$ be the point of intersection of the line $BI$ and the tangent line through $A$ to the circumcircle of the triangle $ABI.$ Show that $AK=EK$ if $AK=AD.$

An $ (n, k) \minus{}$ tournament is a contest with $ n$ players held in $ k$ rounds such that: $ (i)$ Each player plays in each round, and every two players meet at most once. $ (ii)$ If player $ A$ meets player $ B$ in round $ i$, player $ C$ meets player $ D$ in round $ i$, and player $ A$ meets player $ C$ in round $ j$, then player $ B$ meets player $ D$ in round $ j$. Determine all pairs $ (n, k)$ for which there exists an $ (n, k) \minus{}$ tournament. [i]Proposed by Carlos di Fiore, Argentina[/i]

Let $(a_i)_{i\in \mathbb{N}}$ be a sequence with $a_1=\frac{3}2$ such that $$a_{n+1}=1+\frac{n}{a_n}$$ Find $n$ such that $2020\le a_n <2021$

Let $ABC$ be a triangle with circumcircle $\Gamma$. Let $\omega_0$ be a circle tangent to chord $AB$ and arc $ACB$. For each $i = 1, 2$, let $\omega_i$ be a circle tangent to $AB$ at $T_i$ , to $\omega_0$ at $S_i$ , and to arc $ACB$. Suppose $\omega_1 \ne \omega_2$. Prove that there is a circle passing through $S_1, S_2, T_1$, and $T_2$, and tangent to $\Gamma$ if and only if $\angle ACB = 90^o$. .

A list of natural numbers is written on a blackboard. The following operation is performed and repeated: choose any two numbers $a, b$, wipe them out and instead write gcd$(a, b)$ and lcm$(a, b)$. Show that the content of the list no longer changed after a certain point in time.

[b]9.[/b] Lep $p$ be a connected non-closed broken line without self-intersection in the plane $\varphi $. Prove that if $v$ is a non-zero vector in $\varphi $ and $p$ has a commom point with the broken line $p+v$, then $p$ has a common point with the broken line $p+\alpha v$ too, where $\alpha =\frac{1}{n}$ and $n$ is a positive integer. Does a similar statemente hold for other positive values of $\alpha$? ($p+v$ denotes the broken line obtained from $p$ through displacemente by the vector $v$.) [b](G. 1)[/b]

Centuries ago, the pirate Captain Blackboard buried a vast amount of treasure in a single cell of a $2 \times 4$ grid-structured island. Treasure was buried in a single cell of an $M\times N$ ($2\le M$, $N$) grid. You and your crew have reached the island and have brought special treasure detectors to find the cell with the treasure For each detector, you can set it up to scan a specific subgrid $[a,b]\times[c,d]$ with $1\le a\le b\le 2$ and $1\le c\le d\le 4$. Running the detector will tell you whether the treasure is in the region or not, though it cannot say where in the region the treasure was detected. You plan on setting up $Q$ detectors, which may only be run simultaneously after all $Q$ detectors are ready. What is the minimum $Q$ required to gaurantee to determine the location of the Blackboard’s legendary treasure?

Let $a_1 < a_2 < a_3 < a_4$ be positive integers such that the following conditions hold: -$\gcd(a_i,a_j)>1$ holds for all integers $1\le i < j\le 4$. -$\gcd(a_i,a_j,a_k)=1$ holds for all integers $1\le i < j < k\le 4$. Find the smallest possible value of $a_4$. [i]Proposed by James Lin[/i]

Find all pairs $(m, n)$ of natural numbers for which the numbers $m^2 - 4n$ and $n^2 - 4m$ are both perfect squares.

Several square-shaped papers are situated on a table such that every side of the paper is positioned parallel to the sides of the table. Each paper has a colour, and there are $n$ different coloured papers. It is known that for every $n$ papers with distinct colors, we can always find an overlapping pair of papers. Prove that, using $2n- 2$ nails, it is possible to hammer all the squares of a certain colour to the table.

[b]p1. [/b] What is the maximum number of $T$-shaped polyominos (shown below) that we can put into a $6 \times 6$ grid without any overlaps. The blocks can be rotated. [img]https://cdn.artofproblemsolving.com/attachments/7/6/468fd9b81e9115a4a98e4cbf6dedf47ce8349e.png[/img] [b]p2.[/b] In triangle $\vartriangle ABC$, $\angle A = 30^o$. $D$ is a point on $AB$ such that $CD \perp AB$. $E$ is a point on $AC$ such that $BE \perp AC$. What is the value of $\frac{DE}{BC}$ ? [b]p3.[/b] Given that f(x) is a polynomial such that $2f(x) + f(1 - x) = x^2$. Find the sum of squares of the coefficients of $f(x)$. [b]p4. [/b] For each positive integer $n$, there exists a unique positive integer an such that $a^2_n \le n < (a_n + 1)^2$. Given that $n = 15m^2$ , where $m$ is a positive integer greater than $1$. Find the minimum possible value of $n - a^2_n$. [b]p5.[/b] What are the last two digits of $\lfloor (\sqrt5 + 2)^{2016}\rfloor$ ? Note $\lfloor x \rfloor$ is the largest integer less or equal to x. [b]p6.[/b] Let $f$ be a function that satisfies $f(2^a3^b)) = 3a+ 5b$. What is the largest value of f over all numbers of the form $n = 2^a3^b$ where $n \le 10000$ and $a, b$ are nonnegative integers. [b]p7.[/b] Find a multiple of $21$ such that it has six more divisors of the form $4m + 1$ than divisors of the form $4n + 3$ where m, n are integers. You can keep the number in its prime factorization form. [b]p8.[/b] Find $$\sum^{100}_{i=0} \lfloor i^{3/2} \rfloor +\sum^{1000}_{j=0} \lfloor j^{2/3} \rfloor$$ where $\lfloor x \rfloor$ is the largest integer less or equal to x. [b]p9. [/b] Let $A, B$ be two randomly chosen subsets of $\{1, 2, . . . 10\}$. What is the probability that one of the two subsets contains the other? [b]p10.[/b] We want to pick $5$-person teams from a total of $m$ people such that: 1. Any two teams must share exactly one member. 2. For every pair of people, there is a team in which they are teammates. How many teams are there? (Hint: $m$ is determined by these conditions). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all pairs $(p,q)$ of primes for which both $p^2+q^3$ and $q^2+p^3$ are perfect squares.