A circle with radius is drawn at on a Cartesian plane with the origin as its centre.
How many lattice points (coordinate with integer coordinates) does it pass?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We need to factorize 4 4 1 0 0 0 = 2 3 × 3 2 × 5 3 × 7 2 over the Gaussian integers Z [ i ] . Now 3 , 7 are both irreducible in the Gaussian integers, while 2 = ( 1 + i ) ( 1 − i ) and 5 = ( 2 + i ) ( 2 − i ) . The units of Z [ i ] are 1 , − 1 , i , − i , and we note that 1 + i and 1 − i are associate to each other (one is the other times a unit). Since we want to factorize 4 4 1 0 0 0 = x 2 + y 2 = ( x + i y ) ( x − i y ) , we must have x + i y = u ( 1 + i ) 3 × 3 × ( 2 + i ) a ( 2 − i ) 3 − a × 7 for some unit u and some 0 ≤ i ≤ 3 . This gives us 4 essentially different solutions for integer coordinates ( x , y ) such that x 2 + y 2 = 4 4 1 0 0 0 (one for each value of a ). For each such solution ( x , y ) , there are four variations of that set of numbers, namely ( x , y ) , ( − y , x ) , ( − x , − y ) and ( y , − x ) - corresponding to the four possible choices of unit. Thus there are 4 × 4 = 1 6 points with integer coordinates on this circle.