All powers of 5 can be written as the sum of two square numbers in different ways. Investigate the number of points with integer coordinates on circles with centres at the origin for which the square of the radius is a power of 5. For the two circles shown in red in the diagram the radius is a power of 5 and for the circles shown in black this is not so but the square of the radius is a power of 5.

Thanks to Rusi Kolev for the following solution.

To find all the points which lie on the circle k(0;r) and O(0;0) we have to use the circle equation .
If we find such real numbers x and y then the point with coordinates (x,y) lies on the cirlce.

It is given that , n is a positive integer and Then we have the equation and x and y are positive integers (belong to N).
To find all the x and y which satisfy the equation we have to try all the y's up to .

As and are positive numbers then x and y are positive or negative. Then we can find all the positive x and y and make up combinations. For example if then all the solutions are:
.

Here are all the positive solutions for n up to 12:

What we notice is when n = 0 or 1 we have only one solution (by one solution I mean one pair of POSITIVE integers that satisfy the equation.

We can always make all the solutions by using the combinations explained above! .

When n = 2 or 3 we have 2 solutions ... so we know that for a given integer n the number of solutions is:1.

If n is even The number of positive solutions is "n + 2".

If n is odd The number of positive solutions is "n + 1".

But why is this so ??? Why do the solutions always increase with 1?

Let`s take n = 2k (even):

n=2
We notice the solutions: 0X5^1; 5^1 & 3X5^0; 4X5^0; & 4X5^0; 3X5^0 & 5^1;0X5^1

n=4
0X5^2; 5^2 & 3X5^1; 4X5^1; & 7X5^0; 24X5^0 & 24X5^0; 7X5^0 & 4X5^1; 3X5^1 & 5^2; 0X5^2

n=6
0X5^3; 5^3 & 3X5^2; 4X5^2; & 7X5^1; 24X5^1 & 44X5^0;117X5^0; 117X5^0; 44X5^0 &24X5^1; 7X5^1 & 4X5^2; 3X5^2 & 5^3; 0X5^3
Every next even n has all the previous solutions but raised to the +1 power plus TWO NEW solutions.

Now let`s take n = 2k + 1(odd):

n=3, (k=1).
We notice thesolutions: 2X5^0;11X5^0 & 5X5^0;10X5^0 & 10X5^0; 5X5^0 & 11X5^0; 2X5^0

n=5 (k=2)
2X5^1;11X5^1 & 5X5^1;10X5^1 & 38X5^0; 41X5^0 & 41X5^0; 38X5^0 & 10X5^1; 5X5^1 & 11X5^1; 2X5^1

n=7 (k=3)
2X5^2;11X5^2 & 5X5^2;10X5^2 & 38X5^1; 41X5^1 & 29X5^0; 278X5^0 &278X5^0; 29X5^0; & 41X5^1; 38X5^1 & 10X5^2; 5X5^2 &11X5^2; 2X5^2

Every next odd n has all the previous solutions but raised to the +1 power plus TWO NEW solutions.

As n approaches infinity the solutions will become more and more ...

Until now we have only discussed the positive integers. If we are to make all the solutions we will use the example above:if then all the solutions are: So if we have one solution we can make four (positive and negative) so we have to multiply by 4. Taking the formulae above:
If n is even The number of solutions "n + 2" becomes "4(n + 2)"
If n is odd The number of solutions "n + 1" becomes "4(n + 1)"

But these formulae are also not correct because if we have root 0 then there isn`t +0 and -0. We have root 0 only when n=2k; k=1,2,3....
We have 4n + 8 solutions if we count +0 and -0. But becausethere is no difference between +0 and -0 we deduct 2 solutions for every zero root,
Solutions are: 4n + 8 - 4= 4n + 4 = 4(n + 1). And that`s the number of solutions for an odd n.