Prove that the function $f : \mathbb{N}\longrightarrow \mathbb{Z}$ defined by $f(n) = n^{2007}-n!$, is injective.

If you alphabetize all of the distinguishable rearrangements of the letters in the word [b]PURPLE[/b], find the number $n$ such that the word [b]PURPLE [/b]is the $n$th item in the list.

Consider the sequence $ \left( I_n \right)_{n\ge 1} , $ where $ I_n=\int_0^{\pi/4} e^{\sin x\cos x} (\cos x-\sin x)^{2n} (\cos x+\sin x )dx, $ for any natural number $ n. $ [b]a)[/b] Find a relation between any two consecutive terms of $ I_n. $ [b]b)[/b] Calculate $ \lim_{n\to\infty } nI_n. $ [i]c)[/i] Show that $ \sum_{i=1}^{\infty }\frac{1}{(2i-1)!!} =\int_0^{\pi/4} e^{\sin x\cos x} (\cos x+\sin x )dx. $ [i]Cătălin Țigăeru[/i]

Find all the natural $n$ such that $n!$ is not divisible by $n^2$.

Does there exist an integer $z$ that can be written in two different ways as $z = x! + y!$, where $x, y$ are natural numbers with $x \le y$ ?

For all integers $n \geq 9,$ the value of $$\frac{(n+2)!-(n+1)!}{n!}$$ is always which of the following? $\textbf{(A) } \text{a multiple of }4 \qquad \textbf{(B) } \text{a multiple of }10 \qquad \textbf{(C) } \text{a prime number} \\ \textbf{(D) } \text{a perfect square} \qquad \textbf{(E) } \text{a perfect cube}$

For how many integers $n$ between $1$ and $50$, inclusive, is \[ \frac{(n^2-1)!}{(n!)^n} \]an integer? (Recall that $0! = 1$.) $\textbf{(A) } 31 \qquad \textbf{(B) } 32 \qquad \textbf{(C) } 33 \qquad \textbf{(D) } 34 \qquad \textbf{(E) } 35$

In Pascal's Triangle, each entry is the sum of the two entries above it. The first few rows of the triangle are shown below. \[\begin{array}{c@{\hspace{8em}} c@{\hspace{6pt}}c@{\hspace{6pt}}c@{\hspace{6pt}}c@{\hspace{4pt}}c@{\hspace{2pt}} c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{2pt}}c@{\hspace{3pt}}c@{\hspace{6pt}} c@{\hspace{6pt}}c@{\hspace{6pt}}c} \vspace{4pt} \text{Row 0: } & & & & & & & 1 & & & & & & \\\vspace{4pt} \text{Row 1: } & & & & & & 1 & & 1 & & & & & \\\vspace{4pt} \text{Row 2: } & & & & & 1 & & 2 & & 1 & & & & \\\vspace{4pt} \text{Row 3: } & & & & 1 & & 3 & & 3 & & 1 & & & \\\vspace{4pt} \text{Row 4: } & & & 1 & & 4 & & 6 & & 4 & & 1 & & \\\vspace{4pt} \text{Row 5: } & & 1 & & 5 & &10& &10 & & 5 & & 1 & \\\vspace{4pt} \text{Row 6: } & 1 & & 6 & &15& &20& &15 & & 6 & & 1 \end{array}\] In which row of Pascal's Triangle do three consecutive entries occur that are in the ratio $3: 4: 5$?

What is the smallest integer $m$ such that $\frac{10!}{m}$ is a perfect square? $\text{(A) }2\qquad\text{(B) }7\qquad\text{(C) }14\qquad\text{(D) }21\qquad\text{(E) }35$

How many perfect squares are divisors of the product $ 1!\cdot 2!\cdot 3!\cdots 9!$? $ \textbf{(A)}\ 504 \qquad \textbf{(B)}\ 672 \qquad \textbf{(C)}\ 864 \qquad \textbf{(D)}\ 936 \qquad \textbf{(E)}\ 1008$

$p$ and $q$ are distinct prime numbers. Prove that the number \[\frac {(pq-1)!} {p^{q-1}q^{p-1}(p-1)!(q-1)!}\] is an integer.

Prove that there are no integers $x$ and $y$ satisfying $x^{2}=y^{5}-4$.

Let $n$ be a positive integer with $n>1$. Prove that \[\frac{1}{2}+\cdots+\frac{1}{n}\] is not an integer.

[b]a)[/b] $ \lim_{n\to\infty } \frac{1}{n^2}\sum_{i=0}^n\sqrt{\binom{n+i}{2}} $ [b]b)[/b] $ \lim_{n\to\infty } \frac{a^{H_n}}{1+n} ,\quad a>0 $

For how many positive integers $ n$ less than or equal to $ 24$ is $ n!$ evenly divisible by $ 1 \plus{} 2 \plus{} \dots \plus{} n$? $ \textbf{(A)}\ 8\qquad \textbf{(B)}\ 12\qquad \textbf{(C)}\ 16\qquad \textbf{(D)}\ 17\qquad \textbf{(E)}\ 21$

What is the value of $\dfrac{11!-10!}{9!}$? $\textbf{(A)}\ 99\qquad\textbf{(B)}\ 100\qquad\textbf{(C)}\ 110\qquad\textbf{(D)}\ 121\qquad\textbf{(E)}\ 132$

Let $n$ be a positive integer. Find all real numbers $x_1,x_2 ,..., x_n$ such that $$\prod_{k=1}^{n}(x_k^2+ (k + 2)x_k + k^2 + k + 1) =\left(\frac{3}{4}\right)^n (n!)^2$$

Prove that for any positive integer $n$ the following identity holds $\frac{(2n)!}{n!}= 2^n \cdot (2n - 1)!!$

Determine all tuples of positive integers $(x, y, z, t)$ such that: $$ xyz = t!$$ $$ (x+1)(y+1)(z+1) = (t+1)!$$ holds simultaneously.

Find the integer $n$ such that $6!\times7!=n!$. [i]2017 CCA Math Bonanza Individual Round #1[/i]

For positive integers $a$ and $b$, define \[a!_b=\prod_{1\le i\le a\atop i \equiv a \mod b} i\] Let $p$ be a prime and $n>3$ a positive integer. Show that there exist at least 2 different positive integers $t$ such that $1<t<p^n$ and $t!_p\equiv 1\pmod {p^n}$.

In how many zeroes does the number $\dfrac{2002!}{(1001!)^2}$ end? $\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }200\qquad\textbf{(E) }400$

An integer $n \geq 3$ is called [i]special[/i] if it does not divide $\left ( n-1 \right )!\left ( 1+\frac{1}{2}+\cdot \cdot \cdot +\frac{1}{n-1} \right )$. Find all special numbers $n$ such that $10 \leq n \leq 100$.

For an odd number n, we write $n!! = n\cdot (n-2)...3 \cdot 1$. How many different residues modulo $1000$ do you get from $n!!$ for $n= 1, 3, 5, …$?

Find roots of the equation $$1 -\frac{x}{1}+ \frac{x(x - 1)}{2!} -... +\frac{ (-1)^nx(x-1)...(x - n + 1)}{n!}= 0$$