Found problems: 310
Find all pairs of positive integers $(m,n)$, for which $$(m^n-n)^m=n!+m$$
[i]D. Volkovets[/i]
Find all positive integers $ n$ such that there exists a unique integer $ a$ such that $ 0\leq a < n!$ with the following property:
\[ n!\mid a^n \plus{} 1
\]
[i]Proposed by Carlos Caicedo, Colombia[/i]
Let $d_{m} (n)$ denote the last non-zero digit of $n$ in base $m$ where $m,n$ are naturals. Given distinct odd primes $p_1,p_2,\ldots,p_k$, show that there exists infinitely many natural $n$ such that
$$d_{2p_i} (n!) \equiv 1 \pmod {p_i}$$
for all $i = 1,2,\ldots,k$.
Prove that $(n!)!$ is a multiple of $(n!)^{(n-1)!}$
Find all positive integers $ n$ such that there exists a unique integer $ a$ such that $ 0\leq a < n!$ with the following property:
\[ n!\mid a^n \plus{} 1
\]
[i]Proposed by Carlos Caicedo, Colombia[/i]
Show that every positive rational number can be written as a quotient of products of factorials of (not necessarily distinct) primes. For example, $ \frac{10}9\equal{}\frac{2!\cdot 5!}{3!\cdot 3!\cdot 3!}.$
Find all the positive integers $n , n\ge 3$ such that $n\mid (n-2)!$
Determine all positive integers n such that $n^2/ (n - 1)!$
Find the area of the domain expressed by the following system inequalities.
\[x\geq 0,\ y\geq 0,\ x^{\frac{1}{p}}+y^{\frac{1}{p}} \leq 1\ (p=1,2,\cdots)\]
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$
Let $\ell$ be a positive integer. We say that a positive integer $k$ is [i]nice [/i] if $k!+\ell$ is a square of an integer. Prove that for every positive integer $n \geqslant \ell$, the set $\{1, 2, \ldots,n^2\}$ contains at most $n^2-n +\ell$ nice integers. \\ \\
(Théo Lenoir)
Prove that there exist no positive integers $m$ and $n$ such that $m > 5$ and $(m - 1)! + 1 = m^n$.
For integers $n \ge k \ge 0$ we define the [i]bibinomial coefficient[/i] $\left( \binom{n}{k} \right)$ by
\[ \left( \binom{n}{k} \right) = \frac{n!!}{k!!(n-k)!!} .\]
Determine all pairs $(n,k)$ of integers with $n \ge k \ge 0$ such that the corresponding bibinomial coefficient is an integer.
[i]Remark: The double factorial $n!!$ is defined to be the product of all even positive integers up to $n$ if $n$ is even and the product of all odd positive integers up to $n$ if $n$ is odd. So e.g. $0!! = 1$, $4!! = 2 \cdot 4 = 8$, and $7!! = 1 \cdot 3 \cdot 5 \cdot 7 = 105$.[/i]
In this question you must make all numbers of a clock, each with using 2, exactly 3 times and Mathematical symbols. You are not allowed to use English alphabets and words like $ \sin$ or $ \lim$ or $ a,b$ and no other digits.
[img]http://i2.tinypic.com/5x73dza.png[/img]
Find all functions $f:\mathbb{Z}^+\rightarrow \mathbb{Z}^+$ satisfying $$m!!+n!!\mid f(m)!!+f(n)!!$$for each $m,n\in \mathbb{Z}^+$, where $n!!=(n!)!$ for all $n\in \mathbb{Z}^+$.
[i]Proposed by DVDthe1st[/i]
Let $n$ be a positive integer and $a_1,a_2,...,a_{2n}$ be $2n$ distinct integers. Given that the equation $|x-a_1| |x-a_2| ... |x-a_{2n}| =(n!)^2$ has an integer solution $x = m$, find $m$ in terms of $a_1,a_2,...,a_{2n}$
Find the greatest positive integer $n$ so that $3^n$ divides $70! + 71! + 72!.$
Let $ k$ be a positive integer. Suppose that the integers $ 1,2,3,\dots,3k \plus{} 1$ are written down in random order. What is the probability that at no time during this process, the sum of the integers that have been written up to that time is a positive integer divisible by $ 3$ ? Your answer should be in closed form, but may include factorials.
Determine the highest power of $2$ that divides $2^n!$.
Let $n!=n\cdot (n-1)\cdot (n-2)\cdot \ldots \cdot 2\cdot 1$.For example, $5! = 5\cdot 4\cdot 3 \cdot 2\cdot 1 = 120.$ Compute $\frac{(6!)^2}{5!\cdot 7!}$.
What is the sum of the prime factors of 20!?
Prove that there are infinitely many positive integer $n$ such that $n!$ is divisible by $n^3 -1$.
For each positive integer $n$ let $a_n$ be the largest positive integer satisfying
\[(a_n)!\left| \prod_{k=1}^n \left\lfloor \frac{n}{k}\right\rfloor\right.\]
Show that there are infinitely many positive integers $m$ for which $a_{m+1}<a_m$.
Let $a_1, a_2, \dots, a_{1000}$ be positive integers whose sum is $S$. If $a_n!$ divides $n$ for each $n = 1, 2, \dots, 1000$, compute the maximum possible value of $S$.
[i]Proposed by Michael Ren[/i]
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$