Respuesta :
Step-by-step explanation:
We have,
[tex]\displaystyle\sf{\,^{n}C_{n-1}+\,^{n}C_{n-2}}[/tex]
[tex]\displaystyle\sf{=\dfrac{n!}{(n-1)!(n-(n-1))!}+\dfrac{n!}{(n-2)!(n-(n-2))!}}[/tex]
[tex]\displaystyle\sf{=\dfrac{n!}{(n-1)!(n-n+1)!}+\dfrac{n!}{(n-2)!(n-n+2)!}}[/tex]
[tex]\displaystyle\sf{=\dfrac{n!}{(n-1)!(1)!}+\dfrac{n!}{(n-2)!(2)!}}[/tex]
[tex]\displaystyle\sf{=\dfrac{n(n-1)!}{(n-1)!(1)!}+\dfrac{n(n-1)(n-2)!}{(n-2)!(2)!}}[/tex]
[tex]\displaystyle\sf{=\dfrac{n}{1}+\dfrac{n(n-1)}{2}}[/tex]
[tex]\displaystyle\sf{=n+\dfrac{n^2-n}{2}}[/tex]
[tex]\displaystyle\sf{=\dfrac{2n+n^2-n}{2}}[/tex]
[tex]\displaystyle\sf{=\dfrac{n^2+n}{2}}[/tex]
[tex]\displaystyle\sf{=\dfrac{n(n+1)}{2}}[/tex]
Using the combination formula, it is found that the value of the expression is given by:
(b) n(n + 1)/2
What is the combination formula?
[tex]C_{n,x}[/tex] is the number of different combinations of x objects from a set of n elements, given by:
[tex]C_{n,x} = \frac{n!}{x!(n-x)!}[/tex]
In this problem:
[tex]C_{n, n-1} = \frac{n!}{(n-1)!(n - n + 1)!} = \frac{n(n-1)!}{(n-1)!} = n[/tex]
[tex]C_{n, n-2} = \frac{n!}{(n-2)!(n - n + 2)!} = \frac{n(n-1)(n-2)!}{(n-2)!2!} = \frac{n(n-1)}{2}[/tex]
Then, adding these values:
[tex]n + \frac{n(n-1)}{2} = \frac{2n + n^2 - n}{2} = \frac{n(n + 1)}{2}[/tex]
Hence option b is correct.
More can be learned about the combination formula at https://brainly.com/question/25821700