Determine the largest natural number $ N $ having the following property: every $ 5\times 5 $ array consisting of pairwise distinct natural numbers from $ 1 $ to $ 25 $ contains a $ 2\times 2 $ subarray of numbers whose sum is, at least, $ N. $ [i]Demetres Christofides[/i] and [i]Silouan Brazitikos[/i]

Find $\lim_{n\to\infty} \left(\frac{_{3n}C_n}{_{2n}C_n}\right)^{\frac{1}{n}}$ where $_iC_j$ is a binominal coefficient which means $\frac{i\cdot (i-1)\cdots(i-j+1)}{j\cdot (j-1)\cdots 2\cdot 1}$.

What fraction of a $5$-dimensional cube is the volume of the inscribed sphere? What fraction is it of a $10$-dimensional cube?

What is the last three digits of base-4 representation of $10\cdot 3^{195}\cdot 49^{49}$? $ \textbf{(A)}\ 112 \qquad\textbf{(B)}\ 130 \qquad\textbf{(C)}\ 132 \qquad\textbf{(D)}\ 212 \qquad\textbf{(E)}\ 232 $

Ephram is growing $3$ different variants of radishes in a row of $13$ radishes total, but he forgot where he planted each radish variant and he can't tell what variant a radish is before he picks it. Ephram knows that he planted at least one of each radish variant, and all radishes of one variant will form a consecutive string, with all such possibilities having an equal chance of occurring. He wants to pick three radishes to bring to the farmers market, and wants them to all be of different variants. Given that he uses optimal strategy, the probability that he achieves this can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [i]Proposed by Jeff Lin[/i]

Point $A$ is located in this circle of radius $1$. An arbitrary chord is drawn through it, and then a circle of radius $2$ is drawn through the ends of this chord. Prove that all such circles touch some fixed circle, not depending from the initial choice of the chord.

Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Show that $$\frac{a}{1+b^2}+\frac{b}{1+c^2}+\frac{c}{1+a^2}\geq \frac{3}{2}.$$

For each real number $x$, let $\textbf{[}x\textbf{]}$ be the largest integer not exceeding $x$ (i.e., the integer $n$ such that $n\le x<n+1$). Which of the following statements is (are) true? $\textbf{I. [}x+1\textbf{]}=\textbf{[}x\textbf{]}+1\text{ for all }x$ $\textbf{II. [}x+y\textbf{]}=\textbf{[}x\textbf{]}+\textbf{[}y\textbf{]}\text{ for all }x\text{ and }y$ $\textbf{III. [}xy\textbf{]}=\textbf{[}x\textbf{]}\textbf{[}y\textbf{]}\text{ for all }x\text{ and }y$ $\textbf{(A) }\text{none}\qquad\textbf{(B) }\textbf{I }\text{only}\qquad\textbf{(C) }\textbf{I}\text{ and }\textbf{II}\text{ only}\qquad\textbf{(D) }\textbf{III }\text{only}\qquad \textbf{(E) }\text{all}$

Let $Q(z)$ and $R(z)$ be the unique polynomials such that $$z^{2021}+1=(z^2+z+1)Q(z)+R(z)$$ and the degree of $R$ is less than $2.$ What is $R(z)?$ $\textbf{(A) }-z \qquad \textbf{(B) }-1 \qquad \textbf{(C) }2021\qquad \textbf{(D) }z+1 \qquad \textbf{(E) }2z+1$

Let $ \mathcal{M} $ a set of $ 3n\ge 3 $ planar points such that the maximum distance between two of these points is $ 1 $. Prove that: [b]a)[/b] among any four points,there are two aparted by a distance at most $ \frac{1}{\sqrt{2}} . $ [b]b)[/b] for $ n=2 $ and any $ \epsilon >0, $ it is possible that $ 12 $ or $ 15 $ of the distances between points from $ \mathcal{M} $ lie in the interval $ (1-\epsilon , 1]; $ but any $ 13 $ of the distances can´t be found all in the interval $ \left(\frac{1}{\sqrt 2} ,1\right]. $ [b]c)[/b] there exists a circle of diameter $ \sqrt{6} $ that contains $ \mathcal{M} . $ [b]d)[/b] some two points of $ \mathcal{M} $ are on a distance not exceeding $ \frac{4}{3\sqrt n-\sqrt 3} . $

