statement
we r given a +ve integer r and a rectangular board ABCD wid dimensions AB=20
BC=12 the rectangle is divided into a grid of 20*12 unit squares .the following moves r permitted on d board :
one can move from one square to other only if the distances between the center of d two square is
[ ]
r .the task is to find the a sequence of moves leading from d square from d diagonal A as vertex to the square wid B as vertex, then
q1 discuss the task if r is divisible by 2 or 3
a always possible
b never possile
c sometimes possible
d none of these
q2 task is possible if
a r=72
b r=73
c r=74
d r=75
q3 is there a sol. when r=97
a yes
b no
c cant be discussed
d sometimes exists