Let $X$ be a non empty subset of $\mathbb{N} = \{1,2,\ldots \}$. Suppose that for all $x \in X$, $4x \in X$ and $\lfloor \sqrt{x} \rfloor \in X$. Prove that $X=\mathbb{N}$.

(a) Given a positive integer $k$, prove that there do not exist two distinct integers in the open interval $(k^2, (k + 1)^2)$ whose product is a perfect square. (b) Given an integer $n > 2$, prove that there exist $n$ distinct integers in the open interval $(k^n, (k + 1)^n)$ whose product is the $n$-th power of an integer, for all but a finite number of positive integers $k$. [i]AMM Magazine[/i]

Let $I$ be an open interval of length $\frac{1}{n}$, where $n$ is a positive integer. Find the maximum possible number of rational numbers of the form $\frac{a}{b}$ where $1 \le b \le n$ that lie in $I$.

Given a positive integer $k$, find the least integer $n_k$ for which there exist five sets $S_1, S_2, S_3, S_4, S_5$ with the following properties: \[|S_j|=k \text{ for } j=1, \cdots , 5 , \quad |\bigcup_{j=1}^{5} S_j | = n_k ;\] \[|S_i \cap S_{i+1}| = 0 = |S_5 \cap S_1|, \quad \text{for } i=1,\cdots ,4 \]

The equation $x^3-3x^2+1=0$ has three real solutions $x_1<x_2<x_3$. Show that for any positive integer $n$, the number $\left\lceil x_3^n\right\rceil$ is a multiple of $3$.

$3m$ balls numbered $1, 1, 1, 2, 2, 2, 3, 3, 3, \ldots, m, m, m$ are distributed into $8$ boxes so that any two boxes contain identical balls. Find the minimal possible value of $m$.

Cozy the Cat and Dash the Dog are going up a staircase with a certain number of steps. However, instead of walking up the steps one at a time, both Cozy and Dash jump. Cozy goes two steps up with each jump (though if necessary, he will just jump the last step). Dash goes five steps up with each jump (though if necessary, he will just jump the last steps if there are fewer than 5 steps left). Suppose the Dash takes 19 fewer jumps than Cozy to reach the top of the staircase. Let $s$ denote the sum of all possible numbers of steps this staircase can have. What is the sum of the digits of $s$? $\textbf{(A) } 9 \qquad\textbf{(B) } 11 \qquad\textbf{(C) } 12 \qquad\textbf{(D) } 13 \qquad\textbf{(E) } 15 $

suppose that $\mathcal F\subseteq X^{(K)}$ and $|X|=n$. we know that for every three distinct elements of $\mathcal F$ like $A,B$ and $C$ we have $A\cap B \not\subset C$. a)(10 points) Prove that : \[|\mathcal F|\le \dbinom{k}{\lfloor\frac{k}{2}\rfloor}+1\] b)(15 points) if elements of $\mathcal F$ do not necessarily have $k$ elements, with the above conditions show that: \[|\mathcal F|\le \dbinom{n}{\lceil\frac{n-2}{3}\rceil}+2\]

Let $p > 3$ be a prime number, and let $F_p$ denote the (finite) set of residue classes modulo $p$. Let $S_d$ denote the set of $2$-variable polynomials $P(x, y)$ with coefficients in $F_p$, total degree $\le d$, and satisfying $P(x, y) = P(y,- x -y)$. Show that $$|S_d| = p^{\lceil (d+1)(d+2)/6 \rceil}$$. [i]The total degree of a $2$-variable polynomial $P(x, y)$ is the largest value of $i + j$ among monomials $x^iy^j$ [/i] appearing in $P$.

Prove for any $M>2$, there exists an increasing sequence of positive integers $a_1<a_2<\ldots $ satisfying: 1) $a_i>M^i$ for any $i$; 2) There exists a positive integer $m$ and $b_1,b_2,\ldots ,b_m\in\left\{ -1,1\right\}$, satisfying $n=a_1b_1+a_2b_2+\ldots +a_mb_m$ if and only if $n\in\mathbb{Z}/ \{0\}$.

Graphistan has $2011$ cities and Graph Air (GA) is running one-way flights between all pairs of these cities. Determine the maximum possible value of the integer $k$ such that no matter how these flights are arranged it is possible to travel between any two cities in Graphistan riding only GA flights as long as the absolute values of the difference between the number of flights originating and terminating at any city is not more than $k.$

Tanya chose a natural number $X\le100$, and Sasha is trying to guess this number. He can select two natural numbers $M$ and $N$ less than $100$ and ask about $\gcd(X+M,N)$. Show that Sasha can determine Tanya's number with at most seven questions.

Consider a board on $2013 \times 2013$ squares, what is the maximum number of chess knights that can be placed so that no $2$ attack each other?

Ten women sit in $ 10$ seats in a line. All of the $ 10$ get up and then reseat themselves using all $ 10$ seats, each sitting in the seat she was in before or a seat next to the one she occupied before. In how many ways can the women be reseated? $ \textbf{(A)}\ 89\qquad \textbf{(B)}\ 90\qquad \textbf{(C)}\ 120\qquad \textbf{(D)}\ 2^{10}\qquad \textbf{(E)}\ 2^2 3^8$

Cozy the Cat and Dash the Dog are going up a staircase with a certain number of steps. However, instead of walking up the steps one at a time, both Cozy and Dash jump. Cozy goes two steps up with each jump (though if necessary, he will just jump the last step). Dash goes five steps up with each jump (though if necessary, he will just jump the last steps if there are fewer than 5 steps left). Suppose the Dash takes 19 fewer jumps than Cozy to reach the top of the staircase. Let $s$ denote the sum of all possible numbers of steps this staircase can have. What is the sum of the digits of $s$? $\textbf{(A) } 9 \qquad\textbf{(B) } 11 \qquad\textbf{(C) } 12 \qquad\textbf{(D) } 13 \qquad\textbf{(E) } 15 $