The $ 5\times 5$ grid shown contains a collection of squares with sizes from $ 1\times 1$ to $ 5\times 5$. How many of these squares contain the black center square? [asy]unitsize(6mm); defaultpen(linewidth(.8pt)); for(int i=0; i<=5; ++i) { draw((0,i)--(5,i)); draw((i,0)--(i,5)); } fill((2,2)--(2,3)--(3,3)--(3,2)--cycle);[/asy]$ \textbf{(A)}\ 12\qquad \textbf{(B)}\ 15\qquad \textbf{(C)}\ 17\qquad \textbf{(D)}\ 19\qquad \textbf{(E)}\ 20$

Let $M,N,P$ be points in the sides $BC,AC,AB$ of $\triangle ABC$ respectively. The quadrilateral $MCNP$ has an incircle of radius $r$, if the incircles of $\triangle BPM$ and $\triangle ANP$ also have the radius $r$. Prove that $$AP\cdot MP=BP\cdot NP$$

Show that, for any integer $n$, the number $n^3 - 9n + 27$ is not divisible by $81$.

We are given a semicircle $k$ with center $O$ and diameter $AB$. Let $C$ be a point on $k$ such that $CO \bot AB$. The bisector of $\angle ABC$ intersects $k$ at point $D$. Let $E$ be a point on $AB$ such that $DE \bot AB$ and let $F$ be the midpoint of $CB$. Prove that the quadrilateral $EFCD$ is cyclic.

Each vertex of a cube is assigned $1$ or $-1$. Each face is assigned the product of the four numbers at its vertices. Determine all possible values that can be obtained as the sum of all the $14$ assigned numbers.

Let $ f:\mathbb{R}\longrightarrow\mathbb{R} $ be a countinuous and periodic function, of period $ T. $ If $ F $ is a primitive of $ f, $ show that: [b]a)[/b] the function $ G:\mathbb{R}\longrightarrow\mathbb{R}, G(x)=F(x)-\frac{x}{T}\int_0^T f(t)dt $ is periodic. [b]b)[/b] $ \lim_{n\to\infty}\sum_{i=1}^n\frac{F(i)}{n^2+i^2} =\frac{\ln 2}{2T}\int_0^T f(x)dx. $

in a convex quadrilateral $ABCD$ , $M,N$ are midpoints of $BC,AD$ respectively. If $AM=BN$ and $DM=CN$ then prove that $AC=BD$. S. Berlov

Does there exist positive integers $a_{1}<a_{2}<\cdots<a_{100}$ such that for $2 \le k \le 100$, the greatest common divisor of $a_{k-1}$ and $a_{k}$ is greater than the greatest common divisor of $a_{k}$ and $a_{k+1}$?

A division of a group of people into various groups is called $k$-regular if the number of groups is less or equal to $k$ and two people that know each other are in different groups. Let $A$, $B$, and $C$ groups of people such that there are is no person in $A$ and no person in $B$ that know each other. Suppose that the group $A \cup C$ has an $a$-regular division and the group $B \cup C$ has a $b$-regular division. For each $a$ and $b$, determine the least possible value of $k$ for which it is guaranteed that the group $A \cup B \cup C$ has a $k$-regular division.

Find all positive integers $n$ such that $n$ is equal to $100$ times the number of positive divisors of $n$.

The Fox and Pinocchio have grown a tree on the Field of Miracles with 11 golden coins. It is known that exactly 4 of them are counterfeit. All the real coins weigh the same, the counterfeit coins also weigh the same but are lighter. The Fox and Pinocchio have collected the coins and wish to divide them. The Fox is going to give 4 coins to Pinocchio, but Pinocchio wants to check whether they all are real. Can he check this using two weighings on a balance scale with no weights?

