There are $75$ points in the plane, no three collinear. Prove that the number of acute triangles is no more than $70\%$ from the total number of triangles with vertices in these points.

Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.

It is known that, having $6$ weighs, it is possible to balance the scales with loads, which weights are successing natural numbers from $1$ to $63$. Find all such sets of weighs.

Five people of heights $65$, $66$, $67$, $68$, and $69$ inches stand facing forwards in a line. How many orders are there for them to line up, if no person can stand immediately before or after someone who is exactly $1$ inch taller or exactly $1$ inch shorter than himself?

A set $\mathcal S$ of translates of an equilateral triangle is given in the plane, and any two have nonempty intersection. Prove that there exist three points such that every triangle in $\mathcal S$ contains one of these points.

[b]p1. [/b] At Duke, $1/2$ of the students like lacrosse, $3/4$ like football, and $7/8$ like basketball. Let $p$ be the proportion of students who like at least all three of these sports and let $q$ be the difference between the maximum and minimum possible values of $p$. If $q$ is written as $m/n$ in lowest terms, find the value of $m + n$. [b]p2.[/b] A [i]dukie [/i]word is a $10$-letter word, each letter is one of the four $D, U, K, E$ such that there are four consecutive letters in that word forming the letter $DUKE$ in this order. For example, $DUDKDUKEEK$ is a dukie word, but $DUEDKUKEDE$ is not. How many different dukie words can we construct in total? [b]p3.[/b] Rectangle $ABCD$ has sides $AB = 8$, $BC = 6$. $\vartriangle AEC$ is an isosceles right triangle with hypotenuse $AC$ and $E$ above $AC$. $\vartriangle BFD$ is an isosceles right triangle with hypotenuse $BD$ and $F$ below $BD$. Find the area of $BCFE$. [b]p4.[/b] Chris is playing with $6$ pumpkins. He decides to cut each pumpkin in half horizontally into a top half and a bottom half. He then pairs each top-half pumpkin with a bottom-half pumpkin, so that he ends up having six “recombinant pumpkins”. In how many ways can he pair them so that only one of the six top-half pumpkins is paired with its original bottom-half pumpkin? [b]p5.[/b] Matt comes to a pumpkin farm to pick $3$ pumpkins. He picks the pumpkins randomly from a total of $30$ pumpkins. Every pumpkin weighs an integer value between $7$ to $16$ (including $7$ and $16$) pounds, and there’re $3$ pumpkins for each integer weight between $7$ to $16$. Matt hopes the weight of the $3$ pumpkins he picks to form the length of the sides of a triangle. Let $m/n$ be the probability, in lowest terms, that Matt will get what he hopes for. Find the value of $m + n$ [b]p6.[/b] Let $a, b, c, d$ be distinct complex numbers such that $|a| = |b| = |c| = |d| = 3$ and $|a + b + c + d| = 8$. Find $|abc + abd + acd + bcd|$. [b]p7.[/b] A board contains the integers $1, 2, ..., 10$. Anna repeatedly erases two numbers $a$ and $b$ and replaces it with $a + b$, gaining $ab(a + b)$ lollipops in the process. She stops when there is only one number left in the board. Assuming Anna uses the best strategy to get the maximum number of lollipops, how many lollipops will she have? [b]p8.[/b] Ajay and Joey are playing a card game. Ajay has cards labelled $2, 4, 6, 8$, and $10$, and Joey has cards labelled $1, 3, 5, 7, 9$. Each of them takes a hand of $4$ random cards and picks one to play. If one of the cards is at least twice as big as the other, whoever played the smaller card wins. Otherwise, the larger card wins. Ajay and Joey have big brains, so they play perfectly. If $m/n$ is the probability, in lowest terms, that Joey wins, find $m + n$. [b]p9.[/b] Let $ABCDEFGHI$ be a regular nonagon with circumcircle $\omega$ and center $O$. Let $M$ be the midpoint of the shorter arc $AB$ of $\omega$, $P$ be the midpoint of $MO$, and $N$ be the midpoint of $BC$. Let lines $OC$ and $PN$ intersect at $Q$. Find the measure of $\angle NQC$ in degrees. [b]p10.[/b] In a $30 \times 30$ square table, every square contains either a kit-kat or an oreo. Let $T$ be the number of triples ($s_1, s_2, s_3$) of squares such that $s_1$ and $s_2$ are in the same row, and $s_2$ and $s_3$ are in the same column, with $s_1$ and $s_3$ containing kit-kats and $s_2$ containing an oreo. Find the maximum value of $T$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a positive integer and $A=\{ 1,2,\ldots ,n\}$. A subset of $A$ is said to be connected if it consists of one element or several consecutive elements. Determine the maximum $k$ for which there exist $k$ distinct subsets of $A$ such that the intersection of any two of them is connected.

