Respuesta :
The paths that will stay outside or on the boundary of the square-2≤ x≤2, -2≤y ≤2 at each step will be 1698
We'll make advantage of the complementary counting idea. If you enter the square, you must exit by the boundaries and by the designated points because otherwise, you would touch another point in one of the sets of points in the connection (Call it S). Since y=x is symmetric, we simply need to take into account (1,-1), (1,0), and (1,1). We can only investigate one scenario and multiply it by two since (1,1) can cross the barrier in two different ways. We may just multiply (1,0) by two and (1,-1) by two. Therefore, we count the routes from (-4,4) to each of these sites and multiply that number by the total number of routes from the starting position.
[tex](\left {{16} \atop {8}} \right.) -2[(\left {{8} \atop {3}} \right.) (\left {{7} \atop {2}} \right.) +(\left {{9} \atop {4}} \right.) (\left {{6} \atop {2}} \right.) +(\left {{10} \atop {5}} \right.) (\left {{5} \atop {2}} \right.)] =1698[/tex]
Learn more about the boundary of the square here: https://brainly.com/question/23277151
#SPJ4
Your question is incomplete, but most probably, the full question was:
A 16-step path is to go from (-4,-4) to (4,4) with each step increasing either the x-coordinate or the y-coordinate by 1. How many such paths stay outside or on the boundary of the square -2≤ x≤2, -2≤y ≤2 at each step?
A.92
B.144
C.1568
D.1698
E.12800
