Find the number of ordered non-negative integer pairs n , k such that 5 n + 8 n = k 2 .
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.
You need to exclude the case k − 8 p = 1 , k + 8 p = 5 2 p as well...
Log in to reply
In that case also 2 5 p − 1 must be a power of 2, which is impossible, since 3 is a factor of that number for all natural p.
Log in to reply
Indeed. I did not say that case was hard, just that your proof was missing it!
First of all, k is obviously odd. It is commonly known that the square of an odd number is ALWAYS 1 mod 8. So we get that k^2 ≡ 1 ≡ 5^n +8^n ≡ 5^n mod 8. This means that n is even. Using mod three we have k^2≡(-1)^n+(-1)^n mod 3. Since n is even (-1)^n=1. So k^2≡2 mod 3. Though it is also commonly known that no square is 2 mod 3 so the answer is 0.
Lemma: all odd squares, k 2 , are ≡ 1 m o d 8 Proof: Case 1: k can be expressed in the form 4 j + 1 where j is a non-negative integer. Squaring, we attain ( 4 j + 1 ) 2 = 1 6 j 2 + 8 j + 1 ≡ 1 m o d 8 . Case 2: k can be expressed in the form 4 c + 3 where c is a non-negative integer. Squaring once again yields ( 4 c + 3 ) 2 = 1 6 j 2 + 2 4 j + 9 ≡ 1 m o d 8 . With this lemma, we can now solve the problem. First note, that since 8 n is always even and 5 n is always odd, the LHS is odd so the RHS is odd. Now, since we have that the RHS ≡ 1 m o d 8 , we can take both sides m o d 8 to get that 8 n + 5 n ≡ 5 n ≡ 1 m o d 8 . Let's analyse the first few powers of 5 m o d 8 : 5 0 ≡ 1 m o d 8 ; 5 1 ≡ 5 m o d 8 ; 5 2 ≡ 1 m o d 8 ; 5 3 ≡ 1 m o d 8 . Here we have a repetition, meaning if and only if n is even, 5 n ≡ 1 m o d 8 . Now, we can substitute n = 2 x where x is a non-negative integer, and move the 8 2 x term over to the RHS to yield 5 2 x = k 2 − 8 2 x . This is a difference of two squares, meaning we can factor the RHS to get 5 2 x = ( k − 8 x ) ( k + 8 x ) . Since we have the obvious fact that powers of 5 are only divisible by smaller or equal powers of 5 ( 5 0 = 1 ) , we can let k + 8 x = 5 a and k − 8 x = 5 b . Now we have a system of equations, and adding them together yields 2 k = 5 a + 5 b ; k = 2 5 a + 5 b . Substituting back into the equation, we have 2 5 a + 5 b + 8 x = 5 a . Now, note that 8 x = ( 2 x ) ( 2 x ) ( 2 x ) = ( 2 x ) 3 = 2 3 x . Now, applying this fact, we get 2 5 a + 5 b + 2 3 x = 5 a ; 5 a + 5 b + 2 3 x + 1 = 2 ( 5 a ) ; 2 3 x + 1 = 5 a − 5 b . This is clearly a contradiction, as no power of 2 is divisble by 5 , and we are done.
Problem Loading...
Note Loading...
Set Loading...
The last digit of k 2 can be 0,1,4,5,6 or 9. The last digit of 5 n + 8 n can be 1 or 9 when n is even(otherwise the last digit is 3 or7). So let n = 2 p . Then ( k + 8 p ) ( k − 8 p ) = 5 2 p . Hence 2 ( 8 p ) must be a power of 5, which is impossible.