a) How many grid paths from (0,0) to (6,6) are there?
b)
c) How many go through one of the points (1,1) or (2,2) or (3,3)?
I need answer for C) please.
I'm trying to use the A + B + C - AnB - AnC - BnC
+ AnBnC rule (Principle of Inclusion/Exclusion) for this problem
but I found out that AnC(from 1,1 to 3,3 ) is just equal to
AnBnC(from 1,1 to 2,2 to 3,3) because for grid path it can only
move up or right. Am I wrong?
What should I do then? Can I still use this Principle of Inclusion/Exclusion?
please let me know if you find any difficulty with the solution by leaving a comment
Get Answers For Free
Most questions answered within 1 hours.