MHB How would I prove this by induction?

  • Thread starter Thread starter tony700
  • Start date Start date
  • Tags Tags
    Induction
AI Thread Summary
To prove the identity $$\sum_{k=0}^n\frac{n!}{n^kk!(n-k)!}=\frac{(n+1)^n}{n^n}$$ by induction, the induction hypothesis is stated as $$\sum_{k=0}^n\left({n \choose k}\frac{1}{n^k}\right)=\left(1+\frac{1}{n}\right)^n$$, which relates to the binomial theorem. The base case for n=1 is verified as true, showing that $$\sum_{k=0}^1\left({1 \choose k}\frac{1}{1^k}\right)=2$$ matches the expected result. The next step involves restating the induction hypothesis for n and determining the appropriate induction step to prove the case for n+1. The discussion emphasizes the importance of using binomial coefficients and identities in the proof process.
tony700
Messages
5
Reaction score
0
How would I prove this by induction?

$$\sum_{k=0}^n\frac{n!}{n^kk!(n-k)!}=\frac{(n+1)^n}{n^n}$$
 
Mathematics news on Phys.org
I would begin by writing the induction hypothesis as:

$$\sum_{k=0}^n\left({n \choose k}\frac{1}{n^k}\right)=\left(1+\frac{1}{n}\right)^n$$

We can see this is simply a statement of a particular case of the binomial theorem. As such, we will find the following 3 identities useful:

[box=blue]$${r \choose 0}=1\tag{1}$$

$${r \choose r}=1\tag{2}$$

$${k \choose r}+{k \choose r-1}={k+1 \choose r}\tag{3}$$

where $(k,r)\in\mathbb{N}$ and $r\le k$[/box]

So, the first thing we want to do is show the base case $P_1$ is true:

$$\sum_{k=0}^1\left({1 \choose k}\frac{1}{1^k}\right)=\left(1+\frac{1}{1}\right)^1$$

We can see this simplifies to:

$$2=2\quad\checkmark$$

So, we restate our induction hypothesis $P_n$:

$$\sum_{k=0}^n\left({n \choose k}\frac{1}{n^k}\right)=\left(1+\frac{1}{n}\right)^n$$

What do you suppose our induction step should be?
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Thread 'Unit Circle Double Angle Derivations'
Here I made a terrible mistake of assuming this to be an equilateral triangle and set 2sinx=1 => x=pi/6. Although this did derive the double angle formulas it also led into a terrible mess trying to find all the combinations of sides. I must have been tired and just assumed 6x=180 and 2sinx=1. By that time, I was so mindset that I nearly scolded a person for even saying 90-x. I wonder if this is a case of biased observation that seeks to dis credit me like Jesus of Nazareth since in reality...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Back
Top