Draw some isosceles triangles with an area of $9$cm$^2$ and a vertex at (20,20). If all the vertices must have whole number coordinates, how many is it possible to draw?
Can you find a reliable strategy for choosing coordinates that will locate the robber in the minimum number of guesses?
On the graph there are 28 marked points. These points all mark the
vertices (corners) of eight hidden squares. Can you find the eight
Can you locate the lost giraffe? Input coordinates to help you
search and find the giraffe in the fewest guesses.
The triangle OMN has vertices on the axes with whole number co-ordinates. How many points with whole number coordinates are there on the hypotenuse MN?
Can you describe this route to infinity? Where will the arrows take you next?