Hello, I am trying to solve out this problem. I have a square net and I need to get from the point (0,0) to (15,20), but I can only go up or to the right, and I mustn´t go through (5,6), (10,9), (7,13) a (12,15). I think I might start with counting all the possibilities (35 over 15?) but I have no idea, how to continue. Thank you very much.
Inclusion-exclusion principle
- Thread starter milankuch
- Start date
I'm not understanding. Do you only need one way or do you need to know all ways? If you only need one way then (0,0) -> (14,0) -> (14,20) -> (15,20) is one of many.
pka
Elite Member
- Joined
- Jan 29, 2005
- Messages
- 11,971
milankuch needs to know the total number of trails from (0,0) to (15,20) which pass through none of the points (5,6), (10,9), (7,13) or (12,15).