If a shrub grows at the rate of $6$ inches per $5$ days, how many feet would it grow in a non-leap year? $\textbf{(A) } 2\dfrac12\text{ ft}\qquad\textbf{(B) } 36\dfrac12\text{ ft}\qquad\textbf{(C) } 182\dfrac12\text{ ft}\qquad\textbf{(D) } 73\text{ ft}\qquad\textbf{(E) } 365\text{ ft}$

Let $ABC$ be a triangle with obtuse angle $B$, and $P, Q$ lie on $AC$ in such a way that $AP = PB, BQ = QC$. The circle $BPQ$ meets the sides $AB$ and $BC$ at points $N$ and $M$ respectively. $\qquad\textbf{(a)}$ (grades 8-9) Prove that the distances from the common point $R$ of $PM$ and $NQ$ to $A$ and $C$ are equal. $\qquad\textbf{(b)}$ (grades 10-11) Let $BR$ meet $AC$ at point $S$. Prove that $MN \perp OS$, where $O$ is the circumcenter of $ABC$.

The circles ${{w} _ {1}}$ and ${{w} _ {2}}$ intersect at points $P$ and $Q$. Let $AB$ and $CD$ be parallel diameters of circles ${ {w} _ {1}}$ and ${{w} _ {2}} $, respectively. In this case, none of the points $A, B, C, D$ coincides with either $P$ or $Q$, and the points lie on the circles in the following order: $A, B, P, Q$ on the circle ${{w} _ {1} }$ and $C, D, P, Q$ on the circle ${{w} _ {2}} $. The lines $AP$ and $BQ$ intersect at the point $X$, and the lines $CP$ and $DQ$ intersect at the point $Y, X \ne Y$. Prove that all lines $XY$ for different diameters $AB$ and $CD$ pass through the same point or are all parallel. (Serdyuk Nazar)

Show that if $\sqrt{x}-\sqrt{y}=10$, then $x-2y\leq200$.

Suppose that a cubic function with respect to $x$, $f(x)=ax^3+bx^2+cx+d$ satisfies all of 3 conditions: \[f(1)=1,\ f(-1)=-1,\ \int_{-1}^1 (bx^2+cx+d)\ dx=1\]. Find $f(x)$ for which $I=\int_{-1}^{\frac 12} \{f''(x)\}^2\ dx$ is minimized, the find the minimum value. [i]2011 Tokyo University entrance exam/Humanities, Problem 1[/i]

Let $n$ be a positive integer. Prove that there exists a poisitve integer $m$ such that $$7^n \mid 3^m+5^m-1$$

a) Year 1872 Texas 3 gold miners found a peice of gold. They have a coin that with possibility of $\frac 12$ it will come each side, and they want to give the piece of gold to one of themselves depending on how the coin will come. Design a fair method (It means that each of the 3 miners will win the piece of gold with possibility of $\frac 13$) for the miners. b) Year 2005, faculty of Mathematics, Sharif university of Technolgy Suppose $0<\alpha<1$ and we want to find a way for people name $A$ and $B$ that the possibity of winning of $A$ is $\alpha$. Is it possible to find this way? c) Year 2005 Ahvaz, Takhti Stadium Two soccer teams have a contest. And we want to choose each player's side with the coin, But we don't know that our coin is fair or not. Find a way to find that coin is fair or not? d) Year 2005,summer In the National mathematical Oympiad in Iran. Each student has a coin and must find a way that the possibility of coin being TAIL is $\alpha$ or no. Find a way for the student.

Compute the unique five-digit positive integer $\underline{abcde}$ such that $a \neq 0, c \neq 0,$ and $$\underline{abcde}=(\underline{ab}+\underline{cde})^2.$$

