SOLUTION: prove that p(n,n)= 2p(n,n-2)

SOLUTION: prove that p(n,n)= 2p(n,n-2)

Algebra.Com

Question 1084448: prove that p(n,n)= 2p(n,n-2)
Answer by Edwin McCravy(20054) (Show Source): You can put this solution on YOUR website!



Therefore:












So they are equal.

Edwin

RELATED QUESTIONS
prove that P(n,n) = 2P(n,n � 2) and prove that C(2n,2) = 2C(n,2) + n^2 . (answered by robertb)

prove that : n! (n+2) = n! +... (answered by tommyt3rd)

prove that: 1+2+3+....+n =... (answered by ikleyn)

prove that... (answered by robertb)

Prove that (n+1)! >2 n for all n>1. (answered by rothauserc)

I have the following problem: Let P(n, k) denote the number of permutations of k objects (answered by stanbon)

prove that a/p + a + ap + ... + ap^n =... (answered by Fombitz)

Use induction to prove that... (answered by richard1234)

1.Prove that 3^n=Summation(r=0,n)2^rC(n,r) 2. Evaluate... (answered by Edwin McCravy)