How Does P(n,r) / n Relate to P(n-1,r-1) in Combinatorial Proofs?

In summary, the equation states that P(n,r)=n!/n(n-r)!. When solving for r, substitute n-1 for n and r-1 for r.
  • #1
Styx
27
0
Prove that P(n,r) / n = P(n-1,r-1)

I know that it is right but I have having a hard time coming up with a step by step solution.

Is P(n-1,r-1) the same as (n-1)!
 
Physics news on Phys.org
  • #2
Take a concrete example. P(7,3)=7*6*5, P(6,2)=6*5. So is P(7,3)/7=P(6,2)? Yes. Is P(6,2)=6!? NO. What's the general formula for P(n,r)?
 
Last edited:
  • #3
I know that the statement is true but I don't think I can use a specific example as that would be conjecture and not a proof.

P(n,r)= n!/(n-r)! = n x (n-1) x (n-2) x ... x (n - r + 1)
 
Last edited:
  • #4
P(n-1,r-1)=(n-1)! is false. If P(n,r)=n!/(n-r)!, what's the correct formula for P(n-1,r-1)?
 
  • #5
P(n,r)/n = (n-1)!

No...
P(n,r)/n= n!/(n-r)!/n = n x (n-1) x (n-2) x ... x (n - r + 1)/n =
(n-1) x (n-2) x ... x (n - r + 1) = (n-1) x (n-2) x ... x (n - (r - 1) )

Can you solve it from there?
 
  • #6
Brilliant!
 
  • #7
Ok, how about this:

P(n,r)/n = n!/(n-r)!/n = (n-1)!/(n-r)! = P(n-1, r-1)

EDIT:

Actually, wouldn't (n-1)!/(n-r)! be P(n-1, r)?

6!/3! = 120, 120/6 = 20
5!/3! = 20
while 5!/2! = 60
 
Last edited:
  • #8
I thought you had it. P(n-1,r-1)=(n-1)!/((n-1)-(r-1))!, right? Just substitute n-1 for n and r-1 for r in P(n,r). Can you simplify that expression slightly?
 
  • #9
I understand everything except how r/n becomes r-1

n!/n = (n-1)!
(n-r)!/n = ((n-1)-(r/n))!
 
  • #10
Styx said:
I understand everything except how r/n becomes r-1

n!/n = (n-1)!
(n-r)!/n = ((n-1)-(r/n))!

You are doing some silly algebra. (n!/(n-r)!)/n=(n!/n)/(n-r)!. You don't divide (n-r)! by n also.
 
  • #11
Ok, so I was right before.

n!/(n-r)!/n = (n-1)!/(n-r)!

but (n-r)! is equal to ((n-1)-(r-1))!

therefore, n!/(n-r)!/n = (n-1)!/((n-1)-(r-1))!

(n-1)!/((n-1)-(r-1)) = P(n-1, r-1)

therefore, n!/(n-r)!/n = P(n-1, r-1)

Dick said:
You are doing some silly algebra

You have no idea how much trouble my algebra gets me into. Here I am doing grade 12 Geometry and I should probably be reviewing my grade 9 algebra instead...
 
Last edited:
  • #12
Styx said:
Ok, so I was right before.

n!/(n-r)!/n = (n-1)!/(n-r)!

but (n-r)! is equal to ((n-1)-(r-1))!

therefore, n!/(n-r)!/n = (n-1)!/((n-1)-(r-1))!

(n-1)!/((n-1)-(r-1)) = P(n-1, r-1)

therefore, n!/(n-r)!/n = P(n-1, r-1)



You have no idea how much trouble my algebra gets me into. Here I am doing grade 12 Geometry and I should probably be reviewing my grade 9 algebra instead...

Yessssssssss
 
  • #13
Thanks Dick. It must hurt to help sometimes...
 
  • #14
Styx said:
Thanks Dick. It must hurt to help sometimes...

It only hurts when they never get it.
 
  • #15
Styx said:
Prove that P(n,r) / n = P(n-1,r-1)

I know that it is right but I have having a hard time coming up with a step by step solution.

Is P(n-1,r-1) the same as (n-1)!

L.H.S
p(n,r)/n
= n!/n(n-r)!
= n (n-1)!/n(n-r)!
= (n-1)!/(n-r)!
= P (n-1,r-1)
= R.H.S
 
  • #16
now you should do a combinatorial (or counting in two ways) proof for fun
 

FAQ: How Does P(n,r) / n Relate to P(n-1,r-1) in Combinatorial Proofs?

1. What is a permutation proof?

A permutation proof is a mathematical method used to show that two expressions are equivalent by rearranging their elements in a specific order.

2. How is a permutation proof different from a combination proof?

A permutation proof rearranges elements in a specific order, while a combination proof selects a subset of elements without regard to order.

3. What are the steps to perform a permutation proof?

The steps to perform a permutation proof are: 1. Identify the expressions to be proved equivalent. 2. Write out the elements of each expression in a specific order. 3. Show that the elements can be rearranged to form the other expression. 4. Prove that this rearrangement does not change the value of the expressions. 5. Conclude that the expressions are equivalent.

4. What are the common applications of permutation proofs?

Permutation proofs are commonly used in combinatorics, probability, and other areas of mathematics to prove the equivalence of expressions involving permutations.

5. What are some common strategies for solving permutation proofs?

Some common strategies for solving permutation proofs include using the fundamental principle of counting, using factorials to represent the number of permutations, and using algebraic manipulation to rearrange elements. It is important to carefully consider the order and number of elements in each expression when solving a permutation proof.

Similar threads

Replies
9
Views
629
Replies
3
Views
894
Replies
11
Views
740
Replies
7
Views
1K
Replies
8
Views
815
Replies
9
Views
2K
Back
Top