UR grid

In how many ways you can go from the point ( 0 , 0 ) (0,0) to the point ( 3 , 3 ) (3,3) ,only going u p up and r i g h t right , at most passing through one red dot .

16 16 2 2 8 8 20 20 12 12

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

I will solve using "The complementary method",

The number of all ways to go from ( 0 , 0 ) (0,0) to ( 3 , 3 ) (3,3) is ( 6 3 ) = 20 \binom{6}{3}=20 ,

We have to subtract the ways that passes throught the two red dots , using " Multiplication principle " :

The number of ways from ( 0 , 0 ) (0,0) to ( 1 , 1 ) (1,1) multipied by the number of ways from ( 1 , 1 ) (1,1) to ( 2 , 2 ) (2,2) multipied by the number of the ways from ( 2 , 2 ) (2,2) to ( 3 , 3 ) (3,3) , the result is ( 2 1 ) ( 2 1 ) ( 2 1 ) = 8 \binom{2}{1}\binom{2}{1}\binom{2}{1}= 8

So we get that the answer is 20 8 = 12 20-8=12

Geoff Pilling
Dec 16, 2018

Alternatively, there are four ways to pass through only the first red dot, four ways to pass through only the second red dot, and four ways to pass through no red dots.

4 + 4 + 4 = 12 4+4+4=12

Yes dear it is right , but imagine that you have 10 × 10 10×10 grid , you can't calculate them like 4 + 4 + 4 = 12 4+4+4=12

ابراهيم فقرا - 2 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...