 # Let ABCD be a rectangle with dimensions AB=20 and BC=12 and r be a positive integer.The rectangle is divided into a grid of 20*12 unit squares.The following moves are permitted on the board:one can move from one square to another if the distance between the centers of the two squares is vr.The task is to find a sequence of moves leading with the square with A as a vertex to square with B as a vertex. a.Prove that the task can not be done if r is divisible by 2 or 3 b.Prove that the task is possible when r=73 c.Is the task possible when r=97?

10 years ago

you mentioned the distance between the centres of squares to be vr...what is v

Please mention it....is it an integer,rational or real..???

Regards.

10 years ago

Actually that is not v,that is square root. The distance has to be square root of r.

10 years ago

I am sorry.That lloks like v,but that is actually square root symbol.The distance is root over r. ADHIRAJ MANDAL

10 years ago

I am sorry.That lloks like v,but that is actually square root symbol.