Lesson

Using
Pascal's
Triangle

Problem 1

Problem 1
Solution

Problem 2

Problem 2
Solution

Home | Arithmetic Sequences | Pascal's Triangle | Triangular Numbers | Links

Solve a Path Problem
Using Pascal's Triangle

Consider the following diagram:

Start							A
Row 1						B		C
Row 2					D		E		F
Row 3				G		H		I		J

A path is a sequence of letters that leads from A to a letter in a different row. Each step in the path must take you down one row. You cannot move left or right or up.
For example, one path from A to I would be the sequence A - C - E - I.

How many different paths are there from A to H?

Check your answer or try another problem.

Home | Arithmetic Sequences | Pascal's Triangle | Triangular Numbers | Links

---

Close this window to return to the Laney College Math Department Web Site.

---

email the author: Bruce Jacobs
Last modified: Thursday, February 6, 2003