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]

Let $q$ be an odd positive integer, and let $N_q$ denote the number of integers $a$ such that $0<a<q/4$ and $\gcd(a,q)=1.$ Show that $N_q$ is odd if and only if $q$ is of the form $p^k$ with $k$ a positive integer and $p$ a prime congruent to $5$ or $7$ modulo $8.$

Is there a continuous function $f : \mathbb R \backslash \mathbb Q \to \mathbb R \backslash \mathbb Q$ for which the archetype of every irrational number has a positive Hausdorff dimension?

In two neigbouring cells(dimensions $1\times 1$) of square table $10\times 10$ there is hidden treasure. John needs to guess these cells. In one $\textit{move}$ he can choose some cell of the table and can get information whether there is treasure in it or not. Determine minimal number of $\textit{move}$'s, with properly strategy, that always allows John to find cells in which is treasure hidden.

Consider a $8\times 8$ chessboard where all $64$ unit squares are at the start white. Prove that, if any $12$ of the $64$ unit square get painted black, then we can find $4$ lines and $4$ rows that have all these $12$ unit squares.

If $z\in\mathbb{C},\arg{(z^2-4)}=\frac{5}{6}\pi,\arg{(z^2+4)}=\frac{\pi}{3}$, then the value of $z$ is________.

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 board used for playing a game consists of the left and right parts. In each part there are several fields and there’re several segments connecting two fields from different parts (all the fields are connected.) Initially, there is a violet counter on a field in the left part, and a purple counter on a field in the right part. Lyosha and Pasha alternatively play their turn, starting from Pasha, by moving their chip (Lyosha-violet, and Pasha-purple) over a segment to other field that has no chip. It’s prohibited to repeat a position twice, i.e. can’t move to position that already been occupied by some earlier turns in the game. A player losses if he can’t make a move. Is there a board and an initial positions of counters that Pasha has a winning strategy?

Let the vertices $A$ and $C$ of a right triangle $ABC$ be on the arc with center $B$ and radius $20$. A semicircle with diameter $[AB]$ is drawn to the inner region of the arc. The tangent from $C$ to the semicircle touches the semicircle at $D$ other than $B$. Let $CD$ intersect the arc at $F$. What is $|FD|$? $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ \frac 52 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 5 $

Let $\triangle ABC$ be a triangle and $\omega$ its circumcircle. The tangent to $\omega$ through $B$ cuts the parallel to $BC$ through $A$ at $P$. The line $CP$ cuts the circumcircle of $\triangle ABP$ again in $Q$ and line $AQ$ cuts $\omega$ at $R$. Prove that $BQCR$ is parallelogram if and only if $AC=BC$.

A positive integer \( n \) satisfies the following conditions: [list] [*] The number \( n \) has exactly \( 60 \) divisors: \( 1 = a_1 < a_2 < \cdots < a_{60} = n \); [*] The number \( n+1 \) also has exactly \( 60 \) divisors: \( 1 = b_1 < b_2 < \cdots < b_{60} = n+1 \). [/list] Let \( k \) be the number of indices \( i \) such that \( a_i < b_i \). Find all possible values of \( k \). [i]Note: Such numbers exist, for example, the numbers \( 4388175 \) and \( 4388176 \) both have \( 60 \) divisors.[/i] [i]Proposed by Anton Trygub[/i]

Let $PA_1A_2...A_{12} $ be the regular pyramid, $ A_1A_2...A_{12} $ is regular polygon, $S$ is area of the triangle $PA_1A_5$ and angle between of the planes $A_1A_2...A_{12} $ and $ PA_1A_5 $ is equal to $ \alpha $. Find the volume of the pyramid.

Calculate $\displaystyle{\sum_{n=1}^\infty\left(\lfloor\sqrt[n]{2010}\rfloor-1\right)}$ where $\lfloor x\rfloor$ is the largest integer less than or equal to $x$.

Let $a_1$, $a_2$, $ ...$ be a sequence of numbers, each either $1$ or $-1$. Show that if $$\frac{a_1}{3}+\frac{a_2}{3^2} + ... =\frac{p}{q}$$ for integers $p$ and $q$ such that $3$ does not divide $q$, then the sequence $a_1$, $a_2$, $ ...$ is periodic; that is, there is some positive integer $n$ such that $a_i = a_{n+i}$ for $i = 1$, $2$,$...$.