Can one divide a square into finitely many triangles such that no two triangles share a side? (The triangles have pairwise disjoint interiors and their union is the square.)

Alice and Bob play the following game. It begins with a set of $1000$ $1\times 2$ rectangles. A [i]move[/i] consists of choosing two rectangles (a rectangle may consist of one or several $1\times 2$ rectangles combined together) that share a common side length and combining those two rectangles into one rectangle along those sides sharing that common length. The first player who cannot make a move loses. Alice moves first. Describe a winning strategy for Bob.

Let $N=10^{2024}$. $S$ is a square in the Cartesian plane with side length $N$ and the sides parallel to the coordinate axes. Inside there are $N$ points $P_1$, $P_2$, $\dots$, $P_N$ all of which have different $x$ coordinates, and the absolute value of the slope of any connected line between these points is at most $1$. Prove that there exists a line $l$ such that at least $2024$ of these points is at most distance $1$ away from $l$.

Find a way of arranging $n$ girls and $n$ boys around a round table for which $d_n-c_n$ is maximum, where dn is the number of girls sitting between two boys and $c_n$ is the number of boys sitting between two girls.

Let $\eta \in [0, 1]$ be a relative measure of material absorbence. $\eta$ values for materials combined together are additive. $\eta$ for a napkin is $10$ times that of a sheet of paper, and a cardboard roll has $\eta = 0.75$. Justin can create a makeshift cup with $\eta = 1$ using $50$ napkins and nothing else. How many sheets of paper would he need to add to a cardboard roll to create a makeshift cup with $\eta = 1$?

$ 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.

It is given regular polygon with $2n$ sides and center $S$. Consider every quadrilateral with vertices as vertices of polygon. Let $u$ be number of such quadrilaterals which contain point $S$ inside and $v$ number of remaining quadrilaterals. Find $u-v$

A permutation of the integers \(2020, 2021,...,2118, 2119\) is a list \(a_1,a_2,a_3,...,a_{100}\) where each one of the numbers appears exactly once. For each permutation we define the partial sums. $s_1=a_1$ $s_2=a_1+a_2$ $s_3=a_1+a_2+a_3$ $...$ $s_{100}=a_1+a_2+...+a_{100}$ How many of these permutations satisfy that none of the numbers \(s_1,...,s_{100}\) is divisible by $3$?

Alice has got a circular key ring with $n$ keys, $n\ge3$. When she takes it out of her pocket, she does not know whether it got rotated and/or flipped. The only way she can distinguish the keys is by coloring them (a color is assigned to each key). What is the minimum number of colors needed?

Find the maximal number of crosses with 5 squares that can be placed on 8x8 grid without overlapping.

Sixteen points are placed in the centers of a $4 \times 4$ chess table in the following way: • • • • • • • • • • • • • • • • (a) Prove that one may choose $6$ points such that no isoceles triangle can be drawn with the vertices at these points. (b) Prove that one cannot choose $7$ points with the above property.

The numbers from $1$ to $64$ must be written on the small squares of a chessboard, with a different number in each small square. Consider the $112$ numbers you can make by adding the numbers in two small squares which have a common edge. Is it possible to write the numbers in the squares so that these $112$ sums are all different?

Points $A_1, \ldots A_n$ with rational coordinates lie on a plane. It turned out that the distance between every pair of points is an integer. Prove that there exist points $B_1, \ldots ,B_n$ with integer coordinates such that $A_iA_j=B_iB_j$ for every pair $1 \leq i \leq j \leq n$ [i]N. Sheshko, D. Zmiaikou[/i]

In a room with $9$ students, there are $n$ clubs with $4$ participants in each club. For any pairs of clubs no more than $2$ students belong to both clubs. Prove that $n \le 18$ [i]Proposed by Manuel Aguilera, Valle[/i]

The $100 \times 100$ table is filled with numbers from $1$ to $10 \ 000$ as shown in the figure. Is it possible to rearrange some numbers so that there is still one number in each cell, and so that the sum of the numbers does not change in all rectangles of three cells?

Given positive integer $ n \ge 5 $ and a convex polygon $P$, namely $ A_1A_2...A_n $. No diagonals of $P$ are concurrent. Proof that it is possible to choose a point inside every quadrilateral $ A_iA_jA_kA_l (1\le i<j<k<l\le n) $ not on diagonals of $P$, such that the $ \tbinom{n}{4} $ points chosen are distinct, and any segment connecting these points intersect with some diagonal of P.