In the country of Muilejistan, there exists a network of roads connecting all its cities. The network has the particular property that for any two cities, there is a unique path without backtracking (i.e., a path where the traveler never returns along the same road). The longest possible path between two cities is 600 kilometers. For instance, the path from the city of Mlar to the city of Nlar is 600 kilometers. Similarly, the path from the city of Klar to the city of Glar is also 600 kilometers. 1. If Jalim departs from Mlar towards Nlar at noon and Kalim departs from Klar towards Glar also at noon, both traveling at the same speed, prove that they meet at some point on their journey. 2. If the distance in kilometers between any two cities is an integer, prove that the distance from Glar to Mlar is even.

In a cone with height $3$ and base radius $4$, let $X$ be a point on the circumference of the base. Let $Y$ be a point on the surface of the cone such that the distance from $Y$ to the vertex of the cone is $2$, and $Y$ is diametrically opposite $X$ with respect to the base of the cone. The length of the shortest path across the surface of the cone from $X$ to $Y$ can be expressed as $\sqrt{a +\sqrt{b}}$, where a and b are positive integers. Find $a +b$.

Prove that there are exactly $\binom{k}{[k/2]}$ arrays $a_1, a_2, \ldots , a_{k+1}$ of nonnegative integers such that $a_1 = 0$ and $|a_i-a_{i+1}| = 1$ for $i = 1, 2, \ldots , k.$

We call a subset $B$ of natural numbers [i]loyal[/i] if there exists natural numbers $i\le j$ such that $B=\{i,i+1,\ldots,j\}$. Let $Q$ be the set of all [i]loyal[/i] sets. For every subset $A=\{a_1<a_2<\ldots<a_k\}$ of $\{1,2,\ldots,n\}$ we set \[f(A)=\max_{1\le i \le k-1}{a_{i+1}-a_i}\qquad\text{and}\qquad g(A)=\max_{B\subseteq A, B\in Q} |B|.\] Furthermore, we define \[F(n)=\sum_{A\subseteq \{1,2,\ldots,n\}} f(A)\qquad\text{and}\qquad G(n)=\sum_{A\subseteq \{1,2,\ldots,n\}} g(A).\] Prove that there exists $m\in \mathbb N$ such that for each natural number $n>m$ we have $F(n)>G(n)$. (By $|A|$ we mean the number of elements of $A$, and if $|A|\le 1$, we define $f(A)$ to be zero). [i]Proposed by Javad Abedi[/i]

Given a triangle $ABC $, $A {{A} _ {1}} $, $B {{B} _ {1}} $, $C {{C} _ {1}}$ - its chevians intersecting at one point. ${{A} _ {0}}, {{C} _ {0}} $ - the midpoint of the sides $BC $ and $AB$ respectively. Lines ${{B} _ {1}} {{C} _ {1}} $, ${{B} _ {1}} {{A} _ {1}} $and ${ {B} _ {1}} B$ intersect the line ${{A} _ {0}} {{C} _ {0}} $ at points ${{C} _ {2}} $ , ${{A} _ {2}} $ and ${{B} _ {2}} $, respectively. Prove that the point ${{B} _ {2}} $ is the midpoint of the segment ${{A} _ {2}} {{C} _ {2}} $. (Eugene Bilokopitov)

A college math class has $N$ teaching assistants. It takes the teaching assistants $5$ hours to grade homework assignments. One day, another teaching assistant joins them in grading and all homework assignments take only $4$ hours to grade. Assuming everyone did the same amount of work, compute the number of hours it would take for $1$ teaching assistant to grade all the homework assignments.

In the diagram below $a, b, c, d, e, f, g, h, i, j$ are distinct positive integers and each (except $a, e, h$ and $j$) is the sum of the two numbers to the left and above. For example, $b = a + e, f = e + h, i = h + j$. What is the smallest possible value of $d$? j h i e f g a b c d