A discrete mathematics problem by Felipe Sadoyama

Discrete Mathematics Level pending

Jonh has to go from point A to point B. How many possible ways he could get to point B knowing that he can only go right and up?

Note: he can only move through the back lines.

Note²: Every square counts as 1 move

×

Problem Loading...

Note Loading...

Set Loading...