Lord Bendtner combinatorics

Discrete Mathematics Level pending

Lord Bendtner was transported to a magical grid universe, where everything is on a x,y,z grid, to point 0,0,0. Each minute that passes, Lord bendtner is forced to move 1 unit a positive direction, (so he cannot go from 0,0,1 to 0,0,0). So for example, after 1 minute lord bendtner can end up at (1,0,0) (0,1,0) or (0,0,1). After 2 minutes he can be at (2,0,0) (0,2,0) (0,0,2) (1,1,0) (1,0,1) or (0,1,1). In how many ways possible is it to arrive at point (3,5,2)?????

×

Problem Loading...

Note Loading...

Set Loading...