Given positive integers $n_1<n_2<...<n_{2000}<10^{100}$. Prove that we can choose from the set $\{n_1,...,n_{2000}\}$ nonempty, disjont sets $A$ and $B$ which have the same number of elements, the same sum and the same sum of squares.

Let $x_1,\ldots, x_n$ and $y_1,\ldots, y_n$ be real numbers. Let $A = (a_{ij})_{1\leq i,j\leq n}$ be the matrix with entries \[a_{ij} = \begin{cases}1,&\text{if }x_i + y_j\geq 0;\\0,&\text{if }x_i + y_j < 0.\end{cases}\] Suppose that $B$ is an $n\times n$ matrix with entries $0$, $1$ such that the sum of the elements in each row and each column of $B$ is equal to the corresponding sum for the matrix $A$. Prove that $A=B$.

[u]Round 4[/u] [b]p10.[/b] How many divisors of $10^{11}$ have at least half as many divisors that $10^{11}$ has? [b]p11.[/b] Let $f(x, y) = \frac{x}{y}+\frac{y}{x}$ and $g(x, y) = \frac{x}{y}-\frac{y}{x} $. Then, if $\underbrace{f(f(... f(f(}_{2021 fs} f(f(1, 2), g(2,1)), 2), 2)... , 2), 2)$ can be expressed in the form $a + \frac{b}{c}$, where $a$, $b$,$c$ are nonnegative integers such that $b < c$ and $gcd(b,c) = 1$, find $a + b + \lceil (\log_2 (\log_2 c)\rceil $ [b]p12.[/b] Let $ABC$ be an equilateral triangle, and let$ DEF$ be an equilateral triangle such that $D$, $E$, and $F$ lie on $AB$, $BC$, and $CA$, respectively. Suppose that $AD$ and $BD$ are positive integers, and that $\frac{[DEF]}{[ABC]}=\frac{97}{196}$. The circumcircle of triangle $DEF$ meets $AB$, $BC$, and $CA$ again at $G$, $H$, and $I$, respectively. Find the side length of an equilateral triangle that has the same area as the hexagon with vertices $D, E, F, G, H$, and $I$. [u]Round 5 [/u] [b]p13.[/b] Point $X$ is on line segment $AB$ such that $AX = \frac25$ and $XB = \frac52$. Circle $\Omega$ has diameter $AB$ and circle $\omega$ has diameter $XB$. A ray perpendicular to $AB$ begins at $X$ and intersects $\Omega$ at a point $Y$. Let $Z$ be a point on $\omega$ such that $\angle YZX = 90^o$. If the area of triangle $XYZ$ can be expressed as $\frac{a}{b}$ for positive integers $a, b$ with $gcd(a, b) = 1$, find $a + b$. [b]p14.[/b] Andrew, Ben, and Clayton are discussing four different songs; for each song, each person either likes or dislikes that song, and each person likes at least one song and dislikes at least one song. As it turns out, Andrew and Ben don't like any of the same songs, but Clayton likes at least one song that Andrew likes and at least one song that Ben likes! How many possible ways could this have happened? [b]p15.[/b] Let triangle $ABC$ with circumcircle $\Omega$ satisfy $AB = 39$, $BC = 40$, and $CA = 25$. Let $P$ be a point on arc $BC$ not containing $A$, and let $Q$ and $R$ be the reflections of $P$ in $AB$ and $AC$, respectively. Let $AQ$ and $AR$ meet $\Omega$ again at $S$ and $T$, respectively. Given that the reflection of $QR$ over $BC$ is tangent to $\Omega$ , $ST$ can be expressed as $\frac{a}{b}$ for positive integers $a, b$ with $gcd(a,b)= 1$. Find $a + b$. PS. You should use hide for answers. Rounds 1-3 have been posted [url=https://artofproblemsolving.com/community/c4h3131401p28368159]here [/url] and 6-7 [url=https://artofproblemsolving.com/community/c4h3131434p28368604]here [/url],Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let there be a tiger, William, at the origin. William leaps $ 1$ unit in a random direction, then leaps $2$ units in a random direction, and so forth until he leaps $15$ units in a random direction to celebrate PUMaC’s 15th year. There exists a circle centered at the origin such that the probability that William is contained in the circle (assume William is a point) is exactly $1/2$ after the $15$ leaps. The area of that circle can be written as $A\pi$. What is $A$?

Ryan stands on the bottom-left square of a 2017 by 2017 grid of squares, where each square is colored either black, gray, or white according to the pattern as depicted to the right. Each second he moves either one square up, one square to the right, or both one up and to the right, selecting between these three options uniformly and independently. Noting that he begins on a black square, find the probability that Ryan is still on a black square after 2017 seconds. [center][img]http://i.imgur.com/WNp59XW.png[/img][/center]

On a stormy night ten guests came to dinner party and left their shoes outside the room in order to keep the carpet clean. After the dinner there was a blackout, and the gusts leaving one by one, put on at random, any pair of shoes big enough for their feet. (Each pair of shoes stays together). Any guest who could not find a pair big enough spent the night there. What is the largest number of guests who might have had to spend the night there?

In a country, there are some two-way roads between the cities. There are $2010$ roads connected to the capital city. For all cities different from the capital city, there are less than $2010$ roads connected to that city. For two cities, if there are the same number of roads connected to these cities, then this number is even. $k$ roads connected to the capital city will be deleted. It is wanted that whatever the road network is, if we can reach from one city to another at the beginning, then we can reach after the deleting process also. Find the maximum value of $k.$

In a party among any four persons there are three people who are mutual acquaintances or mutual strangers. Prove that all the people can be separated into two groups $A$ and $B$ such that in $A$ everybody knows everybody else and in $B$ nobody knows anybody else.

$ 25$ boys and some girls came to the party and discovered an interesting property of their company. Take an arbitrary group of $ \geq 10$ boys and all the girls which are acquainted with at least one of them. Then in the joint group, the number of girls is by one greater than the number of boys. Prove that there exists a girl who is acquainted with at least $ 16$ boys.

There are $n$ sticks which have distinct integer length. Suppose that it's possible to form a non-degenerate triangle from any $3$ distinct sticks among them. It's also known that there are sticks of lengths $5$ and $12$ among them. What's the largest possible value of $n$ under such conditions? [i](Proposed by Bogdan Rublov)[/i]

Find all positive integers $N$ such that an $N\times N$ board can be tiled using tiles of size $5\times 5$ or $1\times 3$. Note: The tiles must completely cover all the board, with no overlappings.

Two $n$-sided polygons are said to be of the same type if we can label their vertices in clockwise order as $A_1$, $A_2$, ..., $A_n$ and $B_1$, $B_2$, ..., $B_n$ respectively such that each pair of interior angles $A_i$ and $B_i$ are either both reflex angles or both non-reflex angles. How many different types of $11$-sided polygons are there?

A computer program that works only with integer numbers reads the numbers on the screen, identifies the selected numbers and performs one of the following actions: • If button $A$ is pressed, the user selects $5$ numbers and then each selected number is changed to its successor; • If button $B$ is pressed, the user selects $5$ numbers and then each selected number is changed to its triple. Bento has this program on his computer with the numbers $1, 3, 3^2, · · ·, 3^{19}$ on the screen, each one appearing just once. a) By simply pressing button $A$ several times, is Bento able to make the sum of the numbers on the screen be $2024^{2025}$? b) What is the minimum number of times that Bento must press button $B$ to make all the numbers on the screen turn equal, without pressing button $A$?

