Each square on a $ n \times n$ board, with $n \ge 3$, is colored with one of $ 8$ colors. For what values of $n$ it can be said that some of these figures included in the board, does it contain two squares of the same color. [img]https://cdn.artofproblemsolving.com/attachments/3/9/6af58460585772f39dd9e8ef1a2d9f37521317.png[/img]

A liquid is moving in an infinite pipe. For each molecule if it is at point with coordinate $x$ then after $t$ seconds it will be at a point of $p(t,x)$. Prove that if $p(t,x)$ is a polynomial of $t,x$ then speed of all molecules are equal and constant.

Prove the following identity for determinants: $ |c_{ik} \plus{} a_i \plus{} b_k \plus{} 1|_{i,k \equal{} 1,...,n} \plus{} |c_{ik}|_{i,k \equal{} 1,...,n} \equal{} |c_{ik} \plus{} a_i \plus{} b_k|_{i,k \equal{} 1,...,n} \plus{} |c_{ik} \plus{} 1|_{i,k \equal{} 1,...,n}$

Non-zero numbers $a, b, c$ are such that $ax^2+bx+c > cx$ for any $x$. Prove that $cx^2-bx + a > cx-b$ for any $x$.

The one-way routes connecting towns $A$, $M$, $C$, $X$, $Y$, and $Z$ are shown in the figure below (not drawn to scale).The distances in kilometers along each route are marked. Traveling along these routes, what is the shortest distance from A to Z in kilometers? [asy] /* AMC8 P14 2024, by NUMANA: BUI VAN HIEU */ import graph; unitsize(2cm); real r=0.25; // Define the nodes and their positions pair[] nodes = { (0,0), (2,0), (1,1), (3,1), (4,0), (6,0) }; string[] labels = { "A", "M", "X", "Y", "C", "Z" }; // Draw the nodes as circles with labels for(int i = 0; i < nodes.length; ++i) { draw(circle(nodes[i], r)); label("$" + labels[i] + "$", nodes[i]); } // Define the edges with their node indices and labels int[][] edges = { {0, 1}, {0, 2}, {2, 1}, {2, 3}, {1, 3}, {1, 4}, {3, 4}, {4, 5}, {3, 5} }; string[] edgeLabels = { "8", "5", "2", "10", "6", "14", "5", "10", "17" }; pair[] edgeLabelsPos = { S, SE, SW, S, SE, S, SW, S, NE}; // Draw the edges with labels for (int i = 0; i < edges.length; ++i) { pair start = nodes[edges[i][0]]; pair end = nodes[edges[i][1]]; draw(start + r*dir(end-start) -- end-r*dir(end-start), Arrow); label("$" + edgeLabels[i] + "$", midpoint(start -- end), edgeLabelsPos[i]); } // Draw the curved edge with label draw(nodes[1]+r * dir(-45)..controls (3, -0.75) and (5, -0.75)..nodes[5]+r * dir(-135), Arrow); label("$25$", midpoint(nodes[1]..controls (3, -0.75) and (5, -0.75)..nodes[5]), 2S); [/asy] $\textbf{(A)}\ 28 \qquad \textbf{(B)}\ 29 \qquad \textbf{(C)}\ 30 \qquad \textbf{(D)}\ 31 \qquad \textbf{(E)}\ 32$

Annie stands at one vertex of a regular hexagon. Every second, she moves independently to one of the two vertices adjacent to her, each with equal probability. Determine the probability that she is at her starting position after ten seconds.

Let $ABC$ be a triangle. $P$, $Q$ and $R$ are the points of contact of the incircle with sides $AB$, $BC$ and $CA$, respectively. Let $L$, $M$ and $N$ be the feet of the altitudes of the triangle $PQR$ from $R$, $P$ and $Q$, respectively. a) Show that the lines $AN$, $BL$ and $CM$ meet at a point. b) Prove that this points belongs to the line joining the orthocenter and the circumcenter of triangle $PQR$. [i]Aarón Ramírez, El Salvador[/i]

For the give functions in $\mathbb{N}$: [b](a)[/b] Euler's $\phi$ function ($\phi(n)$- the number of natural numbers smaller than $n$ and coprime with $n$); [b](b)[/b] the $\sigma$ function such that the $\sigma(n)$ is the sum of natural divisors of $n$. solve the equation $\phi(\sigma(2^x))=2^x$.

Two circles, $\omega_1$ and $\omega_2$, centered at $O_1$ and $O_2$, respectively, meet at points $A$ and $B$. A line through $B$ meet $\omega_1$ again at $C$, and $\omega_2$ again at $D$. The tangents to $\omega_1$ and $\omega_2$ at $C$ and $D$, respectively, meet at $E$, and the line $AE$ meets the circle $\omega$ through $A, O_1,O_2$ again at $F$. Prove that the length of the segment $EF$ is equal to the diameter of $\omega$.

Prove that: (1) In the complex plane, each line (except for the real axis) that crosses the origin has at most one point ${z}$, satisfy $$\frac {1+z^{23}}{z^{64}}\in\mathbb R.$$ (2) For any non-zero complex number ${a}$ and any real number $\theta$, the equation $1+z^{23}+az^{64}=0$ has roots in $$S_{\theta}=\left\{ z\in\mathbb C\mid\operatorname{Re}(ze^{-i\theta })\geqslant |z|\cos\frac{\pi}{20}\right\}.$$ [i]Proposed by Yijun Yao[/i]

