A square board with dimensions $100 \times 100$ is divided into $10 000 $unit squares. One of the squares is cut out. Is it possible to cover the rest of the board by isosceles right angled triangles which have hypotenuses of length $2$, and in such a way that their hypotenuses lie on sides of the squares and their other two sides lie on diagonals? The triangles must not overlap each other or extend beyond the edges of the board. (S Fomin, Leningrad)

$12$ friends play a tennis tournament, where each plays only one game with any of the other eleven. Winner gets one points. Loser getos zero points, and there is no draw. Final points of the participants are $B_1, B_2, ..., B_{12}$. Find the largest possible value of the sum $\Sigma_3=B_1^3+B_2^3+ ... + B_{12}^3$ .

Three boxes contain 600 balls each. The first box contains 600 identical red balls, the second box contains 600 identical white balls and the third box contains 600 identical blue balls. From these three boxes, 900 balls are chosen. In how many ways can the balls be chosen? For example, one can choose 250 red balls, 187 white balls and 463 balls, or one can choose 360 red balls and 540 blue balls.

On the circumference of a circle, there are $3n$ colored points that divide the circle on $3n$ arches, $n$ of which have lenght $1$, $n$ of which have length $2$ and the rest of them have length $3$ . Prove that there are two colored points on the same diameter of the circle.

Larry and Rob are two robots travelling in one car from Argovia to Zillis. Both robots have control over the steering and steer according to the following algorithm: Larry makes a 90 degrees left turn after every $ \ell$ kilometer driving from start, Rob makes a 90 degrees right turn after every $ r$ kilometer driving from start, where $ \ell$ and $ r$ are relatively prime positive integers. In the event of both turns occurring simultaneously, the car will keep going without changing direction. Assume that the ground is flat and the car can move in any direction. Let the car start from Argovia facing towards Zillis. For which choices of the pair ($ \ell$, $ r$) is the car guaranteed to reach Zillis, regardless of how far it is from Argovia?

In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]

In a school, \( n \) different languages are taught. It is known that for any subset of these languages (including the empty set), there is exactly one student who knows these and only these languages (there are \( 2^n \) students in total). Each day, the students are divided into pairs and teach each other the languages that only one of them knows. If students are not allowed to be in the same pair twice, what is the minimum number of days the school administration needs to guarantee that all their students know all \( n \) languages? [i]Proposed by Oleksii Masalitin[/i]

Numbers $m$ and $n$ are given positive integers. There are $mn$ people in a party, standing in the shape of an $m\times n$ grid. Some of these people are police officers and the rest are the guests. Some of the guests may be criminals. The goal is to determine whether there is a criminal between the guests or not.\\ Two people are considered \textit{adjacent} if they have a common side. Any police officer can see their adjacent people and for every one of them, know that they're criminal or not. On the other hand, any criminal will threaten exactly one of their adjacent people (which is likely an officer!) to murder. A threatened officer will be too scared, that they deny the existence of any criminal between their adjacent people.\\ Find the least possible number of officers such that they can take position in the party, in a way that the goal is achievable. (Note that the number of criminals is unknown and it is possible to have zero criminals.) [i]Proposed by Abolfazl Asadi[/i]

Given a finite string $S$ of symbols $X$ and $O$, we write $@(S)$ for the number of $X$'s in $S$ minus the number of $O$'s. (For example, $@(XOOXOOX) =-1$.) We call a string $S$ [b]balanced[/b] if every substring $T$ of (consecutive symbols) $S$ has the property $-2 \leq @(T) \leq 2$. (Thus $XOOXOOX$ is not balanced since it contains the sub-string $OOXOO$ whose $@$-value is $-3$.) Find, with proof, the number of balanced strings of length $n$.

Let $X$ be a set with $n\ge 2$ elements. Define $\mathcal{P}(X)$ to be the set of all subsets of $X$. Find the number of functions $f:\mathcal{P}(X)\mapsto \mathcal{P}(X)$ such that $$|f(A)\cap f(B)|=|A\cap B|$$ whenever $A$ and $B$ are two distinct subsets of $X$. [i] (Sergiu Novac)[/i]

The positive quadrant of a coordinate plane is divided into unit squares by lattice lines. Is it possible to color the squares in black and white so that: (i) In every square of side $n$ ($n \in N$) with a vertex at the origin and sides are parallel to the axes, there are more black than white squares; (ii) Every diagonal parallel to the line $y = x$ intersects only finitely many black squares?

