+0  
 
0
71
2
avatar+92 

Compute the number of distinct paths not passing through point (2,2,2) that travel from point (0,0,0) to (4,4,4) in 12 steps, increasing a coordinate by 1 at each step.

 Mar 6, 2021
 #1
avatar
-1

By complementary counting, there are 12!/(4!*4!*4!) - 6!/(2!*2!*2!) = 34560 possible paths.

 Mar 7, 2021
 #2
avatar+291 
0

Guest was right for the first part, but the number of ways to pass through the point (2, 2, 2) is not \(\frac{6!}{2!2!2!}\), it's \((\frac{6!}{2!2!2!})^2 = 8100\), so the answer is \(\boxed{26550}\)

 Mar 7, 2021

69 Online Users

avatar
avatar
avatar
avatar
avatar