Given the diagram below, determine the number of pathways starting from A and moving to B along the gridlines if a pathway must pass through C and must always move closer to B without backtracking.
Added by Melissa P.
Close
Step 1
Since we can only move closer to B without backtracking, there is only one possible pathway from A to C: A -> C. Show more…
Show all steps
Your feedback will help us improve your experience
Nick Johnson and 83 other Intro Stats / AP Statistics educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Supreeta N.
Consider the Cartesian (x-y) grid. If you can only move right and up, how many paths are there: From A(0, 0) to C(9, 10) if you must pass through D(5, 4) and E(7, 8)?
Jacob F.
Consider the grid of points shown below. Suppose that starting at the point labeled $A$ you can go one step up or one step to the right at each move. This is continued until the point labeled $B$ is reached. How many different paths from $A$ to $B$ are possible? HINT: Note that to reach $B$ from $A$ you must take 4 steps to the right and 3 steps upward.
Combinatorial Analysis
Problems
Recommended Textbooks
Elementary Statistics a Step by Step Approach
The Practice of Statistics for AP
Introductory Statistics
Watch the video solution with this free unlock.
EMAIL
PASSWORD