[b]p1.[/b] Find the smallest positive integer $N$ such that $N!$ is a multiple of $10^{2010}$. [b]p2.[/b] An equilateral triangle $T$ is externally tangent to three mutually tangent unit circles, as shown in the diagram. Find the area of $T$. [b]p3. [/b]The polynomial $p(x) = x^3 + ax^2 + bx + c$ has the property that the average of its roots, the product of its roots, and the sum of its coefficients are all equal. If $p(0) = 2$, find $b$. [b]p4.[/b] A regular pentagon $P = A_1A_2A_3A_4A_5$ and a square $S = B_1B_2B_3B_4$ are both inscribed in the unit circle. For a given pentagon $P$ and square $S$, let $f(P, S)$ be the minimum length of the minor arcs AiBj , for $1 \le i \le 5$ and $1 \le j \le 4$. Find the maximum of $f(P, S)$ over all pairs of shapes. [b]p5.[/b] Let $ a, b, c$ be three three-digit perfect squares that together contain each nonzero digit exactly once. Find the value of $a + b + c$. [b]p6. [/b]There is a big circle $P$ of radius $2$. Two smaller circles $Q$ and $R$ are drawn tangent to the big circle $P$ and tangent to each other at the center of the big circle $P$. A fourth circle $S$ is drawn externally tangent to the smaller circles $Q$ and $R$ and internally tangent to the big circle $P$. Finally, a tiny fifth circle $T$ is drawn externally tangent to the $3$ smaller circles $Q, R, S$. What is the radius of the tiny circle $T$? [b]p7.[/b] Let $P(x) = (1 +x)(1 +x^2)(1 +x^4)(1 +x^8)(...)$. This infinite product converges when $|x| < 1$. Find $P\left( \frac{1}{2010}\right)$. [b]p8.[/b] $P(x)$ is a polynomial of degree four with integer coefficients that satisfies $P(0) = 1$ and $P(\sqrt2 + \sqrt3) = 0$. Find $P(5)$. [b]p9.[/b] Find all positive integers $n \ge 3$ such that both roots of the equation $$(n - 2)x^2 + (2n^2 - 13n + 38)x + 12n - 12 = 0$$ are integers. [b]p10.[/b] Let $a, b, c, d, e, f$ be positive integers (not necessarily distinct) such that $$a^4 + b^4 + c^4 + d^4 + e^4 = f^4.$$ Find the largest positive integer $n$ such that $n$ is guaranteed to divide at least one of $a, b, c, d, e, f$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Each vertex of a regular $17$-gon is colored red, blue, or green in such a way that no two adjacent vertices have the same color. Call a triangle “multicolored” if its vertices are colored red, blue, and green, in some order. Prove that the $17$-gon can be cut along nonintersecting diagonals to form at least two multicolored triangles. (A diagonal of a polygon is a a line segment connecting two nonadjacent vertices. Diagonals are called nonintersecting if each pair of them either intersect in a vertex or do not intersect at all.)

Let $ M \equal{} \{ x_1..., x_{30}\}$ a set which consists of 30 distinct positive numbers, let $ A_n,$ $ 1 \leq n \leq 30,$ the sum of all possible products with $ n$ elements each of the set $ M.$ Prove if $ A_{15} > A_{10},$ then $ A_1 > 1.$

A [i]discrete hexagon with center \((a,b,c)\) \emph{(where \(a\), \(b\), \(c\) are integers)[/i] and radius \(r\) [i](a nonnegative integer)[/i]} is the set of lattice points \((x,y,z)\) such that \(x+y+z=a+b+c\) and \(\max(|x-a|,|y-b|,|z-c|)\le r\). Let \(n\) be a nonnegative integer and \(S\) be the set of triples \((x,y,z)\) of nonnegative integers such that \(x+y+z=n\). If \(S\) is partitioned into discrete hexagons, show that at least \(n+1\) hexagons are needed. [i]Proposed by Linus Tang[/i]

We color all vertexs of a convex polygon with $10$ vertexs by $2$ colors: red and blue $($each vertex is colored by $1$ color$).$ How many ways to color all the vertexs such that there are no $2$ adjacent vertex that are both colored red?

A wedding is going to be held in a city with $25$ types of meals, to which some of the $2017$ citizens will be invited. All of the citizens like some meals and each meal is liked by at least one person. A "$suitable$ $list$" is a set of citizens, such that each meal is liked by at least one person in the set. A "$kamber$ $group$" is a set that contains at least one person from each "$suitable$ $list$". Given a "$kamber$ $group$", which has no subset (other than itself) that is also a "$kamber$ $group$", prove that there exists a meal, which is liked by everyone in the group.

Alex and Bobby take turns playing the following game on an initially white row of $5000$ cells, with Alex starting first. On her turn, Alex must color two adjacent white cells black. On his turn, Bobby must color either one or three consecutive white cells black. No player can make a move after which there will be a white cell with no adjacent white cell. The game ends when one player cannot make a move (in which case that player loses), or when the entire row is colored black (in which case Alex wins). Who has a winning strategy?

A class has 30 students. To celebrate 'Tu BiShvat' each student chose some dried fruits out of $n$ different kinds. Say two students are friends if they both chose from the same type of fruit. Find the minimal $n$ so that it is possible that each student has exactly \(6\) friends.

A man disposes of sufficiently many metal bars of length $2$ and wants to construct a grill of the shape of an $n \times n$ unit net. He is allowed to fold up two bars at an endpoint or to cut a bar into two equal pieces, but two bars may not overlap or intersect. What is the minimum number of pieces he must use?