Determine if there are additional paths between the START (number 1 at the top) and end point (leftmost 3). If so, describe them in words, by tracing the path on the triangle, and as binary strings. Then record all such binary strings at the ending location.
Find and record at least 5 paths using binary strings between the START location and numbers in rows 4 and 5. Compare the binary strings for each number and discuss why those similarities and differences might exist. Also, explain any connections you notice between the number of possible paths ending at each location and the corresponding entry of Pascal’s Triangle.
Discuss what information about an endpoint and the paths leading to it can be gathered from the length of its binary strings and the number of 1s in them.
Explain the addition rule of Pascal’s Triangle in your own words in terms of the path coding scheme you worked with in this assignment.
