To compute n k by generating Pascals triangle, it is not necessary to generate the
Chapter 17, Problem 17.36(choose chapter or problem)
To compute n k by generating Pascals triangle, it is not necessary to generate the entire triangle down to row n; you need only the part of the triangle in a 90 wedge above n k . Estimate how many addition problems you would need to perform to calculate 100 30 by this method. How many addition problems would you need to perform if you were to compute the entire Pascals triangle down to row 30?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer