$(BUL 1)$ Prove that the equation $\sqrt{x^3 + y^3 + z^3}=1969$ has no integral solutions.

Juan writes the list of pairs $(n, 3^n)$, with $n=1, 2, 3,...$ on a chalkboard. As he writes the list, he underlines the pairs $(n, 3^n)$ when $n$ and $3^n$ have the same units digit. What is the $2013^{th}$ underlined pair?

Show that for any natural number n, n^3 + (n + 1)^3 + (n + 2)^3 is divisible by 9.

Let $n$ be a natural number, for which we define $S(n)=\{1+g+g^2+...+g^{n-1}|g\in{\mathbb{N}},g\geq2\}$ $a)$ Prove that: $S(3)\cap S(4)=\varnothing$ $b)$ Determine: $S(3)\cap S(5)$

Let $S$ be the set of integers between $1$ and $2^{40}$ whose binary expansions have exactly two $1$'s. If a number is chosen at random from $S$, the probability that it is divisible by $9$ is $p/q$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Prove that $\frac{1}{25} \sum_{k=0}^{2001} \left[ \frac{2^k}{25}\right]$ is a positive integer.

For even positive integer $n$ we put all numbers $1,2,...,n^2$ into the squares of an $n\times n$ chessboard (each number appears once and only once). Let $S_1$ be the sum of the numbers put in the black squares and $S_2$ be the sum of the numbers put in the white squares. Find all $n$ such that we can achieve $\frac{S_1}{S_2}=\frac{39}{64}.$

Find the rightmost nonzero digit of $ \frac{100!}{5^{20}}$ (here $ n!\equal{}1\cdot2\cdot3\cdot\ldots\cdot n$).

We say that the set of step lengths $D\subset \mathbb{Z}_+=\{1,2,\ldots\}$ is [i]excellent[/i] if it has the following property: If we split the set of integers into two subsets $A$ and $\mathbb{Z}\setminus{A}$, at least other set contains element $a-d,a,a+d$ (i.e. $\{a-d,a,a+d\} \subset A$ or $\{a-d,a,a+d\}\in \mathbb{Z}\setminus A$ from some integer $a\in \mathbb{Z},d\in D$.) For example the set of one element $\{1\}$ is not excellent as the set of integer can be split into even and odd numbers, and neither of these contains three consecutive integer. Show that the set $\{1,2,3,4\}$ is excellent but it has no proper subset which is excellent.

The number $2017$ is prime. Let $S=\sum_{k=0}^{62}\binom{2014}{k}$. What is the remainder when $S$ is divided by $2017$? $\textbf{(A) }32\qquad \textbf{(B) }684\qquad \textbf{(C) }1024\qquad \textbf{(D) }1576\qquad \textbf{(E) }2016\qquad$

Let $r_2, r_3,\ldots, r_{1000}$ denote the remainders when a positive odd integer is divided by $2,3,\ldots,1000$, respectively. It is known that the remainders are pairwise distinct and one of them is $0$. Find all values of $k$ for which it is possible that $r_k = 0$.

Geodude wants to assign one of the integers $1,2,3,\ldots,11$ to each lattice point $(x,y,z)$ in a 3D Cartesian coordinate system. In how many ways can Geodude do this if for every lattice parallelogram $ABCD$, the positive difference between the sum of the numbers assigned to $A$ and $C$ and the sum of the numbers assigned to $B$ and $D$ must be a multiple of $11$? (A [i]lattice point[/i] is a point with all integer coordinates. A [i]lattice parallelogram[/i] is a parallelogram with all four vertices lying on lattice points. Here, we say four not necessarily distinct points $A,B,C,D$ form a [i]parallelogram[/i] $ABCD$ if and only if the midpoint of segment $AC$ coincides with the midpoint of segment $BD$.) [hide="Clarifications"] [list] [*] The ``positive difference'' between two real numbers $x$ and $y$ is the quantity $|x-y|$. Note that this may be zero. [*] The last sentence was added to remove confusion about ``degenerate parallelograms.''[/list][/hide] [i]Victor Wang[/i]

Find the number of integers $ c$ such that $ \minus{}2007 \leq c \leq 2007$ and there exists an integer $ x$ such that $ x^2 \plus{} c$ is a multiple of $ 2^{2007}$.

Does there exist a strictly increasing infinite sequence of perfect squares $a_1, a_2, a_3, ...$ such that for all $k\in \mathbb{Z}^+$ we have that $13^k | a_k+1$? [i]Proposed by Jesse Zhang[/i]

How many primes $p$ are there such that $5p(2^{p+1}-1)$ is a perfect square? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ \text{None of the preceding} $

assume that ABC is acute traingle and AA' is median we extend it until it meets circumcircle at A". let $AP_a$ be a diameter of the circumcircle. the pependicular from A' to $AP_a$ meets the tangent to circumcircle at A" in the point $X_a$; we define $X_b,X_c$ similary . prove that $X_a,X_b,X_c$ are one a line.

A game is played by $n$ girls ($n \geq 2$), everybody having a ball. Each of the $\binom{n}{2}$ pairs of players, is an arbitrary order, exchange the balls they have at the moment. The game is called nice [b]nice[/b] if at the end nobody has her own ball and it is called [b]tiresome[/b] if at the end everybody has her initial ball. Determine the values of $n$ for which there exists a nice game and those for which there exists a tiresome game.

Prove that for all $ n\geq 2,$ there exists $ n$-degree polynomial $ f(x) \equal{} x^n \plus{} a_{1}x^{n \minus{} 1} \plus{} \cdots \plus{} a_{n}$ such that (1) $ a_{1},a_{2},\cdots, a_{n}$ all are unequal to $ 0$; (2) $ f(x)$ can't be factorized into the product of two polynomials having integer coefficients and positive degrees; (3) for any integers $ x, |f(x)|$ isn't prime numbers.

Prove that among any $18$ consecutive three digit numbers there is at least one number which is divisible by the sum of its digits.

Show that if for non-negative integers $m$, $n$, $N$, $k$ the equation \[(n^2+1)^{2^k}\cdot(44n^3+11n^2+10n+2)=N^m\] holds, then $m = 1$.

Determine all pairs $(p, q)$ of primes for which $p^{q+1}+q^{p+1}$ is a perfect square.

The first term of a sequence is 2005. Each succeeding term is the sum of the cubes of the digits of the previous terms. What is the 2005th term of the sequence? $ \textbf{(A)}\ 29\qquad \textbf{(B)}\ 55\qquad \textbf{(C)}\ 85\qquad \textbf{(D)}\ 133\qquad \textbf{(E)}\ 250$

Let $ p$ be an odd prime number. How many $ p$-element subsets $ A$ of $ \{1,2,\dots,2p\}$ are there, the sum of whose elements is divisible by $ p$?

Let $ p$ and $ q$ be relatively prime positive integers. A subset $ S$ of $ \{0, 1, 2, \ldots \}$ is called [b]ideal[/b] if $ 0 \in S$ and for each element $ n \in S,$ the integers $ n \plus{} p$ and $ n \plus{} q$ belong to $ S.$ Determine the number of ideal subsets of $ \{0, 1, 2, \ldots \}.$

A pair of integers $ (m,n)$ is called [i]good[/i] if \[ m\mid n^2 \plus{} n \ \text{and} \ n\mid m^2 \plus{} m\] Given 2 positive integers $ a,b > 1$ which are relatively prime, prove that there exists a [i]good[/i] pair $ (m,n)$ with $ a\mid m$ and $ b\mid n$, but $ a\nmid n$ and $ b\nmid m$.