Register

Kenneth Rosen Edition 7 Exercise 6.4 Question 13 (Page No. 421)

548 views

1 Answer

0 votes
0 votes
C(9,0)=9!/9!0!=1

C(9,1)=9!/1!8!=9

C(9,2)=9!/2!7!=36

C(9,3)=9!/3!6!=84

C(9,4)=9!/4!5!=126

C(9,5)=9!/4!5!=126

C(9,6)=9!/3!6!=84

C(9,7)=9!/2!7!=36

C(9,8)=9!/1!8!=9

C(9,9)=9!/9!0!=1

 PASCAL TRIANGLE ROW

1,9,36,84,126,126,84,36,9,1
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
admin asked Apr 30, 2020
509 views
Kenneth Rosen Edition 7 Exercise 6.4 Question 20 (Page No. 421)
Suppose that $k$ and $n$ are integers with $1 \leq k<n.$ Prove the hexagon identity $\binom{n-1}{k-1}\binom{n}{k+1}\binom{n+1}{k} = \binom{n-1}{k}\binom{n}{k-1}\binom{n+1}{k+1},$ which relates terms in Pascal’s triangle that form a hexagon.
Suppose that $k$ and $n$ are integers with $1 \leq k<n.$ Prove the hexagon identity $\binom{n-1}{k-1}\binom{n}{k+1}\binom{n+1}{k} = \binom{n-1}{k}\binom{n}{k-1}\binom{n+1...
User Avatar
1 votes
1 votes
0 answers
2
admin asked Apr 30, 2020
257 views
Kenneth Rosen Edition 7 Exercise 6.4 Question 19 (Page No. 421)
Prove Pascal’s identity, using the formula for $\binom{n}{r}.$
Prove Pascal’s identity, using the formula for $\binom{n}{r}.$
User Avatar
0 votes
0 votes
1 answer
3
admin asked Apr 30, 2020
832 views
Kenneth Rosen Edition 7 Exercise 6.4 Question 18 (Page No. 421)
Suppose that $b$ is an integer with $b \geq 7.$ Use the binomial theorem and the appropriate row of Pascal’s triangle to find the base-$b$ expansion of $(11)^{4}_{b}$ [that is, the fourth power of the number $(11)_{b}$ in base-$b$ notation].
Suppose that $b$ is an integer with $b \geq 7.$ Use the binomial theorem and the appropriate row of Pascal’s triangle to find the base-$b$ expansion of $(11)^{4}_{b}$ [...
User Avatar
1 votes
1 votes
0 answers
4
admin asked Apr 30, 2020
278 views
Kenneth Rosen Edition 7 Exercise 6.4 Question 17 (Page No. 421)
Show that if $n$ and $k$ are integers with $1 \leq k \leq n,$ then $\binom{n}{k} \leq \frac{n^{k}}{2^{k−1}}.$
Show that if $n$ and $k$ are integers with $1 \leq k \leq n,$ then $\binom{n}{k} \leq \frac{n^{k}}{2^{k−1}}.$
User Avatar
Link Copied!