Discrete math Show that for k=2 n(n-1) (n chooses k) 5^k = 25n(n-1)6^(n-2) combinatorically.

Question

Question

Discrete math Show that for k=2 n(n-1) (n chooses k) 5^k = 25n(n-1)6^(n-2) combinatorically.

Discrete math

Show that for k=2 n(n-1) (n chooses k) 5^k = 25n(n-1)6^(n-2) combinatorically.

math Advanced-Math

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

men ner 2 -5 5k=n(n-1) Taking 5= n(n-1) EGM 7 For K=2, n(n-1) sk= 25n(n) (0-2) n! n! -H.S=> niny) 6) K! M-2) 12 n(n-1) (2) an 2 Putting n=2 na2 in both sides Sa So, L.H.Say 25m² (n.12 25(3321213214,3 = 25x2 =50 25 nin- = 251296272 62 25x2 = 50 62 non)

Add a comment

Answer 2

Similar Homework Help Questions

Discrete Math 5. (a). Find a counterexample to show that "n e Z, 12 + 9...

Discrete Math 5. (a). Find a counterexample to show that "n e Z, 12 + 9 + 61 is prime" is false. (b). Determine the truth value of “Vc € R+, In € Zt, 'n <c", and justify your answer.
Discrete Math □ Prove or disprove: If n is any odd integer then (-1)"--1 Problem 6:

Discrete Math □ Prove or disprove: If n is any odd integer then (-1)"--1 Problem 6:
ONLY THE LAST ONE (4) . DISCRETE MATH Problem 1: Show that f(n) = (n +...

ONLY THE LAST ONE (4) . DISCRETE MATH Problem 1: Show that f(n) = (n + 2) log2(n+ 1) + log2 (n3 + 1) is O(n log2 n). Problem 2: Prove that x? + 7x + 2 is 12(x°). Problem 3: Prove that 5x4 + 2x} – 1 is ©(x4). Problem 4: Find all pairs of functions in the following list that are of the same order: n2 + logn, 21 + 31, 100n3 +n2, n2 + 21, n? +...

Discrete math question 2. Consider to the following two algorithms procedure SortA(a1,a2, ..., an: a list...

Discrete math question 2. Consider to the following two algorithms procedure SortA(a1,a2, ..., an: a list of real numbers with n 2 2) 1, for j := 2 to n 2. i:= 1 3. while aj > ai 4. 5. m: 6. or k 0toj -i-1 7. i:-i+1 aj-k:aj-k-1 ai := m
discrete math problem 2) X+1 Show that the function g is one-to- If g:(2,) - (2,)...

discrete math problem 2) X+1 Show that the function g is one-to- If g:(2,) - (2,) is defined by 9(x) = one and onto. X- 2
Discrete Math Use division into two cases to prove that for every integer n, 2\n(3n +...

Discrete Math Use division into two cases to prove that for every integer n, 2\n(3n + 1).

Discrete Math Use mathematical induction to prove that for all positive integers n, 2 + 4...

Discrete Math Use mathematical induction to prove that for all positive integers n, 2 + 4 + ... + (2n) = n(n+1).
Use Discrete Math to solve this question. a) For m, n e N define m nifm...

Use Discrete Math to solve this question. a) For m, n e N define m nifm n is a multiple of 3. Show that - is an equivalence on N
Discrete Math: Divisibility (Need Help ASAP, will upvote) 1) Prove that if n is an odd...

Discrete Math: Divisibility (Need Help ASAP, will upvote) 1) Prove that if n is an odd positive integer, then n^2 is congruent to 1 (mod 8)

Discrete math problems: 9. Show that p = 10. Show that p = q and (...

Discrete math problems: 9. Show that p = 10. Show that p = q and ( q p = n are logically equivalent. ) and q = (p V r) are logically equivalent. r

Discrete math Show that for k=2 n(n-1) (n chooses k) 5^k = 25n(n-1)6^(n-2) combinatorically.

Homework Answers

Add Answer to:
Discrete math Show that for k=2 n(n-1) (n chooses k) 5^k = 25n(n-1)6^(n-2) combinatorically.

Post as a guest

Earn Coins

Discrete Math 5. (a). Find a counterexample to show that "n e Z, 12 + 9...

Discrete Math □ Prove or disprove: If n is any odd integer then (-1)"--1 Problem 6:

ONLY THE LAST ONE (4) . DISCRETE MATH Problem 1: Show that f(n) = (n +...

Discrete math question 2. Consider to the following two algorithms procedure SortA(a1,a2, ..., an: a list...

discrete math problem 2) X+1 Show that the function g is one-to- If g:(2,) - (2,)...

Discrete Math Use division into two cases to prove that for every integer n, 2\n(3n +...

Discrete Math Use mathematical induction to prove that for all positive integers n, 2 + 4...

Use Discrete Math to solve this question. a) For m, n e N define m nifm...

Discrete Math: Divisibility (Need Help ASAP, will upvote) 1) Prove that if n is an odd...

Discrete math problems: 9. Show that p = 10. Show that p = q and (...

Discrete math Show that for k=2 n(n-1) (n chooses k) 5^k = 25n(n-1)6^(n-2) combinatorically.

Homework Answers

Add Answer to: Discrete math Show that for k=2 n(n-1) (n chooses k) 5^k = 25n(n-1)6^(n-2) combinatorically.

Post as a guest

Earn Coins

Add Answer to:
Discrete math Show that for k=2 n(n-1) (n chooses k) 5^k = 25n(n-1)6^(n-2) combinatorically.