Let $n$ be an integer greater than $1$. In the Cartesian coordinate system we consider all squares with integer vertices $(x,y)$ such that $1\le x,y\le n$. Denote by $p_k\ (k=0,1,2,\ldots )$ the number of pairs of points that are vertices of exactly $k$ such squares. Prove that $\sum_k(k-1)p_k=0$.

A country contains $n$ cities and some towns. There is at most one road between each pair of towns and at most one road between each town and each city, but all the towns and cities are connected, directly or indirectly. We call a route between a city and a town a gold route if there is no other route between them which passes through fewer towns. Show that we can divide the towns and cities between $n$ republics, so that each belongs to just one republic, each republic has just one city, and each republic contains all the towns on at least one of the gold routes between each of its towns and its city.

Prove that, for any natural number $n$, the graph of any increasing function $f : [0,1] \to [0, 1]$ can be covered by $n$ rectangles each of area whose sides are parallel to the coordinate axes. Assume that a rectangle includes both its interior and boundary points. (a) Assume that $f(x)$ is continuous on $[0,1]$. (b) Do not assume that $f(x)$ is continuous on $[0,1]$. (A Andjans, Riga) PS. (a) for O Level, (b) for A Level

On competition which has $16$ teams, it is played $55$ games. Prove that among them exists $3$ teams such that they have not played any matches between themselves.

Find the number of sequences of 10 letters where all the letters are either $A$ or $B$, the first letter is $A$, the last letter is $B$, and the sequence contains no three consecutive letters reading $ABA$. For example, count $AAABBABBAB$ and $ABBBBBBBAB$ but not $AABBAABABB$ or $AAAABBBBBA$.

Define a figure which is constructed by unit squares "cross star" if it satisfies the following conditions: $(1)$Square bar $AB$ is bisected by square bar $CD$ $(2)$At least one square of $AB$ lay on both sides of $CD$ $(3)$At least one square of $CD$ lay on both sides of $AB$ There is a rectangular grid sheet composed of $38\times 53=2014$ squares,find the number of such cross star in this rectangle sheet

In a rectangle with sides of length 20 and 25 there are 120 squares of side length 1. Prove that there is a circle with a diameter of 1 contained in this rectangle and having no points in common with any of these squares.

