Let x,y be any positive integers and n,m be any even positive integers:
What is the highest common factor of all values of the expression: ?
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.
The powers of the terms are all even, therefore they are all perfect squares. Thus, we can apply the Cauchy-Schwarz Inequality to it. Furthermore, y m x n = y 1 1 m x 1 1 n = y 1 1 1 m x 1 1 1 n , thereby satisfying the condition for equality to hold for the inequality.
Thus, the expression is equal to: ( x n y m + x 1 1 n y 1 1 m + x 1 1 1 n y 1 1 1 m ) 2 = ( x n y m + ( x n y m ) 1 1 + ( x n y m ) 1 1 1 ) 2 .
Let o be an odd positive integer and p a positive integer. Notice that p o ≡ p m o d 3 for all p (work through the cases, there's only 3). Thus x n y m ≡ ( x n y m ) 1 1 ≡ ( x n y m ) 1 1 1 m o d 3 .
Therefore, x n y m + ( x n y m ) 1 1 + ( x n y m ) 1 1 1 ≡ 0 m o d 3 , which implies ( x n y m + ( x n y m ) 1 1 + ( x n y m ) 1 1 1 ) 2 ≡ 0 m o d 9 . Thus, 9 is a factor of all expressions of this form.
The task left is to prove that it is indeed the highest common factor. It is sufficient to provide a case that has 9 as its largest factor. This case is when x = y = 1 and the expression equals 9.
Thus, 9 is indeed the highest common factor