Permutation Proof: Proving (n+1)nPr=(n+1)P(r+1)

In summary, the conversation discusses a proof involving the equations (n+1)nPr=(n+1)P(r+1) and nPr=\frac{n!}{(n-r)!}. The speaker attempts to substitute (n+1)n in the equation of nPr, but is unsure how to continue. The expert explains that (n+1)nPr is not the same as ((n+1)n)Pr and suggests starting with either side of the equation to arrive at the other. The speaker also asks if (n+1)n!=(n+1)! and the expert confirms that it is true.
  • #1
Pual Black
92
1

Homework Statement


Hello
I have to proof this
##(n+1)nPr=(n+1)P(r+1)##

The attempt at a solution
if i substitute this in
##nPr=\frac{n!}{(n-r)!}##
I get this
##(n+1)nPr=\frac{[(n+1)n]!}{[(n+1)n-r]!}##
This will give
##(n+1)nPr=\frac{(n^2+n)!}{(n^2+n-r)!}##

Now i don't know how to continue.
 
Physics news on Phys.org
  • #2
Pual Black said:

Homework Statement


Hello
I have to proof this
##(n+1)nPr=(n+1)P(r+1)##

The attempt at a solution
if i substitute this in
##nPr=\frac{n!}{(n-r)!}##
I get this
##(n+1)nPr=\frac{[(n+1)n]!}{[(n+1)n-r]!}##
This will give
##(n+1)nPr=\frac{(n^2+n)!}{(n^2+n-r)!}##

Now i don't know how to continue.
I don't think (n + 1) * n! = [n * (n + 1)]!

What is (n + 1)*n! ?
 
  • #3
Further to SteamKing's point, why did you also attempt to multiply the denominator by n+1?
 
  • #4
I just substituted (n+1)n in the equation of nPr.
##nPr=\frac{n!}{n-r}##
Just changed the (n) with (n+1)n
I didn't multipy the denominator.

But now i think i get you
Did you mean that (n+1)nPr isn't the same as ((n+1)n)Pr ??
 
  • #5
Pual Black said:
Did you mean that (n+1)nPr isn't the same as ((n+1)n)Pr ??
Yes. It's (n+1)(nPr).
 
  • Like
Likes Pual Black
  • #6
Ok thanks. Now let's go on
##(n+1)nPr=(n+1)\frac{n!}{(n-r)!}##

I have to get this
##\frac{(n+1)!}{[(n+1)-(r+1)]!}##
to proof the R.H.S

But if i start with the Right side
##(n+1)P(r+1)=\frac{(n+1)!}{[(n+1)-(r+1)]!}=(n+1)\frac{n!}{(n-r)!}=(n+1)nPr=L.H.S##
But how to start with left side and proof the right side ?

I can -1 +1 to the denominator to get the (n+1)-(r+1)
But can i say that (n+1)n!=(n+1)! ?
I think yes of course
 
  • #7
Pual Black said:
Ok thanks. Now let's go on
##(n+1)nPr=(n+1)\frac{n!}{(n-r)!}##

I have to get this
##\frac{(n+1)!}{[(n+1)-(r+1)]!}##
to proof the R.H.S

But if i start with the Right side
##(n+1)P(r+1)=\frac{(n+1)!}{[(n+1)-(r+1)]!}=(n+1)\frac{n!}{(n-r)!}=(n+1)nPr=L.H.S##
But how to start with left side and proof the right side ?

I can -1 +1 to the denominator to get the (n+1)-(r+1)
But can i say that (n+1)n!=(n+1)! ?
I think yes of course
Yes. And since you are dealing with equalities, not inequalities, it doesn't matter which side you start with to arrive at the other.
 
  • Like
Likes Pual Black
  • #8
haruspex said:
Yes. And since you are dealing with equalities, not inequalities, it doesn't matter which side you start with to arrive at the other.
Ok. Thank you very much for your help.
 

FAQ: Permutation Proof: Proving (n+1)nPr=(n+1)P(r+1)

1. What is a permutation proof?

A permutation proof is a type of mathematical proof that uses the concept of permutations to show that an equation or statement is true. It involves manipulating the order or arrangement of a set of objects or elements to prove that the equation holds.

2. How do you prove (n+1)nPr=(n+1)P(r+1) using permutation?

To prove this equation using permutation, you would start by expanding both sides using the definition of nPr (n permutation r). Then, you would use the commutative and associative properties of multiplication to rearrange the terms in a way that allows you to cancel out common factors. Finally, you would use the definition of (n+1)P(r+1) to show that the two sides are equal.

3. What are the steps involved in a permutation proof?

The steps involved in a permutation proof are as follows:

  1. Expand both sides of the equation using the definition of nPr.
  2. Rearrange the terms using the commutative and associative properties of multiplication.
  3. Cancel out common factors.
  4. Use the definition of (n+1)P(r+1) to show that the two sides are equal.

4. Can you provide an example of a permutation proof?

Yes, an example of a permutation proof would be proving that nPr = n!/(n-r)! for all values of n and r. This can be done by expanding both sides of the equation, rearranging the terms, and using the definition of factorial to show that the two sides are equal.

5. Why is permutation important in mathematics?

Permutation is important in mathematics because it allows us to analyze and manipulate the order or arrangement of a set of objects or elements. This is useful in various areas of mathematics, such as combinatorics, probability, and group theory. Permutation proofs are also commonly used in mathematics to show that equations or statements are true.

Similar threads

Back
Top