An ordered pair $(m,n)$ of non-negative integers is called "simple" if the addition $m+n$ in base $10$ requires no carrying. Find the number of simple ordered pairs of non-negative integers that sum to $1492$.

Sam writes three $3$-digit positive integers (that don't end in $0$) on the board and adds them together. Jessica reverses each of the integers, and adds the reversals together. (For example, $\overline{XYZ}$ becomes $\overline{ZYX}$.) What is the smallest possible positive three-digit difference between Sam's sum and Jessica's sum?

Point $S$ is the midpoint of arc $ACB$ of the circumscribed circle $k$ around triangle $ABC$ with $AC>BC$. Let $I$ be the incenter of triangle $ABC$. Line $SI$ intersects $k$ again at point $T$. Let $D$ be the reflection of $I$ across $T$ and $M$ be the midpoint of side $AB$. Line $IM$ intersects the line through $D$, parallel to $AB$, at point $E$. Prove that $AE=BD$.

In a quadrilateral $ABCD$ of area $1$, the parallel sides $BC$ and $AD$ are in the ratio $1 :2$ . $K$ is the midpoint of the diagonal $AC$ and $L$ is the point of intersection of the line $DK$ and the side $AB$. Determine the area of the quadrilateral $BCKL$ . (M G Sonkin)

Let $K $ be a convex set in the $xy$-plane, symmetric with respect to the origin and having area greater than $4 $. Prove that there exists a point $(m, n) \neq (0, 0)$ in $K$ such that $m$ and $n$ are integers.

The material of new ball corset of the princess is quadrilateral . The tailor must sew four decorative strips on it. Two of gold, two of silver. Two of the same color on two opposite sides and the other two on it to a midline not intersecting them. The tailor is not yet familiar with the dress final shape. However, you will definitely sew the dress to be the cheapest (i.e., the gold stripe should be shorter than the silver). For design, it would be important to know what color stripe is centered. Can you decide this without knowing the the exact shape of the dress? [img]https://cdn.artofproblemsolving.com/attachments/8/1/85d40e7a352e468d0c9da7530c6a0378575de0.png[/img]

Compute the number of nonempty subsets $S$ of $\{ 1,2,3,4,5,6,7,8,9,10 \}$ such that the median of $S$ is an element of $S$.

We place the numbers from $1$ to $81$ in a $9\times $ board. Prove that exist $k \in \{1,2,...,9\}$ so that the product of the numbers in the $k$-th column is diferent to the product of the numbers in the $k$-th row.

Arranged in a circle are $2010$ digits, each of them equal to $1$, $2$, or $3$. For each positive integer $k$, it's known that in any block of $3k$ consecutive digits, each of the digits appears at most $k+10$ times. Prove that there is a block of several consecutive digits with the same number of $1$s, $2$s, and $3$s.

Let $n$ be a positive integer. Humanity will begin to colonize Mars. The SpaceY and SpaceZ agencies will be responsible for traveling between the planets. To prevent the rockets from colliding, they will travel alternately, with SpaceY making the first trip. On each trip, the responsible agency will do one of two types of mission: (i) choose a positive integer $k$ and take $k$ people to Mars, creating a new colony on the planet and settling them in that colony; (ii) choose some existing colony on Mars and a positive integer $k$ strictly smaller than the population of that colony, and bring $k$ people from that colony back to Earth. To maintain the organization on Mars, a mission cannot result in two colonies with the same population and the number of colonies must be at most $n$. The first agency that cannot carry out a mission will go bankrupt. Determine, in terms of $n$, which agency can guarantee that it will not go bankrupt first.

Prove that the positive integers $n$ that cannot be written as a sum of $r$ consecutive positive integers, with $r>1$, are of the form $n=2^l~$ for some $l\geqslant 0$.

In the film there is $n$ roles. For each $i$ ($1 \le i \le n$), the role of number $i$ can play $a_i$ a person, and one person can play only one role. Every day a casting is held, in which participate people for $n$ roles, and from each role only one person. Let $p$ be a prime number such that $p \ge a_1, \ldots, a_n, n$. Prove that you can have $p^k$ castings such that if we take any $k$ people who are tried in different roles, they together participated in some casting ($k$ is a natural number not exceeding $n$ ).

Color every vertex of $2008$-gon with two colors, such that adjacent vertices have different color. If sum of angles of vertices of first color is same as sum of angles of vertices of second color, than we call $2008$-gon as interesting. Convex $2009$-gon one vertex is marked. It is known, that if remove any unmarked vertex, then we get interesting $2008$-gon. Prove, that if we remove marked vertex, then we get interesting $2008$-gon too.

Evaluate $ \int_{\frac{\pi}{8}}^{\frac{3}{8}\pi} \frac{11\plus{}4\cos 2x \plus{}\cos 4x}{1\minus{}\cos 4x}\ dx.$

Prove the inequality \[\sum_{i<j} \frac{a_ia_j}{a_i \plus{} a_j} \le \frac{n}{2(a_1 \plus{} a_2 \plus{}\cdots \plus{} a_n)}\sum_{i<j} a_ia_j\] for all positive real numbers $ a_1, a_2,\ldots , a_n$.

A loader has two carts. One of them can carry up to 8 kg, and another can carry up to 9 kg. A finite number of sacks with sand lie in a storehouse. It is known that their total weight is more than 17 kg, while each sack weighs not more than 1 kg. What maximum weight of sand can the loader carry on his two carts, regardless of particular weights of sacks? [i]Author: M.Ivanov, D.Rostovsky, V.Frank[/i]

A cube consisting of $(2N)^3$ unit cubes is pierced by several needles parallel to the edges of the cube (each needle pierces exactly $2N$ unit cubes). Each unit cube is pierced by at least one needle. Let us call any subset of these needles “regular” if there are no two needles in this subset that pierce the same unit cube. a) Prove that there exists a regular subset consisting of $2N^2$ needles such that all of them have either the same direction or two different directions. b) What is the maximum size of a regular subset that does exist for sure? (Nikita Gladkov, Alexandr Zimin)