Given some cards with either "$-1$" or "$+1$" written on the opposite side. You are allowed to choose a triple of cards and ask about the product of the three numbers on the cards. What is the minimal number of questions allowing to determine all the numbers on the cards ... a) for $30$ cards, b) for $31$ cards, c) for $32$ cards. (You should prove, that you cannot manage with less questions.) d) Fifty above mentioned cards are lying along the circumference. You are allowed to ask about the product of three consecutive numbers only. You need to determine the product af all the $50$ numbers. What is the minimal number of questions allowing to determine it?

Construct a tetromino by attaching two $2 \times 1$ dominoes along their longer sides such that the midpoint of the longer side of one domino is a corner of the other domino. This construction yields two kinds of tetrominoes with opposite orientations. Let us call them $S$- and $Z$-tetrominoes, respectively. Assume that a lattice polygon $P$ can be tiled with $S$-tetrominoes. Prove that no matter how we tile $P$ using only $S$- and $Z$-tetrominoes, we always use an even number of $Z$-tetrominoes. [i]Proposed by Tamas Fleiner and Peter Pal Pach, Hungary[/i]

A stage course is attended by $n \ge 4$ students. The day before the final exam, each group of three students conspire against another student to throw him/her out of the exam. Prove that there is a student against whom there are at least $\sqrt[3]{(n-1)(n- 2)} $conspirators.

There are 1997 pieces of medicine. Three bottles $A, B, C$ can contain at most 1997, 97, 19 pieces of medicine respectively. At first, all 1997 pieces are placed in bottle $A$, and the three bottles are closed. Each piece of medicine can be split into 100 part. When a bottle is opened, all pieces of medicine in that bottle lose a part each. A man wishes to consume all the medicine. However, he can only open each of the bottles at most once each day, consume one piece of medicine, move some pieces between the bottles, and close them. At least how many parts will be lost by the time he finishes consuming all the medicine?

Find the smallest positive integer $ K$ such that every $ K$-element subset of $ \{1,2,...,50 \}$ contains two distinct elements $ a,b$ such that $ a\plus{}b$ divides $ ab$.