What is the smallest member of the set of pairs of non-negative integers which when the integers are squared and then the two squares are summed equals ?
As the question is not the clearest exposition, here is a small example of the desired process:
If the target value were 100 instead, then the set of pairs of non-negative integers would be , reading the pairs row-wise in the matrix and the matrix as a whole being the set of pairs. The desired answer is the smallest integer in the matrix, which in this case is .
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.
Done as a computer search, the answer is as given: 3777.
n = 9 8 7 6 5 4 3 2 1 0 ; l = ⌊ n ⌋ ; min ( Flatten [ Union [ Table [ If [ n − i 2 ∈ Z , Sort [ { n − i 2 , i } ] , Nothing ] , { i , 0 , l } ] ] ] ) ⇒ 3 7 7 7
The matrix of pairs: ⎝ ⎜ ⎜ ⎜ ⎜ ⎜ ⎜ ⎛ 3 7 7 7 1 8 9 2 1 2 9 2 1 7 4 3 4 0 1 5 8 4 6 1 6 2 6 0 7 9 9 3 0 9 9 7 5 6 3 9 4 9 8 9 8 9 4 0 3 8 0 3 6 7 7 7 1 8 1 ⎠ ⎟ ⎟ ⎟ ⎟ ⎟ ⎟ ⎞
If one does the search starting from 0 , then the first pair found would be the pair with the desired answer.