Found problems: 310
Prove that there exists a sequence of unbounded positive integers $a_1\leq a_2\leq a_3\leq\cdots$, such that there exists a positive integer $M$ with the following property: for any integer $n\geq M$, if $n+1$ is not prime, then any prime divisor of $n!+1$ is greater than $n+a_n$.
Given that \[ \frac 1{2!17!}+\frac 1{3!16!}+\frac 1{4!15!}+\frac 1{5!14!}+\frac 1{6!13!}+\frac 1{7!12!}+\frac 1{8!11!}+\frac 1{9!10!}=\frac N{1!18!} \] find the greatest integer that is less than $\frac N{100}.$
Find the smallest number with exactly 28 divisors.
Prove that if the product $1\cdot 2\cdot ...\cdot n$ ($n> 3$) is not divisible by $n + 1$, then $n + 1$ is prime.
Given a positive integer $a,$ prove that $n!$ is divisible by $n^2 + n + a$ for infinitely many positive integers $n.{}$
[i]Proposed by Andrei Bâra[/i]
Find all positive integers n such that the product $1! \cdot 2! \cdot \cdot \cdot \cdot n!$ is a perfect square
Prove that $(a!\cdot b!) | (a+b)!$ $\forall a,b\in\mathbb{N}$.
Define $ n!!$ to be $ n(n\minus{}2)(n\minus{}4)\ldots3\cdot1$ for $ n$ odd and $ n(n\minus{}2)(n\minus{}4)\ldots4\cdot2$ for $ n$ even. When $ \displaystyle \sum_{i\equal{}1}^{2009} \frac{(2i\minus{}1)!!}{(2i)!!}$ is expressed as a fraction in lowest terms, its denominator is $ 2^ab$ with $ b$ odd. Find $ \displaystyle \frac{ab}{10}$.
Prove that there are no integers $x$ and $y$ satisfying $x^{2}=y^{5}-4$.
Prove that numbers of the form \[\frac{a_{1}}{1!}+\frac{a_{2}}{2!}+\frac{a_{3}}{3!}+\cdots,\] where $0 \le a_{i}\le i-1 \;(i=2, 3, 4, \cdots)$ are rational if and only if starting from some $i$ on all the $a_{i}$'s are either equal to $0$ ( in which case the sum is finite) or all are equal to $i-1$.
Let $N = 15! = 15\cdot 14\cdot 13 ... 3\cdot 2\cdot 1$. Prove that $N$ can be written as a product of nine different integers all between $16$ and $30$ inclusive.
We say an integer number $n \ge 1$ is conservative, if the smallest prime divisor of $(n!)^n+1$ is at most $n+2015$. Decide if the number of conservative numbers is infinite or not.
Do there exist positive integers $b,n>1$ such that when $n$ is expressed in base $b$, there are more than $n$ distinct permutations of its digits? For example, when $b=4$ and $n=18$, $18 = 102_4$, but $102$ only has $6$ digit arrangements. (Leading zeros are allowed in the permutations.)
[i]Lewis Chen.[/i]
Show that $\sum_{n=0}^{2013}\frac{4026!}{(n!(2013-n)!)^2}$ is a perfect square.
Mr. Harman needs to know the combined weight in pounds of three boxes he wants to mail. However, the only available scale is not accurate for weights less than $100$ pounds or more than $150$ pounds. So the boxes are weighed in pairs in every possible way. The results are $122$, $125$ and $127$ pounds. What is the combined weight in pounds of the three boxes?
$\textbf{(A)}\ 160\qquad
\textbf{(B)}\ 170\qquad
\textbf{(C)}\ 187\qquad
\textbf{(D)}\ 195\qquad
\textbf{(E)}\ 354$
A unit of blood expires after $10!=10\cdot 9 \cdot 8 \cdots 1$ seconds. Yasin donates a unit of blood at noon of January 1. On what day does his unit of blood expire?
$\textbf{(A) }\text{January 2}\qquad\textbf{(B) }\text{January 12}\qquad\textbf{(C) }\text{January 22}\qquad\textbf{(D) }\text{February 11}\qquad\textbf{(E) }\text{February 12}$
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}$.
Find all pairs of natural numbers $(k, m)$ such that for any natural $n{}$ the product\[(n+m)(n+2m)\cdots(n+km)\]is divisible by $k!{}$.
[i]Proposed by P. Kozhevnikov[/i]
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}$
Find all positive integers $w$, $x$, $y$ and $z$ which satisfy $w! = x! + y! + z!$.
Prove that there exist at least $100!$ ways to write $100!$ as sum of elements of set {$1!,2!,3!...99!$}
(each number in sum can be two or more times)
A positive integer $n$ satisfies the equation $(n+1)! + (n+2)! = n! \cdot 440$. What is the sum of the digits of $n$?
$\textbf{(A) }2\qquad\textbf{(B) }5\qquad\textbf{(C) }10\qquad\textbf{(D) }12\qquad\textbf{(E) }15$
Every positive integer $k$ has a unique factorial base expansion $(f_1,f_2,f_3,\ldots,f_m),$ meaning that \[ k=1!\cdot f_1+2!\cdot f_2+3!\cdot f_3+\cdots+m!\cdot f_m, \] where each $f_i$ is an integer, $0\le f_i\le i,$ and $0<f_m.$ Given that $(f_1,f_2,f_3,\ldots,f_j)$ is the factorial base expansion of $16!-32!+48!-64!+\cdots+1968!-1984!+2000!,$ find the value of $f_1-f_2+f_3-f_4+\cdots+(-1)^{j+1}f_j.$
For any natural $n$ , define $n!!=(n!)!$ e.g. $3!!=(3!)!=6!=720$.
Let $a_1,a_2,...,a_n$ be a positive integer Prove that $$\frac{(a_1+a_2+\cdots+a_n)!!}{a_1!!a_2!!\cdots a_n!!}$$ is an integer.
[i](nooonuii)[/i]
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$$