[b]p1[/b]. Evaluate $1! + 2! + 3! + 4! + 5! $ (where $n!$ is the product of all integers from $1$ to $n$, inclusive). [b]p2.[/b] Harold opens a pack of Bertie Bott's Every Flavor Beans that contains $10$ blueberry, $10$ watermelon, $3$ spinach and $2$ earwax-flavored jelly beans. If he picks a jelly bean at random, then what is the probability that it is not spinach-flavored? [b]p3.[/b] Find the sum of the positive factors of $32$ (including $32$ itself). [b]p4.[/b] Carol stands at a flag pole that is $21$ feet tall. She begins to walk in the direction of the flag's shadow to say hi to her friends. When she has walked $10$ feet, her shadow passes the flag's shadow. Given that Carol is exactly $5$ feet tall, how long in feet is her shadow? [b]p5.[/b] A solid metal sphere of radius $7$ cm is melted and reshaped into four solid metal spheres with radii $1$, $5$, $6$, and $x$ cm. What is the value of $x$? [b]p6.[/b] Let $A = (2,-2)$ and $B = (-3, 3)$. If $(a,0)$ and $(0, b)$ are both equidistant from $A$ and $B$, then what is the value of $a + b$? [b]p7.[/b] For every flip, there is an $x^2$ percent chance of flipping heads, where $x$ is the number of flips that have already been made. What is the probability that my first three flips will all come up tails? [b]p8.[/b] Consider the sequence of letters $Z\,\,W\,\,Y\,\,X\,\,V$. There are two ways to modify the sequence: we can either swap two adjacent letters or reverse the entire sequence. What is the least number of these changes we need to make in order to put the letters in alphabetical order? [b]p9.[/b] A square and a rectangle overlap each other such that the area inside the square but outside the rectangle is equal to the area inside the rectangle but outside the square. If the area of the rectangle is $169$, then find the side length of the square. [b]p10.[/b] If $A = 50\sqrt3$, $B = 60\sqrt2$, and $C = 85$, then order $A$, $B$, and $C$ from least to greatest. [b]p11.[/b] How many ways are there to arrange the letters of the word $RACECAR$? (Identical letters are assumed to be indistinguishable.) [b]p12.[/b] A cube and a regular tetrahedron (which has four faces composed of equilateral triangles) have the same surface area. Let $r$ be the ratio of the edge length of the cube to the edge length of the tetrahedron. Find $r^2$. [b]p13.[/b] Given that $x^2 + x + \frac{1}{x} +\frac{1}{x^2} = 10$, find all possible values of $x +\frac{1}{x}$ . [b]p14.[/b] Astronaut Bob has a rope one unit long. He must attach one end to his spacesuit and one end to his stationary spacecraft, which assumes the shape of a box with dimensions $3\times 2\times 2$. If he can attach and re-attach the rope onto any point on the surface of his spacecraft, then what is the total volume of space outside of the spacecraft that Bob can reach? Assume that Bob's size is negligible. [b]p15.[/b] Triangle $ABC$ has $AB = 4$, $BC = 3$, and $AC = 5$. Point $B$ is reflected across $\overline{AC}$ to point $B'$. The lines that contain $AB'$ and $BC$ are then drawn to intersect at point $D$. Find $AD$. [b]p16.[/b] Consider a rectangle $ABCD$ with side lengths $5$ and $12$. If a circle tangent to all sides of $\vartriangle ABD$ and a circle tangent to all sides of $\vartriangle BCD$ are drawn, then how far apart are the centers of the circles? [b]p17.[/b] An increasing geometric sequence $a_0, a_1, a_2,...$ has a positive common ratio. Also, the value of $a_3 + a_2 - a_1 - a_0$ is equal to half the value of $a_4 - a_0$. What is the value of the common ratio? [b]p18.[/b] In triangle $ABC$, $AB = 9$, $BC = 11$, and $AC = 16$. Points $E$ and $F$ are on $\overline{AB}$ and $\overline{BC}$, respectively, such that $BE = BF = 4$. What is the area of triangle $CEF$? [b]p19.[/b] Xavier, Yuna, and Zach are running around a circular track. The three start at one point and run clockwise, each at a constant speed. After $8$ minutes, Zach passes Xavier for the first time. Xavier first passes Yuna for the first time in $12$ minutes. After how many seconds since the three began running did Zach first pass Yuna? [b]p20.[/b] How many unit fractions are there such that their decimal equivalent has a cycle of $6$ repeating integers? Exclude fractions that repeat in cycles of $1$, $2$, or $3$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Ana and Beto play on a blackboard where all integers from 1 to 2024 (inclusive) are written. On each turn, Ana chooses three numbers $a,b,c$ written on the board and then Beto erases them and writes one of the following numbers: $$a+b-c, a-b+c, ~\text{or}~ -a+b+c.$$ The game ends when only two numbers are left on the board and Ana cannot play. If the sum of the final numbers is a multiple of 3, Beto wins. Otherwise, Ana wins. ¿Who has a winning strategy?

Find the sum of all 3-digit natural numbers which contain at least one odd digit and at least one even digit.

Let $a_1 < a_2 < .... < a_n < 2n$ ne $n$ positive integers such that $a_j$ does not divide $a_k$ or $j \not= k$. Prove that $a_1 \geq 2^{k}$ where $k$ is defined by the condition $3^{k} < 2n < 3^{k+1}$ and show that it is the best estimate for $a_1$

