Let us consider mathematical crossword which we fill with numbers $0$, $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$ such that: 1) All digits occur exactly twice 2) $10$ horizontally divides $4$ vertically 3) $4 \cdot$ ($4$ horizontally - $4$ vertically +$5$) equals $1$ vertically 4) $36$ divides $1$ horizontally and $5$ vertically 5) $9$ vertically divides $5$ vertically In how many ways we can solve this mathematical crossword? [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvOC85LzgyNjUzYmNkNTVmNDE1YTg4OWVkNzAzYzE1M2JkZWE0MThiYWY1LnBuZw==&rn=Y3Jvc3N3b3JkLnBuZw==[/img]

Let $P(x)$ be a polynomial of degree $n \le 10$ with integral coefficients such that for every $k \in \{1, 2, \dots, 10\}$ there is an integer $m$ with $P(m) = k$. Furthermore, it is given that $|P(10) - P(0)| < 1000$. Prove that for every integer $k$ there is an integer $m$ such that $P(m) = k.$

Let $a, b$ and $c$ be pairwise different natural numbers. Prove $\frac{a^3 + b^3 + c^3}{3} \ge abc + a + b + c$. When does equality holds? (Karl Czakler)

In a video game, there is a board divided into squares, with $27$ rows and $27$ columns. The squares are painted alternately in black, gray and white as follows: $\bullet$ in the first row, the first square is black, the next is gray, the next is white, the next is black, and so on; $\bullet$ in the second row, the first is white, the next is black, the next is gray, the next is white, and so on; $\bullet$ in the third row, the order would be gray-white-black-gray and so on; $\bullet$ the fourth row is painted the same as the first, the fifth the same as the second, $\bullet$ the sixth the same as the third, and so on. In the box in row $i$ and column $j$, there are $ij$ coins. For example, in the box in row $15$ and column $20$ there are $(15) (20) = 300$ coins. Verify that in total there are, in the black squares, $9^2 (13^2 + 14^2 + 15^2)$ coins.

An elephant writes a sequence of numbers on a board starting with 1. Each minute, it doubles the sum of all the numbers on the board so far, and without erasing anything, writes the result on the board. It stops after writing a number greater than one billion. How many distinct prime factors does the largest number on the board have? [i]Ray Li.[/i]

Art and Kimberly build flagpoles on a level ground with respective heights $10$ m and $15$ m, separated by a distance of $5$ m. Kimberly wants to move her flagpole closer to Art’s, but she can only doing so in the following manner: 1. Run a straight wire from the top of her flagpole to the bottom of Art’s. 2. Run a straight wire from the top of Art’s flagpole to the bottom of hers. 3. Build the flagpole to the point where the wires meet. If Kimberly keeps moving her flagpole in this way, compute the number of flagpoles she will build whose heights are $1$ m or greater (not counting her original $15$ m flagpole).

Let $f: \Bbb{R} \rightarrow \Bbb{R}$ be a function such that (i) For all $x,y \in \Bbb{R}$, \[ f(x)+f(y)+1 \geq f(x+y) \geq f(x)+f(y) \] (ii) For all $x \in [0,1)$, $f(0) \geq f(x)$, (iii) $-f(-1) = f(1) = 1$. Find all such functions $f$.

Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define \[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \] Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$. [i]Proposed by Victor Wang[/i]

$\triangle{ABC}$ can cover a convex polygon $M$.Prove that there exsit a triangle which is congruent to $\triangle{ABC}$ such that it can also cover $M$ and has one side line paralel to or superpose one side line of $M$.

What is the sum of all numbers between $0$ and $511$ inclusive that have an even number of $1$s when written in binary?

Construct a triangle by its altitude , median and angle bisector originating from one vertex.

Point $O$ is selected in equilateral $\triangle ABC$ such that the sum of the distances from $O$ to each side of $ABC$ is $15$. Compute the area of $ABC$. [center][img]https://cdn.artofproblemsolving.com/attachments/4/0/dd573985a7c98f23fd05d11e95c4b908eaa895.png[/img][/center] $\textbf{(A) } 15\sqrt3\qquad\textbf{(B) } 30\sqrt3\qquad\textbf{(C) } 50\sqrt3\qquad\textbf{(D) } 75\sqrt3\qquad\textbf{(E) } 225\sqrt3$

Given a line $p$ and a triangle $\Delta$ in the plane, construct an equilateral triangle one of whose vertices lies on the line $p$, while the other two halve the perimeter of $\Delta.$

Consider a $3\times7$ grid of squares. Each square may be coloured green or white. [list] (a) Is it possible to find a colouring so that no subrectangle has all four corner squares of the same colour? (b) Is it possible for a $4\times 6$ grid? [/list] [i]Subrectangles must have their corners at grid-points of the original diagram. The corner squares of a subrectangle must be different. The original diagram is a subrectangle of itself.[/i]

I tried to search SRMC problems,but i didn't find them(I found only SRMC 2006).Maybe someone know where on this site i could find SRMC problems?I have all SRMC problems,if someone want i could post them, :wink: Here is one of them,this is one nice inequality from first SRMC: Let $ n$ be an integer with $ n>2$ and $ a_{1},a_{2},\dots,a_{n}\in R^{\plus{}}$.Given any positive integers $ t,k,p$ with $ 1<t<n$,set $ m\equal{}k\plus{}p$,prove the following inequalities: a) $ \frac{a_{1}^{p}}{a_{2}^{k}\plus{}a_{3}^{k}\plus{}\dots\plus{}a_{t}^{k}}\plus{}\frac{a_{2}^{p}}{a_{3}^{k}\plus{}a_{4}^{k}\plus{}\dots\plus{}a_{t\plus{}1}^{k}}\plus{}\dots\plus{}\frac{a_{n\minus{}1}^{p}}{a_{n}^{k}\plus{}a_{1}^{k}\plus{}\dots\plus{}a_{t\minus{}2}^{k}}\plus{}\frac{a_{n}^{p}}{a_{1}^{k}\plus{}a_{2}^{k}\plus{}\dots\plus{}a_{t\minus{}1}^{k}}\geq\frac{(a_{1}^{p}\plus{}a_{2}^{p}\dots\plus{}a_{n}^{p})^{2}}{(t\minus{}1) ( a_{1}^{m}\plus{}a_{2}^{m}\plus{}\dots\plus{}a_{n}^{m})}$ b)$ \frac{a_{2}^{k}\plus{}a_{3}^{k}\dots\plus{}a_{t}^{k}}{a_{1}^{p}}\plus{}\frac{a_{3}^{k}\plus{}a_{4}^{k}\dots\plus{}a_{t\plus{}1}^{k}}{a_{2}^{p}}\plus{}\dots\plus{}\frac{a_{1}^{k}\plus{}a_{2}^{k}\dots\plus{}a_{t\minus{}1}^{k}}{a_{n}^{p}}\geq\frac{(t\minus{}1)(a_{1}^{k}\plus{}a_{2}^{k}\dots\plus{}a_{n}^{k})^{2}}{( a_{1}^{m}\plus{}a_{2}^{m}\plus{}\dots\plus{}a_{n}^{m})}$ :wink:

Let $n$ be an integer greater than $1$ and let $X$ be an $n$-element set. A non-empty collection of subsets $A_1, ..., A_k$ of $X$ is tight if the union $A_1 \cup \cdots \cup A_k$ is a proper subset of $X$ and no element of $X$ lies in exactly one of the $A_i$s. Find the largest cardinality of a collection of proper non-empty subsets of $X$, no non-empty subcollection of which is tight. [i]Note[/i]. A subset $A$ of $X$ is proper if $A\neq X$. The sets in a collection are assumed to be distinct. The whole collection is assumed to be a subcollection.

Let be a continuous function $ f:[0,1]\longrightarrow\left( 0,\infty \right) $ having the property that, for any natural number $ n\ge 2, $ there exist $ n-1 $ real numbers $ 0<t_1<t_2<\cdots <t_{n-1}<1, $ such that $$ \int_0^{t_1} f(t)dt=\int_{t_1}^{t_2} f(t)dt=\int_{t_2}^{t_3} f(t)dt=\cdots =\int_{t_{n-2}}^{t_{n-1}} f(t)dt=\int_{t_{n-1}}^{1} f(t)dt. $$ Calculate $ \lim_{n\to\infty } \frac{n}{\frac{1}{f(0)} +\sum_{i=1}^{n-1} \frac{1}{f\left( t_i \right)} +\frac{1}{f(1)}} . $

Which one statisfies $n^{29} \equiv 7 \pmod {65}$? $ \textbf{(A)}\ 37 \qquad \textbf{(B)}\ 39 \qquad \textbf{(C)}\ 43 \qquad \textbf{(D)}\ 46 \qquad \textbf{(E)}\ 55$

For positive integers $a$ and $b$, an $(a,b)$-shuffle of a deck of $a+b$ cards is any shuffle that preserves the relative order of the top $a$ cards and the relative order of the bottom $b$ cards. Let $n$, $k$, $a_1$, $a_2$, $\dots$, $a_k$, $b_1$, $b_2$, $\dots$, $b_k$ be fixed positive integers such that $a_i+b_i=n$ for all $1\leq i\leq k$. Big Bird has a deck of $n$ cards and will perform an $(a_i,b_i)$-shuffle for each $1\leq i\leq k$, in ascending order of $i$. Suppose that Big Bird can reverse the order of the deck. Prove that Big Bird can also achieve any of the $n!$ permutations of the cards. [i]Linus Tang[/i]

Rachel writes down a simple inequality: one $2$-digit number is greater than another. Matt is sitting across from Rachel and peeking at her paper. If Matt, reading upside down, sees a valid inequality between two $2$-digit numbers, compute the number of different inequalities that Rachel could have written. Assume that each digit is either a $1, 6, 8$, or $9$.

If $ x \equal{} \sqrt {1 \plus{} \sqrt {1 \plus{} \sqrt {1 \plus{} \sqrt {1 \plus{} \cdots}}}}$, then: $ \textbf{(A)}\ x \equal{} 1 \qquad\textbf{(B)}\ 0 < x < 1 \qquad\textbf{(C)}\ 1 < x < 2 \qquad\textbf{(D)}\ x\text{ is infinite}$ $ \textbf{(E)}\ x > 2 \text{ but finite}$

Consider the square grid with $A=(0,0)$ and $C=(n,n)$ at its diagonal ends. Paths from $A$ to $C$ are composed of moves one unit to the right or one unit up. Let $C_n$ (n-th catalan number) be the number of paths from $A$ to $C$ which stay on or below the diagonal $AC$. Show that the number of paths from $A$ to $C$ which cross $AC$ from below at most twice is equal to $C_{n+2}-2C_{n+1}+C_n$

Let $$C=\{1,22,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20\}$$ and let $$S=\{4,5,9,14,23,37\}$$ Find two sets $A$ and $B$ with the properties (a) $A\cap B=\emptyset$. (b) $A\cup B=C$. (c) The sum of two distinct elements of $A$ is not in $S$. (d) The sum of two distinct elements of $B$ is not in $S$.

In $2005$ Tycoon Tammy invested $\$100$ for two years. During the the first year her investment suffered a $15\%$ loss, but during the second year the remaining investment showed a $20\%$ gain. Over the two-year period, what was the change in Tammy's investment? $\textbf{(A)}\ 5\%\text{ loss}\qquad \textbf{(B)}\ 2\%\text{ loss}\qquad \textbf{(C)}\ 1\%\text{ gain}\qquad \textbf{(D)}\ 2\% \text{ gain} \qquad \textbf{(E)}\ 5\%\text{ gain}$

Let $n \ge 5$ be an integer. Prove that $n$ is prime if and only if for any representation of $n$ as a sum of four positive integers $n = a + b + c + d$, it is true that $ab \ne cd$.