# Tagged Questions

54 views

### How can I show that $n^{n+2}<(2n)!$ for any integer $n$.

When I was try to show that the series $\sum_n \frac{n^n}{(2n)!}$ is convergent using comparison test, I stuck at the point $n^{n+2}<(2n)!$ I think it can be show using mathematical induction. If ...
44 views

### Proving by induction that $(n^2)!>(n!)^2$ for $n \geq 2$

I'm trying to prove that $(n^2)!>(n!)^2$ for $n \in [2,\infty) \cap\mathbb{Z^+}.$ Ok, here's what I've tried: $n \geq 2,$ $(n^2)!>(n!)^2$ ...
138 views

### $1!+2!+\ldots+n!$ cannot be the square of a positive integer

I have to prove that $1!+2!+\ldots+n!$ cannot be the square of a positive integer, $\forall n\geq4$. I've tried to do this with induction, but I don't seem to reach any satisfactory conclusion. Any ...
49 views

1k views

### Mathematical Induction Factorials, sum r(r!) =(n+1)! -1 [duplicate]

How do I prove that $$\sum\limits_{r=1}^{n} r(r!) = (n+1)!-1$$ I was able to get to factor: $LHS = k(k!) + (k+1)(k+1)!$ $\quad\quad\quad\quad\quad\quad\quad\quad\quad\quad\, RHS = (k+2)! -1$
100 views

### Trying to understand an exercise using factorials with induction

Exercise: Prove that (n + 1)! - n! = n(n!) for any n $\ge$ 1 Given Answer: I will skip the basic step since I understand that part. (n + 2)! - (n + 1)! = (n + 1)!(n + 2) - n!(n + 1) I understand ...
89 views

990 views

### Proof the inequality $n! \geq 2^n$ by induction

I'm having difficulity solving an exercise in my course. The question is: Prove that $n!\geq 2^n$. We have to do this with induction. I started like this: The lowest natural number where the ...
386 views

### How to prove $n < n!$ if $n > 2$ by induction?

I am stuck with the question below, Prove by mathematical induction that $n<n!$ for $n>2$.
1k views

### Inductive proof for the Binomial Theorem for rising factorials

I want to proove the following equality containing rising factorials $$(x+y)^\overline{n}\overset{(*)}{=}\sum_{k=0}^n\binom{n}{k}x^\overline{k}y^\overline{n-k}.$$ For $n=1$ this equality is ...
2k views

### Solve by induction: $n!>(n/e)^n$

To Prove : $n! > (n/e)^n$ The question seems easy but it ain't; anyone up for it ?
363 views

### Use of algebra and factorials for a question related to proof by induction

\begin{align*} &= (n+1)! − 1 + ( (n+1) · (n+1)! )\\ &= (n+1)! (1+n+1) − 1\\ &= (n+1)! (n+2) − 1\\ &= (n+2)! − 1\\ \end{align*} I'm confused at how the first ...
962 views

### How to prove $a^n < n!$ for all $n$ sufficiently large, and $n! \leq n^n$ for all $n$, by induction?

I have a couple things I want to prove. I'm pretty sure a proof by induction is the best route for these. First, I need to show that $5^n < n!$ from some $n_{0} > 0$. I'm choosing \$n_{0} = ...