Combinatoric Problem: Path to [20,30]

  • Thread starter Thread starter David Waiter
  • Start date Start date
  • Tags Tags
    Combinations
Click For Summary

Homework Help Overview

The problem involves finding the number of paths on a square grid from the starting point [0,0] to the destination [20,30], while avoiding certain forbidden points: [5,5], [15,10], and [17,23]. The movement is restricted to only upward and rightward directions.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the use of combinatorial methods, specifically the principle of inclusion and exclusion, to account for forbidden points. There are questions about the potential double-counting of paths that intersect multiple forbidden points.

Discussion Status

The discussion is ongoing, with participants clarifying the setup of the problem and addressing potential errors in the original calculations. Some guidance on the principle of inclusion and exclusion has been provided, but there is no explicit consensus on the correct approach yet.

Contextual Notes

There is a noted repetition of the forbidden point [15,10] in the original post, which raises questions about the intended constraints. The discussion also highlights the complexity of applying the principle of inclusion and exclusion correctly in this context.

David Waiter
Messages
2
Reaction score
0
We have a square grid. In how many ways we get to the point [20,30], if we can not get points [5,5], [15,10] [15,10] [17,23]? The starting point is [0,0], we can only move up and to the right. Thanks

My solutions:
$$ \binom{50}{20} - \binom{10}{5}\binom{40}{15} - \binom{25}{10}\binom{25}{10} -\binom{25}{15}\binom{25}{5}-\binom{40}{17}\binom{10}{3}$$
 
Physics news on Phys.org
I moved the thread to the homework forum.

You are subtracting some paths more than once, e. g. every path that passes both through [5,5] and [15,10]. One [15,10] should be [10,15] I guess?
 
Yes, I use the principle of inclusion and exclusion
 
So where do you consider the double-counting I mentioned?
 
David Waiter said:
We have a square grid. In how many ways we get to the point [20,30], if we can not get points [5,5], [15,10] [15,10] [17,23]? The starting point is [0,0], we can only move up and to the right. Thanks

My solutions:
$$ \binom{50}{20} - \binom{10}{5}\binom{40}{15} - \binom{25}{10}\binom{25}{10} -\binom{25}{15}\binom{25}{5}-\binom{40}{17}\binom{10}{3}$$

You have included [15,10] twice in your list of forbidden points. What did you really mean?
 
David Waiter said:
Yes, I use the principle of inclusion and exclusion
The principle of inclusion and exclusion leads to expressions with both plus and minus signs, usually alternating. This is because you subtract out all the cases ruled out by each single criterion, then add back all that you have subtracted twice over because they were ruled out by two criteria, then add back in all that you've added back in too often because they were ruled out by three criteria, and so on.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 33 ·
2
Replies
33
Views
5K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 21 ·
Replies
21
Views
2K
Replies
4
Views
2K
Replies
5
Views
2K