In $\triangle ABC$ let $D$ and $E$ be points on $AB$ and $AC$ respectively. The circumcircle of $\triangle CDE$ meets $AB$ again at $F$, and the circumcircle of $\triangle ACD$ meets $BC$ again at $G$. Show that if the circumcircles of $DFG$ and $ADE$ meet at $H$, then the three lines $AG$, $BE$, and $DH$ concur. Proposed by [i]Oron Wang[/i] inspired by [i]Tiger Zhang[/i]

On a circle there are $99$ natural numbers. If $a,b$ are any two neighbouring numbers on the circle, then $a-b$ is equal to $1$ or $2$ or $ \frac{a}{b}=2 $. Prove that there exists a natural number on the circle that is divisible by $3$. [i]S. Berlov[/i]

For positive integers $a,b,c$ let $ \alpha, \beta, \gamma$ be pairwise distinct positive integers such that \[ \begin{cases}{c} \displaystyle a &= \alpha + \beta + \gamma, \\ b &= \alpha \cdot \beta + \beta \cdot \gamma + \gamma \cdot \alpha, \\ c^2 &= \alpha\beta\gamma. \end{cases} \] Also, let $ \lambda$ be a real number that satisfies the condition \[\lambda^4 -2a\lambda^2 + 8c\lambda + a^2 - 4b = 0.\] Prove that $\lambda$ is an integer if and only if $\alpha, \beta, \gamma$ are all perfect squares.

Prove that among any $16$ perfect cubes we can always find two cubes whose difference is divisible by $91$.

