Given that $^nC_3 -$$^nC_2 = 14$, find $n$. There's a method using the Pascal's Triangle, where the $k^{th}$ entry in the $n^{th}$ row is equal to $^nC_k$. Is there another way to solve this?
Asked
Active
Viewed 28 times
1 Answers
1
HINT: if i understand right is this $$\frac{n(n-1)(n-2)}{6}-\frac{n(n-1)}{2}=14$$
Dr. Sonnhard Graubner
- 95,283
-
Yes, but this would lead to solving a third degree polynomial equation. The Pascal's triangle method is still easier. Looking for a method that is faster than the Pascal's triangle one. – user3294195 Oct 17 '15 at 15:29