Ask your own question, for FREE!
Mathematics 11 Online
OpenStudy (shubhamsrg):

A man standing at a point P on a flat plane starts walking. At each step, he walks exactly 1 foot in one of the directions N,S,E or W. Suppose that after 6 steps he comes back to P, then no. of distinct paths he can take is ? a) 196 b)256 c)344 d)400

OpenStudy (shubhamsrg):

I have attempted this and am getting 384 as the answer. But 384 is not even in the options -_- I'll post my attempt below

OpenStudy (shubhamsrg):

lets divide 6 steps into 2 cases first 3 and last 3 for him to be back at original pos there should be 3 counter steps E and W are counter N and S are counter for 1st 3 steps he has 4 options of each step so 4*4*4 =64 now for last 3 steps, we need 3 counter steps .. the 3 counter steps can be at any position.. so 3! i.e. 6 final ans acc to me should have been 64*6 = 384 but thats wrong where am I going wrong ?

ganeshie8 (ganeshie8):

u have 288 in options ?

OpenStudy (shubhamsrg):

I have posted the options no, 288 is not there @ganeshie8

OpenStudy (experimentx):

woops!! i counted double ... 400

OpenStudy (shubhamsrg):

please explain your logic sir :O yes 400 is the right ans

OpenStudy (experimentx):

just consider the position of third step.

OpenStudy (experimentx):

|dw:1367690410952:dw| x is where your possible third step is

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!