Let $M$ be the least common multiple of all the integers $10$ through $30,$ inclusive. Let $N$ be the least common multiple of $M,$ $32,$ $33,$ $34,$ $35,$ $36,$ $37,$ $38,$ $39,$ and $40.$ What is the value of $\frac{N}{M}?$ $(\textbf{A})\: 1\qquad(\textbf{B}) \: 2\qquad(\textbf{C}) \: 37\qquad(\textbf{D}) \: 74\qquad(\textbf{E}) \: 2886$

For a natural number $n$, with $v_2(n)$ we denote the largest integer $k\geq0$ such that $2^k|n$. Let us assume that the function $f\colon\mathbb{N}\to\mathbb{N}$ meets the conditions: $(i)$ $f(x)\leq3x$ for all natural numbers $x\in\mathbb{N}$. $(ii)$ $v_2(f(x)+f(y))=v_2(x+y)$ for all natural numbers $x,y\in\mathbb{N}$. Prove that for every natural number $a$ there exists exactly one natural number $x$ such that $f(x)=3a$.

Lengths of sides of triangle $ABC$ are positive integers, and smallest side is equal to $2$. Determine the area of triangle $P$ if $v_c = v_a + v_b$, where $v_a$, $v_b$ and $v_c$ are lengths of altitudes in triangle $ABC$ from vertices $A$, $B$ and $C$, respectively.

Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that for any two positive integers $m,n$ we have : $$f(n)+1400m^2|n^2+f(f(m))$$

Let $n$ be a prime number. Show that there is a permutation $a_1,a_2,...,a_n$ of $1,2,...,n$ so that $a_1,a_1a_2,...,a_1a_2...a_n$ leave distinct remainders when divided by $n$

Let us call a positive integer [i]pedestrian[/i] if all its decimal digits are equal to 0 or 1. Suppose that the product of some two pedestrian integers also is pedestrian. Is it necessary in this case that the sum of digits of the product equals the product of the sums of digits of the factors? [i]Viktor Kleptsyn, Konstantin Knop[/i]

Let \( n > 1 \) be a positive integer. List in increasing order all the irreducible fractions in the interval \([0, 1]\) that have a positive denominator less than or equal to \( n \): \[ \frac{0}{1} = \frac{p_0}{q_0} < \frac{p_1}{q_1} < \cdots < \frac{p_M}{q_M} = \frac{1}{1}. \] Determine, in function of \( n \), the smallest possible value of \( q_{i-1} + q_i + q_{i+1} \), for \( 0 < i < M \). For example, if \( n = 4 \), the enumeration is \[ \frac{0}{1} < \frac{1}{4} < \frac{1}{3} < \frac{1}{2} < \frac{2}{3} < \frac{3}{4} < \frac{1}{1}, \] where \( p_0 = 0, p_1 = 1, p_2 = 1, p_3 = 1, p_4 = 2, p_5 = 3, p_6 = 1, q_0 = 1, q_1 = 4, q_2 = 3, q_3 = 2, q_4 = 3, q_5 = 4, q_6 = 1 \), and the minimum is \( 1 + 4 + 3 = 3 + 2 + 3 = 3 + 4 + 1 = 8 \).

Determine all sequences $ a_1,a_2,a_3,...$ of $ 1$ and $ \minus{}1$ such that $ a_{mn}\equal{}a_ma_n$ for all $ m,n$ and among any three successive terms $ a_n,a_{n\plus{}1},a_{n\plus{}2}$ both $ 1$ and $ \minus{}1$ occur.

Find all triples of positive integers $a, b, c$ such that they are pairwise relatively prime and $a^2+3b^2c^2=7^c$.

Given positive integers $a,b,c,d$ such that $a\mid c^d$ and $b\mid d^c$. Prove that \[ ab\mid (cd)^{max(a,b)} \]

Let $(x+1)^p(x-3)^q=x^n+a_1x^{n-1}+\ldots+a_{n-1}x+a_n$, where $p,q$ are positive integers. (a) Prove that if $a_1=a_2$, then $3n$ is a perfect square. (b) Prove that there exists infinitely many pairs $(p,q)$ for which $a_1=a_2$.

