My Math Forum Expressing integers as sum of two squares
 User Name Remember Me? Password

 Algebra Pre-Algebra and Basic Algebra Math Forum

 June 25th, 2015, 05:53 PM #1 Newbie   Joined: Dec 2014 From: Singapore Posts: 23 Thanks: 0 Expressing integers as sum of two squares I've been thinking about this problem for some time and need help with it: Let $n$ be a natural number, and $(a_i, b_i)$ be the solutions to $x^2+y^2=n^2$,$0  June 25th, 2015, 08:30 PM #2 Math Team Joined: Nov 2014 From: Australia Posts: 689 Thanks: 244 Are$a_i$and$b_i$real or natural numbers?  June 26th, 2015, 10:27 PM #3 Newbie Joined: Dec 2014 From: Singapore Posts: 23 Thanks: 0 Natural numbers June 27th, 2015, 04:11 PM #4 Global Moderator Joined: May 2007 Posts: 6,821 Thanks: 722 Quote:  Originally Posted by Chris A I've been thinking about this problem for some time and need help with it: Let$n$be a natural number, and$(a_i, b_i)$be the solutions to$x^2+y^2=n^2$,$0
Integer Lists: Pythagorean Triples

You are looking at Pythagorean triples. The above is a list of them. For most n, k = 0. I didn't scan it thoroughly, but the largest k I saw was 4.

 June 27th, 2015, 07:28 PM #5 Newbie   Joined: Dec 2014 From: Singapore Posts: 23 Thanks: 0 I am looking for the number of Pythagorean triples that have a given hypotenuse. In other words, k is the number of lattice points the equation x^2+y^2=n^2 passes through in the first quadrant above the line x=y. Other points can be deduced by symmetry.
June 28th, 2015, 05:53 AM   #6
Global Moderator

Joined: Nov 2006
From: UTC -5

Posts: 16,046
Thanks: 938

Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms
Quote:
 Originally Posted by Chris A I've been thinking about this problem for some time and need help with it: Let $n$ be a natural number, and $(a_i, b_i)$ be the solutions to $x^2+y^2=n^2$,\$0
Let f(n) be the number of representations of n as a sum of two distinct nonzero squares. Then the question, as I understand it, is: For any integer k >= 0, is there some n such that f(n) = k?

I think that the answer is yes. Certainly f(n) takes on arbitrarily large values, but probably it doesn't leave any gaps. The first values, if I'm not mistaken, are

f(5) = 1
f(65) = 2
f(325) = 3
f(1105) = 4
f(8125) = 5
f(5525) = 6
f(105625) = 7
f(27625) = 8
f(71825) = 9
f(138125) = 10
f(?) = 11
f(160225) = 12
f(1221025) = 13
f(3453125) = 14
f(1795625) = 15
f(801125) = 16

 Tags expressing, integers, squares, sum

Search tags for this page

### expressing integers as sums of distinct square numbers

Click on a term to search for related topics.
 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post ARTjoMS Applied Math 0 May 8th, 2012 03:19 AM eigenein Number Theory 2 April 5th, 2012 12:54 PM MSUmath13 Number Theory 5 April 11th, 2011 09:22 AM nooblet Number Theory 3 March 27th, 2009 06:31 AM zolden Number Theory 0 December 14th, 2008 01:32 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top

Copyright © 2019 My Math Forum. All rights reserved.