k = ( n + 2 2 3 ) ( n + 5 2 1 )
Given that n and k are both positive integer, find the value of n .
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.
Note: You should mention that 149 is a prime.
Log in to reply
Added. Thanks for pointing that. This makes the explanation clearer.
Note: we can easily reject n + 3 7 2 + k = 1 4 9 , since if so, then n + 3 7 2 − k = 1 4 9 ; but it's impossible, since ( n , k ) > 0 . Second, if n + 3 7 2 + k = 1 4 9 , then we can clearly see that n or k is negative. So, the possible equations are n + 3 7 2 + k = 2 2 2 0 1 and n + 3 7 2 − k = 1 .
Squaring both sides, k^2 = n^2 + 744n + 116183 = n^2 + 744n + 138384 - 22201, or transposing, k^2 + 149^2 = (n + 372)^2. This is a Pythagorean Triplet, so there exists integers a and b such that: (1) n + 372 = a^2 + b^2, (2) 149 = a^2 - b^2, k = 2ab. Since 149 is prime, a - b = 1, a + b = 149. Then a = 75, b = 74. Then n + 372 = 75^2 + 74^2 = 11101, so n = 11101 - 372 = 10729. Ed Gray
Problem Loading...
Note Loading...
Set Loading...
Since ( n + 2 2 3 ) ( n + 5 2 1 ) = k 2 , after completing the square of the left-hand side, we have ( n + 3 7 2 ) 2 − 2 2 2 0 1 = k 2 . Now ( n + 3 7 2 ) 2 − k 2 = ( n + 3 7 2 + k ) ( n + 3 7 2 − k ) = 2 2 2 0 1 = 1 4 9 2 . As 149 is a prime number, n and k are positive integers, n + 3 7 2 + k = 2 2 2 0 1 and n + 3 7 2 − k = 1 . Solve the equations, we obtain n + 3 7 2 = 1 1 1 0 1 which means n = 1 0 7 2 9 .