Given that $i^2=-1$, for how many integers $n$ is $(n+i)^4$ an integer? $\text{(A)} \ \text{none} \qquad \text{(B)} \ 1 \qquad \text{(C)} \ 2 \qquad \text{(D)} \ 3 \qquad \text{(E)} \ 4$

Determine the smallest positive integer n for that there are positive integers $x_1, x_2,. . . , x_n$ so that each natural number from 1001 to 2021 inclusive can be written as sum of one or more different terms $x_i$ (i = 1, 2,..., n).

Evaluate the integral $\int_0^{\infty} \frac{\log(x+2)}{x^2+3x+2}\mathrm{d}x$.

How many ordered triples $(a, b, c)$ of odd positive integers satisfy $a + b + c = 25?$

Cut a square with three straight lines into three triangles and four quadrilaterals.

A triangle with side lengths $2$ and $3$ has an area of $3$. Compute the third side length of the triangle.

A cafe has 3 tables and 5 individual counter seats. People enter in groups of size between 1 and 4, inclusive, and groups never share a table. A group of more than 1 will always try to sit at a table, but will sit in counter seats if no tables are available. Conversely, a group of 1 will always try to sit at the counter first. One morning, $M$ groups consisting of a total of $N$ people enter and sit down. Then, a single person walks in, and realizes that all the tables and counter seats are occupied by some person or group. What is the minimum possible value of $M + N$?

[b]p1.[/b] (a) Suppose $101$ Dalmatians chase $2012$ squirrels. Each squirrel gets chased by at most one Dalmatian, and each Dalmatian chases at least one squirrel. Show that two Dalmatians chase the same number of squirrels. (b) What is the largest number of Dalmatians that can chase $2012$ squirrels in a way that each Dalmatian chases at least one squirrel and no two Dalmatians chase the same number of squirrels? [b]p2.[/b] Lucy and Linus play the following game. They start by putting the integers $1, 2, 3, ..., 2012$ in a hat. In each round of the game, Lucy and Linus each draw a number from the hat. If the two numbers are $a$ and $b$, they throw away these numbers and put the number $|a - b|$ back into the hat. After $2011$ rounds, there is only one number in the hat. If it is even, Lucy wins. If it is odd, Linus wins. (a) Prove that there is a sequence of drawings that makes Lucy win. (b) Prove that Lucy always wins. [b]p3.[/b] Suppose $x$ is a positive real number and $x^{1990}$, $x^{2001}$, and $x^{2012}$ differ by integers. Prove that $x$ is an integer. [b]p4.[/b] Suppose that each point in three-dimensional space is colored with one of five colors and suppose that each color is used at least once. Prove that there is some plane that contains at least four of the colors. [b]p5.[/b] Two circles, $C_1$ and $C_2$, are tangent at point $A$, with $C_1$ lying inside $C_2$ (and $C_1 \ne C_2$). The line through their centers intersects $C_1$ at $B_1$ and $C_2$ at $B_2$. A line $L$ is drawn through $A$ and it intersects $C_1$ at $P_1$ (with $P_1 \ne A$) and intersects $C_2$ at $P_2$ (with $P_2 \ne A$). The perpendicular from $P_2$ to the line $B_1B_2$ intersects the line $B_1B_2$ at $F$. Prove that if the line $P_1F$ is tangent to $C_1$ then $F$ is the midpoint of the line segment $B_1B_2$. [img]https://cdn.artofproblemsolving.com/attachments/9/e/4db59be9fa764d3e910a828ed3296907ca5657.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Evaluate $ \int_0^{\frac{\pi}{4}} \frac{1}{\cos \theta}\sqrt{\frac{1\plus{}\sin \theta}{\cos \theta}}\ d\theta$.

Let $D$ be an infinite (in one direction) sequence of zeros and ones. For each $n\in\mathbb{N}$, let $a_n$ denote the number of distinct subsequences of consecutive symbols in $D$ of length $n$. Does there exist a sequence $D$ for which the inequality \[ \left|\frac{a_n}{n\log_2 n} - 1\right| < \frac{1}{100} \] is satisfied for every natural number $n > 10^{10000}$?

Find all $4$ consecutive even numbers, such that the sum of their squares divides the square of their product.

In Pokemon, there are $10$ indistinguishable Poke Beans in a pile. Pikachu eats a prime number of Poke Beans. Charmander eats an even number of Poke Beans. Snorlax eats an odd number of Poke Beans. Find the number of ways for the three Pokemon to eat all $10$ Poke Beans.

$AD$, $BE$, and $CF$ are the bisectors of the interior angles of triangle $ABC$, with $D$, $E$, and $F$ lying on the perimeter. If angle $EDF$ is $90$ degrees, determine all possible values of angle $BAC$.

Let $a_i=min\{ k+\dfrac{i}{k}|k \in N^*\}$, determine the value of $S_{n^2}=[a_1]+[a_2]+\cdots +[a_{n^2}]$, where $n\ge 2$ . ($[x]$ denotes the greatest integer not exceeding x)

Let ABC be a triangle. The external and internal angle bisectors of ∠CAB intersect side BC at D and E, respectively. Let F be a point on the segment BC. The circumcircle of triangle ADF intersects AB and AC at I and J, respectively. Let N be the mid-point of IJ and H the foot of E on DN. Prove that E is the incenter of triangle AHF, or the center of the excircle. [i]Proposed by Steve Dinh[/i]