This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 310

The sequence $ \{a_n\}$ is defined by \[ a_0 \equal{} 1,a_1 \equal{} 1, \text{ and } a_n \equal{} a_{n \minus{} 1} \plus{} \frac {a_{n \minus{} 1}^2}{a_{n \minus{} 2}}\text{ for }n\ge2. \]The sequence $ \{b_n\}$ is defined by \[ b_0 \equal{} 1,b_1 \equal{} 3, \text{ and } b_n \equal{} b_{n \minus{} 1} \plus{} \frac {b_{n \minus{} 1}^2}{b_{n \minus{} 2}}\text{ for }n\ge2. \]Find $ \frac {b_{32}}{a_{32}}$.
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]
Let $k$ and $n$ be integers with $0 < k < n^2/4$ such that k has no prime divisor greater than $n$. Prove that $k$ divides $n!$.
For each positive integer $n$, define \[g(n) = \gcd\left\{0! n!, 1! (n-1)!, 2 (n-2)!, \ldots, k!(n-k)!, \ldots, n! 0!\right\}.\] Find the sum of all $n \leq 25$ for which $g(n) = g(n+1)$.
Determine all pairs $(k, n)$ of positive integers that satisfy $$1! + 2! + ... + k! = 1 + 2 + ... + n.$$
Prove that $\tau ((n+1)!) \leq 2 \tau (n!)$ for all positive integers $n$.
The 120 permutations of the AHSME are arranged in dictionary order as if each were an ordinary five-letter word. The last letter of the 85th word in this list is: $ \textbf{(A)}\ \text{A} \qquad \textbf{(B)}\ \text{H} \qquad \textbf{(C)}\ \text{S} \qquad \textbf{(D)}\ \text{M} \qquad \textbf{(E)}\ \text{E} $
For every integer $n\geqslant2$ prove the inequality $$ \frac{1}{2!}+\frac{2}{3!}+\ldots+\frac{2^{n-2}}{n!}\leqslant\frac{3}{2}, $$ where $k!=1\cdot2\cdot\ldots\cdot k$.
$(USS 1)$ Prove that for a natural number $n > 2, (n!)! > n[(n - 1)!]^{n!}.$
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$
Find all positive integers $1 \le n \le 2008$ so that there exist a prime number $p \ge n$ such that $$\frac{2008^p + (n -1)!}{n}$$ is a positive integer.
Find all pairs $(k,n)$ of positive integers such that \[ k!=(2^n-1)(2^n-2)(2^n-4)\cdots(2^n-2^{n-1}). \] [i]Proposed by Gabriel Chicas Reyes, El Salvador[/i]
Let $k$ be a positive integer, and $n$ a positive integer greater than $2$. Define $$f_{1}(n)=n,\;\; f_{2}(n)=n^{f_{1}(n)},\;\ldots\;, f_{j+1}(n)=n^{f_{j}(n)}.$$ Prove either part of the inequality $$f_{k}(n) < n!! \cdots ! < f_{k+1}(n),$$ where the middle term has $k$ factorial symbols.
Given positive integers $k, m, n$ such that $1 \leq k \leq m \leq n$. Evaluate \[\sum^{n}_{i=0} \frac{(-1)^i}{n+k+i} \cdot \frac{(m+n+i)!}{i!(n-i)!(m+i)!}.\]
Let $\mathbb{N} = \{1, 2, 3, \dots \}$ be the set of positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$, such that for all positive integers $n$ and prime numbers $p$: $$p \mid f(n)f(p-1)!+n^{f(p)}.$$ [i]Proposed by Dorlir Ahmeti[/i]
What is the smallest integer $n$ for which $\frac{10!}{n}$ is a perfect square?
For each integer $n \ge 2$ we consider the last digit different from zero in the decimal expansion of $n!$. The infinite sequence of these digits starts with $2,6,4,2,2$. Determine all digits which occur at least once in this sequence, and show that each of those digits occurs in fact infinitely often.
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$
$(CZS 4)$ Let $K_1,\cdots , K_n$ be nonnegative integers. Prove that $K_1!K_2!\cdots K_n! \ge \left[\frac{K}{n}\right]!^n$, where $K = K_1 + \cdots + K_n$
The operation $*$ is defined by the following: $a*b=a!-ab-b.$ Compute the value of $5*8.$ [i]2015 CCA Math Bonanza Individual Round #2[/i]
Find the remainder when $1! + 2! + 3! + \dots + 1000!$ is divided by $9$.
Evaluate the sum $\frac{3!+4!}{2(1!+2!)}+\frac{4!+5!}{3(2!+3!)}+\cdots+\frac{12!+13!}{11(10!+11!)}$
Let $P(x)=x^3+ax^2+b$ and $Q(x)=x^3+bx+a$, where $a$ and $b$ are nonzero real numbers. Suppose that the roots of the equation $P(x)=0$ are the reciprocals of the roots of the equation $Q(x)=0$. Prove that $a$ and $b$ are integers. Find the greatest common divisor of $P(2013!+1)$ and $Q(2013!+1)$.
The digit in unit place of $1!+2!+\ldots+99!$ is $\textbf{(A)}~3$ $\textbf{(B)}~0$ $\textbf{(C)}~1$ $\textbf{(D)}~7$