Question: Let n > 1 be a positive integer. Prove combinatorially that n = n(n+ 1)2-2. k k=1 [Hint 1: Suppose that out of n
Let n > 1 be a positive integer. Prove combinatorially that n = n(n+ 1)2"-2. k k=1 [Hint 1: Suppose that out of n people, anyone is permitted to register for a race. Everyone who registers may run twice. Gold and Silver medals are to be awarded, and the same person can win both medals. Everyone else gets a participation trophy.] [Hint 2: n(n + 1) = n(n 1) + 2n]
Step by Step Solution
3.43 Rating (159 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
Document Format (2 attachments)
63633a7a729f4_237160.pdf
180 KBs PDF File
63633a7a729f4_237160.docx
120 KBs Word File
