Find the number of positive integers n such that n 4 + 6 n 3 + 1 3 n 2 + 1 2 n + 7 is the square of an integer.
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.
Nice observation!
@Jon Haussmann : What motivates this "completing the square"
Log in to reply
Because we want to find when the expression is a square...
A perfect square gives a remainder of 0 or 1 when divided by 4 .
By Quotient Remainder Theorem
If n ≡ 0 ( m o d 4 ) , n 4 + 6 n 3 + 1 3 n 2 + 1 2 n + 7 ≡ 3 ( m o d 4 ) , which is not allowed
If n ≡ 1 ( m o d 4 ) , n 4 + 6 n 3 + 1 3 n 2 + 1 2 n + 7 ≡ 3 ( m o d 4 ) , which is not allowed
If n ≡ 2 ( m o d 4 ) , n 4 + 6 n 3 + 1 3 n 2 + 1 2 n + 7 ≡ 3 ( m o d 4 ) , which is not allowed
If n ≡ 3 ( m o d 4 ) , n 4 + 6 n 3 + 1 3 n 2 + 1 2 n + 7 ≡ 3 ( m o d 4 ) , which is not allowed
Since we have exhausted all cases, there is no n such that n 4 + 6 n 3 + 1 3 n 2 + 1 2 n + 7 is a perfect square.
nice solution
Nice! My intended solution was to note that the given expression equals some square plus 3 .
Problem Loading...
Note Loading...
Set Loading...
We can write n 4 + 6 n 3 + 1 3 n 2 + 1 2 n + 7 = ( n 2 + 3 n + 2 ) 2 + 3 . The only squares that differ by 3 are 1 and 4, and these are easy to rule out. Therefore, there are no such positive integers n .