Hello,
I faced this question in a recent MGMAT CAT, and have reviewed the MGMAT solution but am not sure I full understand the logic. Could someone explain the fastest way of doing the problem below? Much appreciated!
A certain square is to be drawn on a coordinate plane. One of the vertices must be on the origin, and the square is to have an area of 100. If all coordinates of the vertices must be integers, how many different ways can this square be drawn?
4
6
8
10
12
I faced this question in a recent MGMAT CAT, and have reviewed the MGMAT solution but am not sure I full understand the logic. Could someone explain the fastest way of doing the problem below? Much appreciated!
A certain square is to be drawn on a coordinate plane. One of the vertices must be on the origin, and the square is to have an area of 100. If all coordinates of the vertices must be integers, how many different ways can this square be drawn?
4
6
8
10
12