Let $d(n)$ be the number of positive integers that divide the integer $n$. For all positive integral divisors $k$ of $64800$, what is the sum of numbers $d(k)$? $ \textbf{(A)}\ 1440 \qquad\textbf{(B)}\ 1650 \qquad\textbf{(C)}\ 1890 \qquad\textbf{(D)}\ 2010 \qquad\textbf{(E)}\ \text{None of above} $

Let $\mathbb{N}$ denote the set of natural numbers. Define a function $T:\mathbb{N}\rightarrow\mathbb{N}$ by $T(2k)=k$ and $T(2k+1)=2k+2$. We write $T^2(n)=T(T(n))$ and in general $T^k(n)=T^{k-1}(T(n))$ for any $k>1$. (i) Show that for each $n\in\mathbb{N}$, there exists $k$ such that $T^k(n)=1$. (ii) For $k\in\mathbb{N}$, let $c_k$ denote the number of elements in the set $\{n: T^k(n)=1\}$. Prove that $c_{k+2}=c_{k+1}+c_k$, for $k\ge 1$.

Consider the statements: $ \textbf{(1)}\ \text{p and q are both true} \qquad \textbf{(2)}\ \text{p is true and q is false} \qquad \textbf{(3)}\ \text{p is false and q is true} \qquad \textbf{(4)}\ \text{p is false and q is false.}$ How many of these imply the negative of the statement "p and q are both true?" $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$

Triangle $A_1B_1C_1$ is an equilateral triangle with sidelength $1$. For each $n>1$, we construct triangle $A_nB_nC_n$ from $A_{n-1}B_{n-1}C_{n-1}$ according to the following rule: $A_n,B_n,C_n$ are points on segments $A_{n-1}B_{n-1},B_{n-1}C_{n-1},C_{n-1}A_{n-1}$ respectively, and satisfy the following: \[\dfrac{A_{n-1}A_n}{A_nB_{n-1}}=\dfrac{B_{n-1}B_n}{B_nC_{n-1}}=\dfrac{C_{n-1}C_n}{C_nA_{n-1}}=\dfrac1{n-1}\] So for example, $A_2B_2C_2$ is formed by taking the midpoints of the sides of $A_1B_1C_1$. Now, we can write $\tfrac{|A_5B_5C_5|}{|A_1B_1C_1|}=\tfrac mn$ where $m$ and $n$ are relatively prime integers. Find $m+n$. (For a triangle $\triangle ABC$, $|ABC|$ denotes its area.)

Prove that for coprime each positive integers $a, c$ there is a positive integer $b$ such that $c$ divides $\underbrace{b^{b^{b^{\ldots^b}}}}_\text{b times}-a$

Let $S$ be the set of points $A$ in the Cartesian plane such that the four points $A$, $(2, 3)$, $(-1, 0)$, and $(0, 6)$ form the vertices of a parallelogram. Let $P$ be the convex polygon whose vertices are the points in $S$. What is the area of $P$?

Denote by $[n]!$ the product $ 1 \cdot 11 \cdot 111\cdot ... \cdot \underbrace{111...1}_{\text{n ones}}$.($n$ factors in total). Prove that $[n + m]!$ is divisible by $ [n]! \times [m]!$ [i](8 points)[/i]

The intersection point $I$ of the angles bisectors of the triangle $ABC$ has reflections the points $P,Q,T$ wrt the triangle's sides . It turned out that the circle $s$ circumscribed around of the triangle $PQT$ , passes through the vertex $A$. Find the radius of the circumscribed circle of triangle $ABC$ if $BC = a$. (Gryhoriy Filippovskyi)