How Many Ways Can a Positive Integer Be Represented as a Sum of Two Squares?

Ryan888
Messages
4
Reaction score
0
Homework Statement :
Recently, a group of fellow math nerds and myself stumbled upon an interesting problem. The problem is stated: "Find the average number of representations of a positive integer as the sum of two squares."

Relevant equations:
N = a^(2) + b^(2), where a and b can be 1 or many corresponding sets. But we are looking for the average number of sets, for all real numbers of N.

The attempt at a solution:

Clearly, I realize a limit will need to be taken, somehow, of all numbers N that can be expressed as the sum of two squares. Naturally, the general equation for N would be N = a^(2) + b^(2). Also, I figured that N must meet the condition that every prime number of the form 4k+3 appears an even number of times in it's prime factorization. I have no idea how to connect these two conditions, or if more must be met. If it's any help, my friend claimed that the answer is π, but had no way to prove it.

Any ideas are greatly appreciated!
 
Physics news on Phys.org
Ryan888 said:
Homework Statement :
Recently, a group of fellow math nerds and myself stumbled upon an interesting problem. The problem is stated: "Find the average number of representations of a positive integer as the sum of two squares."

Relevant equations:
N = a^(2) + b^(2), where a and b can be 1 or many corresponding sets. But we are looking for the average number of sets, for all real numbers of N.

The attempt at a solution:

Clearly, I realize a limit will need to be taken, somehow, of all numbers N that can be expressed as the sum of two squares. Naturally, the general equation for N would be N = a^(2) + b^(2). Also, I figured that N must meet the condition that every prime number of the form 4k+3 appears an even number of times in it's prime factorization. I have no idea how to connect these two conditions, or if more must be met. If it's any help, my friend claimed that the answer is π, but had no way to prove it.

Any ideas are greatly appreciated!
I'm a bit confused by your write-up.

Are you find the average number of such representations over the set of real numbers or over the set of positive integers (the set of natural numbers)? ... or does it not matter?
 
If a and b are real numbers then there are an infinite number of representations. So they must be integers, natural numbers, or counting numbers.

Then if N is a real number it almost never has a representation with whole numbers. So it's got to be a whole number too. But then there is usually no representation. So I don't see how pi can be the answer. It is either infinite or close to zero, I think.
 
SammyS said:
I'm a bit confused by your write-up.

Are you find the average number of such representations over the set of real numbers or over the set of positive integers (the set of natural numbers)? ... or does it not matter?
Unfortunately, that one sentence stating the problem is the only information given. My guess is it probably means the natural numbers.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top