Find all sets of $n\ge 2$ consecutive integers $\{a+1,a+2,...,a+n\}$ where $a\in Z$, in which one of the numbers is equal to the sum of all the others. (Bogdan Rublev)

Find all real numbers $x$ such that $x\lfloor x\lfloor x\lfloor x\rfloor\rfloor\rfloor=88$. The notation $\lfloor x\rfloor$ means the greatest integer less than or equal to $x$.

Let coefficients of the polynomial$ P (x) = a_dx^d + ... + a_2x^2 + a_0$ where $d \ge 2$, are positive integers. The sequences $(b_n)$ is defined by $b_1 = a_0$ and $b_{n+1} = P (b_n)$ for $n \ge 1$. Prove that for any $n \ge 2$, there exists a prime number $p$ such that $p|b_n$ but it does not divide $b_1, b_2, ..., b_{n-1}$.

What is the smallest non-square positive integer that is the product of four prime numbers (not necessarily distinct)?

For a number $n$ in base $10$, let $f(n)$ be the sum of all numbers possible by removing some digits of $n$ (including none and all). For example, if $n = 1234$, $f(n) = 1234 + 123 + 124 + 134 + 234 + 12 + 13 + 14 + 23 + 24 + 34 + 1 + 2 + 3 + 4 = 1979$; this is formed by taking the sums of all numbers obtained when removing no digit from $n$ (1234), removing one digit from $n$ (123, 124, 134, 234), removing two digits from $n$ (12, 13, 14, 23, 24, 34), removing three digits from $n$ (1, 2, 3, 4), and removing all digits from $n$ (0). If $p$ is a 2011-digit integer, prove that $f(p)-p$ is divisible by $9$. Remark: If a number appears twice or more, it is counted as many times as it appears. For example, with the number $101$, $1$ appears three times (by removing the first digit, giving $01$ which is equal to $1$, removing the first two digits, or removing the last two digits), so it is counted three times.

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$.

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.)

$p$ is a polynomial with integer coefficients and for every natural $n$ we have $p(n)>n$. $x_k $ is a sequence that: $x_1=1, x_{i+1}=p(x_i)$ for every $N$ one of $x_i$ is divisible by $N.$ Prove that $p(x)=x+1$

Let $n$ be a positive integer. Prove that the numbers $n^2(n^2 + 2)^2$ and $n^4(n^2 + 2)^2$ are written in base $n^2 +1$ with the same digits but in opposite order.

Define the sequence $a_0,a_1,a_2,\hdots$ by $a_n=2^n+2^{\lfloor n/2\rfloor}$. Prove that there are infinitely many terms of the sequence which can be expressed as a sum of (two or more) distinct terms of the sequence, as well as infinitely many of those which cannot be expressed in such a way.

If the Highest Common Divisor of $ 6432$ and $ 132$ is diminished by $ 8$, it will equal: $ \textbf{(A)}\ \minus{}6 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ \minus{}2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$

Is there a positive integer $ k$ such that none of the digits $ 3,4,5,6$ appear in the decimal representation of the number $ 2002!\cdot k$?

Find all $\{a_n\}_{n\ge 0}$ that satisfies the following conditions. (1) $a_n\in \mathbb{Z}$ (2) $a_0=0, a_1=1$ (3) For infinitly many $m$, $a_m=m$ (4) For every $n\ge2$, $\{2a_i-a_{i-1} | i=1, 2, 3, \cdots , n\}\equiv \{0, 1, 2, \cdots , n-1\}$ $\mod n$

(a) Prove that $(2^{n+1}-1)!$ is divisible by $ \prod_{i=0}^n (2^{n+1-i}-1)^{2^i }$, for every natural number n (b) Define the sequence ($c_n$) by $c_1=1$ and $c_{n}=\frac{4n-6}{n}c_{n-1}$ for $n\ge 2$. Show that each $c_n$ is an integer.