[b]p1.[/b] If $x$ is a real number that satisfies $\frac{48}{x} = 16$, find the value of $x$. [b]p2.[/b] If $ABC$ is a right triangle with hypotenuse $BC$ such that $\angle ABC = 35^o$, what is $\angle BCA$ in degrees? [img]https://cdn.artofproblemsolving.com/attachments/a/b/0f83dc34fb7934281e0e3f988ac34f653cc3f1.png[/img] [b]p3.[/b] If $a\vartriangle b = a + b - ab$, find $4\vartriangle 9$. [b]p4.[/b] Grizzly is $6$ feet tall. He measures his shadow to be $4$ feet long. At the same time, his friend Panda helps him measure the shadow of a nearby lamp post, and it is $6$ feet long. How tall is the lamp post in feet? [b]p5.[/b] Jerry is currently twice as old as Tom was $7$ years ago. Tom is $6$ years younger than Jerry. How many years old is Tom? [b]p6.[/b] Out of the $10, 000$ possible four-digit passcodes on a phone, how many of them contain only prime digits? [b]p7.[/b] It started snowing, which means Moor needs to buy snow shoes for his $6$ cows and $7$ sky bison. A cow has $4$ legs, and a sky bison has $6$ legs. If Moor has 36 snow shoes already, how many more shoes does he need to buy? Assume cows and sky bison wear the same type of shoe and each leg gets one shoe. [b]p8.[/b] How many integers $n$ with $1 \le n \le 100$ have exactly $3$ positive divisors? [b]p9.[/b] James has three $3$ candies and $3$ green candies. $3$ people come in and each randomly take $2$ candies. What is the probability that no one got $2$ candies of the same color? Express your answer as a decimal or a fraction in lowest terms. [b]p10.[/b] When Box flips a strange coin, the coin can land heads, tails, or on the side. It has a $\frac{1}{10}$probability of landing on the side, and the probability of landing heads equals the probability of landing tails. If Box flips a strange coin $3$ times, what is the probability that the number of heads flipped is equal to the number of tails flipped? Express your answer as a decimal or a fraction in lowest terms. [b]p11.[/b] James is travelling on a river. His canoe goes $4$ miles per hour upstream and $6$ miles per hour downstream. He travels $8$ miles upstream and then $8$ miles downstream (to where he started). What is his average speed, in miles per hour? Express your answer as a decimal or a fraction in lowest terms. [b]p12.[/b] Four boxes of cookies and one bag of chips cost exactly $1000$ jelly beans. Five bags of chips and one box of cookies cost less than $1000$ jelly beans. If both chips and cookies cost a whole number of jelly beans, what is the maximum possible cost of a bag of chips? [b]p13.[/b] June is making a pumpkin pie, which takes the shape of a truncated cone, as shown below. The pie tin is $18$ inches wide at the top, $16$ inches wide at the bottom, and $1$ inch high. How many cubic inches of pumpkin filling are needed to fill the pie? [img]https://cdn.artofproblemsolving.com/attachments/7/0/22c38dd6bc42d15ad9352817b25143f0e4729b.png[/img] [b]p14.[/b] For two real numbers $a$ and $b$, let $a\# b = ab - 2a - 2b + 6$. Find a positive real number $x$ such that $(x\#7) \#x = 82$. [b]p15.[/b] Find the sum of all positive integers $n$ such that $\frac{n^2 + 20n + 51}{n^2 + 4n + 3}$ is an integer. [b]p16.[/b] Let $ABC$ be a right triangle with hypotenuse $AB$ such that $AC = 36$ and $BC = 15$. A semicircle is inscribed in $ABC$ as shown, such that the diameter $XC$ of the semicircle lies on side $AC$ and that the semicircle is tangent to $AB$. What is the radius of the semicircle? [img]https://cdn.artofproblemsolving.com/attachments/4/2/714f7dfd09f6da1d61a8f910b5052e60dcd2fb.png[/img] [b]p17.[/b] Let $a$ and $b$ be relatively prime positive integers such that the product $ab$ is equal to the least common multiple of $16500$ and $990$. If $\frac{16500}{a}$ and $\frac{990}{b}$ are both integers, what is the minimum value of $a + b$? [b]p18.[/b] Let $x$ be a positive real number so that $x - \frac{1}{x} = 1$. Compute $x^8 - \frac{1}{x^8}$ . [b]p19.[/b] Six people sit around a round table. Each person rolls a standard $6$-sided die. If no two people sitting next to each other rolled the same number, we will say that the roll is valid. How many dierent rolls are valid? [b]p20.[/b] Given that $\frac{1}{31} = 0.\overline{a_1a_2a_3a_4a_5... a_n}$ (that is, $\frac{1}{31}$ can be written as the repeating decimal expansion $0.a_1a_2... a_na_1a_2... a_na_1a_2...$ ), what is the minimum value of $n$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $A$ be a set consisting of 6 points in the plane. denoted $n(A)$ as the number of the unit circles which meet at least three points of $A$. Find the maximum of $n(A)$

Consider the segment $[0; 1]$. At each step we may split one of the available segments into two new segments and write the product of lengths of these two new segments onto a blackboard. Prove that the sum of the numbers on the blackboard never will exceed $1/2$. [i]Mikhail Lukin[/i]