Let $n$ and $c$ be coprime positive integers. For any integer $i$, denote by $i' $ the remainder of division of product $ci$ by $n$. Let $A_o.A_1,A_2,...,A_{n-1}$ be a regular $n$-gon. Prove that a) if $A_iA_j \parallel A_kA_i$ then $A_{i'}A_{j'} \parallel A_{k'}A_{i'}$ b) if $A_iA_j \perp A_kA_l$ then $A_{i'}A_{j'} \perp A_{k'}A_{l'}$

Let $\{x_i\}, 1\le i\le 6$ be a given set of six integers, none of which are divisible by $7$. $(a)$ Prove that at least one of the expressions of the form $x_1\pm x_2\pm x_3\pm x_4\pm x_5\pm x_6$ is divisible by $7$, where the $\pm$ signs are independent of each other. $(b)$ Generalize the result to every prime number.

Let $x,y,z$ be positive real numbers satisfying $4x^2 - 2xy + y^2 = 64, y^2 - 3yz +3z^2 = 36,$ and $4x^2 +3z^2 = 49.$ If the maximum possible value of $2xy +yz -4zx$ can be expressed as $\sqrt{n}$ for some positive integer $n,$ find $n.$

On a table there are $2013$ cards that have written, each one, a different integer number, from $1$ to $2013$; all the cards face down (you can't see what number they are). It is allowed to select any set of cards and ask if the average of the numbers written on those cards is integer. The answer will be true. a) Find all the numbers that can be determined with certainty by several of these questions. b) We want to divide the cards into groups such that the content of each group is known even though the individual value of each card in the group is not known. (For example, finding a group of $3$ cards that contains $1, 2$, and $3$, without knowing what number each card has.) What is the maximum number of groups that can be obtained?

There are $26$ students in the class. They agreed that each of them would either be a liar (liars always lie) or a knight (knights always tell the truth). When they came to the class and sat down for desks, each of them said: “I am sitting next to a liar.” Then some students moved for other desks. After that, everyone says: “ I am sitting next to a knight .” Is this possible? Every time exactly two students sat at any desk.

A real number is called [i]triplex[/i] if it has a decimal representation in which none of $0$ and $3$ different digit occurs. Prove that every positive real number is the sum of nine triplex numbers.

Let $s(m)$ denote the sum of the digits of the positive integer $m$. Find the largest positive integer that has no digits equal to zero and satisfies the equation \[2^{s(n)} = s(n^2).\]

Let $AD$ be the perpendicular to the hypotenuse $BC$ of the right triangle $ABC$. Let $DE$ be the height of the triangle $ADB$ and $DZ$ be the height of the triangle $ADC$. On the line $AB$ is chosen the point $N$ so that $CN$ is parallel to $EZ$. Let $A'$ be symmetrical of $A$ to $EZ$ and $I, K$ projections of $A'$ on $AB$, respectively, on $AC$. Prove that $<$ $NA'T$ $=$ $<$ $ADT$, where $T$ is the point of intersection of $IK$ and $DE$.

[b]p1.[/b] Elsie M. is fixing a watch with three gears. Gear $A$ makes a full rotation every $5$ minutes, gear $B$ makes a full rotation every $8$ minutes, and gear $C$ makes a full rotation every $12$ minutes. The gears continue spinning until all three gears are in their original positions at the same time. How many minutes will it take for the gears to stop spinning? [b]p2.[/b] Optimus has to pick $10$ distinct numbers from the set of positive integers $\{2, 3, 4,..., 29, 30\}$. Denote the numbers he picks by $\{a_1, a_2, ...,a_{10}\}$. What is the least possible value of $$d(a_1 ) + d(a_2) + ... + d(a_{10}),$$ where $d(n)$ denotes the number of positive integer divisors of $n$? For example, $d(33) = 4$ since $1$, $3$, $11$, and $33$ divide $33$. [b]p3.[/b] Michael is given a large supply of both $1\times 3$ and $1\times 5$ dominoes and is asked to arrange some of them to form a $6\times 13$ rectangle with one corner square removed. What is the minimum number of $1\times 3$ dominoes that Michael can use? [img]https://cdn.artofproblemsolving.com/attachments/6/6/c6a3ef7325ecee417e37ec9edb5374aceab9fd.png[/img] [b]p4.[/b] Andy, Ben, and Chime are playing a game. The probabilities that each player wins the game are, respectively, the roots $a$, $b$, and $c$ of the polynomial $x^3 - x^2 + \frac{111}{400}x - \frac{9}{400} = 0$ with $a \le b \le c$. If they play the game twice, what is the probability of the same player winning twice? [b]p5.[/b] TongTong is doodling in class and draws a $3 \times 3$ grid. She then decides to color some (that is, at least one) of the squares blue, such that no two $1 \times 1$ squares that share an edge or a corner are both colored blue. In how many ways may TongTong color some of the squares blue? TongTong cannot rotate or reflect the board. [img]https://cdn.artofproblemsolving.com/attachments/6/0/4b4b95a67d51fda0f155657d8295b0791b3034.png[/img] [b]p6.[/b] Given a positive integer $n$, we define $f(n)$ to be the smallest possible value of the expression $$| \square 1 \square 2 ... \square n|,$$ where we may place a $+$ or a $-$ sign in each box. So, for example, $f(3) = 0$, since $| + 1 + 2 - 3| = 0$. What is $f(1) + f(2) + ... + f(2011)$? [b]p7.[/b] The Duke Men's Basketball team plays $11$ home games this season. For each game, the team has a $\frac34$ probability of winning, except for the UNC game, which Duke has a $\frac{9}{10}$ probability of winning. What is the probability that Duke wins an odd number of home games this season? [b]p8.[/b] What is the sum of all integers $n$ such that $n^2 + 2n + 2$ divides $n^3 + 4n^2 + 4n - 14$? [b]p9.[/b] Let $\{a_n\}^N_{n=1}$ be a finite sequence of increasing positive real numbers with $a_1 < 1$ such that $$a_{n+1} = a_n \sqrt{1 - a^2_1}+ a_1\sqrt{1 - a^2_n}$$ and $a_{10} = 1/2$. What is $a_{20}$? [b]p10.[/b] Three congruent circles are placed inside a unit square such that they do not overlap. What is the largest possible radius of one of these circles? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Alice has $100$ balls and $10$ buckets. She takes each ball and puts it in a bucket that she chooses at random. After she is done, let $b_i$ be the number of balls in the $i$th bucket, for $1\le i \le 10$. Compute the expected value of $\Sigma_{i=1}^{10}b_i^2$