Intereting Posts

mapping properties of $(1−z)^i$
Understanding Power Series Multiplication Step
Rational Point in circle
Zero vector of a vector space
Prove the center of $G$ cannot have order $p^{n-1}$
characteristic polynomial of companion matrix
Find normal vector of circle in 3D space given circle size and a single perspective
A question about Hölder spaces.
Showing that the product of vector magnitudes is larger than their dot product
Limit of Implicitly Defined Function
Testcases for Baldwin Lachlan
How to pass from $L^2(0,T;V')$ to $\mathcal{D}'\big(\Omega\times (0,T)\big)$?
Proving that the characters of an infinite Abelian group is a basis for the space of functions from the group to $\mathbb{C}$
How do I prove $\log_a abc + \log_b abc + \log_c abc = 1$
Prove inequality $8xyz<1$ for positive $x,y,z$

Prove that if $m$ and $n$ are positive integers then $m!n! < (m+n)!$

Given hint:

$m!= 1\times 2\times 3\times\cdots\times m$ and $1<m+1, 2<m+2, \ldots , n<m+n$

- Finding the Total number of permutation using a selective formula
- Induction: $n^{n+1} > (n+1)^n$ and $(n!)^2 \leq \left(\frac{(n + 1)(2n + 1)}{6}\right)^n$
- Solving an inequality : $n \geq 3$ , $n^{n} \lt (n!)^{2}$.
- $n$ choose $k$ where $n$ is less than $k$
- Evaluate a finite sum with four factorials
- Since $(\frac{1}{2})!=\frac{\sqrt{\pi}}{2}$, what is $(\frac{1}{4})!$

It looks simple but I’m baffled and can’t reach the correct proof.

Thank you.

- Showing inequality for harmonic series.
- How to find the minimum value of this function?
- Prove $\sup \left| f'\left( x\right) \right| ^{2}\leqslant 4\sup \left| f\left( x\right) \right| \sup \left| f''\left( x\right) \right| $
- Series and integrals for inequalities and approximations to $\pi$
- Find $\lim_{n\rightarrow\infty}\frac{n}{(n!)^{1/n}}$
- A binomial inequality with factorial fractions: $\left(1+\frac{1}{n}\right)^n<\frac{1}{0!}+\frac{1}{1!}+\frac{1}{2!}+…+\frac{1}{n!}$
- Show that $2 < e^{1/(n+1)} + e^{-1/n}$
- Is this AM/GM refinement correct or not?
- Is $\sqrt{n!}$ a natural number?
- Prove that $(a+1)(a+2)…(a+b)$ is divisible by $b!$

Notice that $m!n!$ and $(m+n)!$ both have the same number of terms. Let’s compare them:

$$m!n! = (1 \times 2 \times \ldots \times m) \times (1 \times 2 \times \ldots \times n)$$

$$(m+n)! = (1 \times 2 \times \ldots \times m) \times ((m+1) \times (m+2) \times \ldots \times (m+n))$$

Both expressions have the same first $m$ terms, but after that each term in the second expression is bigger than the corresponding term in the first: $m+1 > 1$, *etc.*

Note that $\frac{(m+n)!}{m!}=(m+1)(m+2)\ldots(m+n)$. So you need to prove $n!<(m+1)(m+2)\ldots(m+n)$, and your hint applies.

Alternative proof: if you have $m$ girls and $n$ boys, you can line them up in $m!n!$ ways such that all girls come before all boys, and in $(m+n)!$ ways without that restriction.

One-line proof (some details omitted): ${m+n \choose m} > 1$ if $0 < m < n$.

If you would like, here is an other proof:

I assume that $n,m\in\mathbb{N}_0$. From the hint that

$$

1<m+1, 2<m+2, \ldots, n<m+n

$$

you can see that $n!<(m+n)!$.

Now we proof by induction that $m!n!<(m+n)!$. Take $m=1$, then we have $1!n!<(1+n)!$. Now assume that $m!n!<(m+n)!$ is correct, this is the induction hypothesis. We calculate

\begin{align*}

(m+1)!n!&=(m+1)m!n!\\&<(m+1)(m+n)!\\&<(m+n+1)(m+n)!\\&=(m+n+1)!.

\end{align*}

The first inequality is because of the induction hypothesis. The second because $n\geq1$.

Some quite complicated answers here for showing that there is more than one string we can form with letters $A$ and $B$ of length $m+n$, with $m$ repetitions of $A$ and $n$ repetitions of $B.$

**Hint** $\ \:\rm f(n) > 1\,$ since it is a product of terms $>1,$ via multiplicative *telescopy*, viz.

$$\begin{eqnarray}\rm f(n)\, =\ f(0) \prod_{k\:=\:1}^{n}\, \frac{f(k)}{f(k-1)} &=&\rm \, \color{red}{\rlap{–}f(0)}\frac{\color{green}{\rlap{–}f(1)}}{\color{red}{\rlap{–}f(0)}}\frac{\color{royalblue}{\rlap{–}f(2)}}{\color{green}{\rlap{–}f(1)}}\frac{\phantom{\rlap{–}f(3)}}{\color{royalblue}{\rlap{–}f(2)}}\, \cdots\, \frac{\color{brown}{\rlap{–}f(n-1)}}{\phantom{\rlap{–}f(n-2)}}\frac{f(n)}{\color{brown}{\rlap{—-}f(n-1)}}\\

&=&\rm\,\ \frac{1+m}1\ \frac{2+m}2\ \frac{3+m}3\,\cdots\, \frac{n+m}n \\

\rm \phantom{\frac{\frac{1}1}{\frac{1}1}}because\ the\ term\ ratio\ is\ \ \displaystyle\rm\ \frac{f(k)}{f(k-1)} &=&\rm\ \frac{(k+m)!}{k!\,m!}\, \frac{(k-1)!\,m!}{(k-1+m)!}\, =\, \frac{k+m}{k} \end{eqnarray} $$

This yields *precisely* the same proof as the accepted answer. However, by using the general method of telescopy, one is able to derive the proof *algorithmically* vs. ad-hoc. Such telescopic methods work much more generally. They are essential in more complex problems where ad-hoc methods have no hope due to the innate structure being obfuscated by the complexity. See here for more.

- Find $x$: $5\cos(x) = 2\sec(x)-3$
- Are all extensions of finite fields cyclic?
- A question on complex analysis
- Factorization of polynomials over $\mathbb{C}$
- Differentiation continuous iff domain is finite dimensional
- Let $\text{Rank}{(A – \lambda I)^k} = \text{Rank}{(B – \lambda I)^k}$. Why are $A$ and $B$ similar?
- Show $\psi$ and $\Delta$ are identifiable
- Sheldon Cooper Primes
- Practicing Seifert van Kampen
- $f \in L^1$, but $f \not\in L^p$ for all $p > 1$
- In a metric space, compactness implies completness
- What is the Kolmogorov Extension Theorem good for?
- Classifying groups of order 12.
- Challenge: Demonstrate a Contradiction in Leibniz' differential notation
- If $$ is finite, then $ = $ iff $G = HK$ (Hungerford Proposition 4.8, Proof)