Math: minimum sum of squares
Tutoring math, you encounter patterns. The tutor brings up one about sums of squares.
If two whole numbers sum to a constant even one, then their minimum sum of squares will come from each being half. The reason:
Let the numbers sum to 2n, and let the numbers then be n-k and n+k. Then the sum of their squares is
(n-k)2 + (n+k)2
Expanding each square, we get
n2-2nk+k2 + n2+2nk+k2=2n2+2k2
Therefore, the minimum sum of squares will be achieved when k=0, that is, when n-k=n+k=n.
Source:
Travers, Kenneth J et al. Using Advanced Algebra. Toronto: Doubleday Canada Limited, 1977.
Jack of Oracle Tutoring by Jack and Diane, Campbell River, BC.
Leave a Reply
You must be logged in to post a comment.