I certainly have a deeper understanding now of what numbers can be expressed as a sum of two squares and in how many ways. See my earlier posts:
- Sums of Square Revisited
- Fundamental Theorem on Sums of Two Squares
- Numbers that are Sums of Two Squares
- Sums of Squares
- Finding Significance in Insignificant Numbers
- Sum of Two Squares
- Sum of Squares of Integers and Catalan Numbers
There's certainly some overlap in these posts but mostly they've dealt with numbers of the form rather than where and are integers. It's the latter type of expression that I want to explore in this post. My interest was stimulated by today's diurnal age number, 25229, that happens to be a 4k+1 prime.
As a 4k+1 prime, it can be expressed as a sum of two squares in one way only, viz. . However, it turns out that it can be expressed a sum of two squares multiplied by varying coefficients in many different ways. I created some Sage code to investigate:
number=25229 #enter any numberRunning this code on the SageMathCell Server generated the following results for a <100 and b < 100. The first number represents a, the second b, the third x and the fourth y. For example, the first entry (1, 4, 125, 49) represents
x,y = var('x'),var('y')
a,b = var('a'), var('b')
for a in range(100):
for b in range(100):
for x in range(sqrt(number)):
for y in range(sqrt(number)):
if a * x^2 + b * y^2 == number:
if a < b:
print(a, b, x, y)
(1, 4, 125, 49)It would be interesting to see the full range of possibilities for a, b, x and y. However, for larger values of a and b, the SageMathCell Server seems to time out. It is easy to see how the case of (1, 4, 125, 49) comes about because:
(1, 5, 27, 70)
(1, 7, 41, 58)
(1, 13, 101, 34)
(1, 20, 27, 35)
(1, 25, 98, 25)
(1, 28, 41, 29)
(1, 29, 75, 26)
(1, 49, 125, 14)
(1, 52, 101, 17)
(1, 65, 42, 19)
(1, 85, 152, 5)
(1, 91, 127, 10)
(1, 97, 94, 13)
(2, 3, 61, 77)
(2, 11, 105, 17)
(2, 21, 110, 7)
(2, 51, 37, 21)
(3, 26, 9, 31)
(4, 25, 49, 25)
(4, 65, 21, 19)
(4, 85, 76, 5)
(4, 97, 47, 13)
(5, 6, 71, 2)
(5, 9, 70, 9)
(5, 19, 11, 36)
(5, 24, 71, 1)
(5, 46, 61, 12)
(5, 59, 45, 16)
(5, 69, 8, 19)
(5, 76, 11, 18)
(5, 81, 70, 3)
(5, 89, 69, 4)
(6, 53, 56, 11)
(7, 22, 31, 29)
(7, 29, 60, 1)
(7, 46, 53, 11)
(8, 21, 55, 7)
(9, 20, 9, 35)
(9, 29, 25, 26)
(9, 65, 14, 19)
(11, 18, 17, 35)
(11, 50, 17, 21)
(11, 98, 17, 15)
(13, 29, 36, 17)
It's probably better to start investigating with a smaller 4k+1 prime such as 61. Now
It can be noted that 4k+3 primes such as 43, while not able to be represented as a sum of two squares, can be represented as a sum of squares with coefficients:
This result means that it is necessary to exclude 1 from our investigation and begin with
Thus
- a perfect square e.g.
- a multiple of a perfect square e.g.
- a sum of two different squares e.g.
- a sum of the multiples of two squares e.g.
.
No comments:
Post a Comment