Find the sum of values of a for which ( x + 1 9 9 1 ) ( x + a ) + 1 is a perfect square for every integer x .
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.
This solution makes the unstated (and unproven) assumption that " f ( n ) = n 2 + A n + B is a perfect square for all integers n implies that f ( x ) is a perfect square polynomial". This is a crucial part of the proof that most people miss out on.
Currently, all that we have is that the function attains the values of perfect squares at some points, which doesn't imply that we must have a perfect square polynomial. Let me address this gap:
Proof: If A = 2 k is even, then with x = − k , B − k 2 is a perfect square. With x = − ( k + 1 ) , B − k 2 + 1 is a pefect square. However, the only perfect square that differ by 1 are 0 and 1, thus B − k 2 = 0 , or that B = k 2 .
If A = 2 k + 1 is odd, then with x = − k , B − k 2 − k is a perfect square. With x = − k + 1 , B − k 2 − k − 2 is a perfect square. However, there are no perfect square that differ by 2.
Note: The more general case is dealt with in the comments.
Can anyone justify why a polynomial which is a perfect square at every integer value must be a perfect square polynomial?
That is, can somebody prove the following:
'If P ( x ) ∈ Z [ x ] is such that, ∀ x ∈ Z , P ( x ) = n 2 for some n ∈ Z then it must be that P ( x ) = ( Q ( x ) ) 2 for some Q ( x ) ∈ Z [ x ] '
thanks
Log in to reply
That's a great question to ask. It follows directly from Hilbert's irreducibility theorem , but that's somewhat higher power than is necessary.
We can simplify the proof as follows:
Step 1
Show that if
f
(
x
)
∈
Z
[
x
]
is a non-constant polynomial, then there are infinitely many primes which divide some value of
f
(
n
)
for integers
n
. The proof is similar to the existence of infinitely many primes, and we consider
f
(
f
0
∏
p
i
)
Step 2
Suppose that
f
=
g
2
h
where
h
is a squarefree non-constant polynomial. Take a prime
p
that doesn't divide the
Resultant
R
(
h
,
h
′
)
, but divides
h
(
n
)
for some
n
. Then, since
f
(
n
)
is a square, we have
p
2
∣
h
(
n
)
. Furthermore,
p
∣
h
(
n
+
p
)
and thus
p
2
∣
h
(
n
+
p
)
. Since we know that
h
(
n
+
p
)
≡
h
(
n
)
+
p
h
′
(
n
)
m
o
d
p
2
, this implies that
p
∣
h
′
(
n
)
and thus
p
∣
R
(
h
,
h
′
)
which is the contradiction. Thus,
h
is a constant.
Nice to have a solution from you. Thanks! +1.
Did it the same way! Cheers. Also thanks to OP for a great question :)
To make things easier, consider the polynomial x ′ ( x ′ + a ′ ) + 1 instead, where x ′ = x + 1 9 9 1 , a ′ = a − 1 9 9 1 . Note that x ′ ( x ′ + a ′ ) + 1 = ( x + 1 9 9 1 ) ( x + a ) + 1 by substituting. Because ( x + 1 9 9 1 ) ( x + a ) + 1 is a perfect square for all integer x , we also have x ′ ( x ′ + a ′ ) + 1 to be a perfect square for all integer x ′ − 1 9 9 1 , which means x ′ ( x ′ + a ′ ) + 1 is a perfect square for all integer x ′ . For the rest of the following solution, assume that we're working with the polynomial x ( x + a ) + 1 instead of ( x + 1 9 9 1 ) ( x + a ) + 1 ; we will substitute back at the end.
First, we claim that a is an integer. This is easy. Substitute x = 1 to get that a + 2 is a perfect square, and hence an integer. Since 2 is an integer, we have a is also an integer.
Now, we can divide into cases.
Case 1 : a = ± 2
This is the easy case. The polynomial factorizes to ( x ± 1 ) 2 , so for integer x , we also have integer x ± 1 , and hence ( x ± 1 ) 2 is a perfect square. So a = ± 2 are solutions.
Case 2 : a = − 1 , 0 , 1
All these three fail with x = 2 ; we have x ( x + a ) + 1 to be 3, 5, 7 respectively. So these three are not solutions.
Case 3 : a > 2 or a < − 2
If a < − 2 , then substituting x = 1 gives a + 2 to be a perfect square. But a + 2 < 0 , so it's impossible to be a perfect square. If a > 2 , substituting x = − 1 gives a similar conclusion. Thus none of these are solutions.
Thus the only solutions are a = − 2 , 2 .
Back to the original problem, we found the solutions for a ′ . Getting the solutions for a is easy: a = a ′ + 1 9 9 1 = 1 9 8 9 , 1 9 9 3 , which sum to 3 9 8 2 .
Great solution. For polynomials of the form f ( x ) = x 2 + A x + B , in order for f ( n ) to be a perfect square, the theory (or our guesses) tells us that we have f ( x ) = ( x + k ) 2 . We can then try and track down the approximate value of k to get a better handle on this polynomial.
Very nicely done. Instead of having the notation do double duty, you should just use completely different variables like y , b instead.
Your solution is essentially saying that for all integers, we must have ( n + 1 9 9 1 ) ( n + a ) ≥ − 1 , which only holds true for 1 9 8 9 ≤ a ≤ 1 9 9 3 . Otherwise, substituting in any integere between -1991 and -a will violate the inequality.
We can write it as x 2 + ( a + 1 9 9 1 ) x + 1 9 9 1 a + 1 and since its a perfect square, its discriminant equals 0 giving ( a + 1 9 9 1 ) 2 − 4 ( 1 9 9 1 a + 1 ) = 0 ⇒ a 2 − 3 9 8 2 a + 1 9 9 1 2 − 4 = 0 . Since the question asks for sum, by vieta's formula we have sum as 3 9 8 2
This solution makes the unstated (and unproven) assumption that " f ( n ) is a perfect square for all integers n implies that f ( x ) is a perfect square polynomial".
Nice Solution. +0!.
Not quite. You have to explain what "the function evaluates to a perfect square on all integers" implies that "the function is a perfect square polynomial". Then, and only then, can you use the fact about discriminants.
Log in to reply
can you please elaborate some more on this because I followed the same method to get the answer
Log in to reply
See my comment in Chew-Seong's solution above.
This problem is quite simple to do analytically. If a quadratic is a perfect square then it must be of the form ( x + c ) 2 . In other words, the minimum of the quadratic must be at 0 . Since ( x + 1 9 9 1 ) ( x + a ) + 1 is a quadratic expression, we must have its minimum at zero. Equivalent of this is ( x + 1 9 9 1 ) ( x + a ) has its minimum at − 1 The minimum of a quadratic occurs halfway between it's roots which in this case must be at 2 − 1 9 9 1 − a and so the least value is ( 2 − 1 9 9 1 − a + 1 9 9 1 ) ( 2 − 1 9 9 1 − a + a ) = 2 1 9 9 1 − a × 2 − 1 9 9 1 + a = − 4 ( a − 1 9 9 1 ) 2 . Let this value equal − 1 and we have the equality ( a − 1 9 9 1 ) 2 = 4 . By expansion and Vieta's formula, the sum of these two roots are 2 × 1 9 9 1 = 3 9 8 2
This solution makes the unstated (and unproven) assumption that " f ( n ) is a perfect square for all integers n implies that f ( x ) is a perfect square polynomial".
Nice solution! +1
Yes, if the quadratic was a perfect square polynomial, then your claim is true.
But, why must the quadratic be a perfect square polynomial? That is not obvious, not explained in your solution.
( x + 1 9 9 1 ) ( x + a ) + 1 = n 2
So
( x + 1 9 9 1 ) ( x + a ) = n 2 − 1 = ( n + 1 ) ( n − 1 )
That'll give 2 answers to a . You can check by completing the square.
This solution is not valid.
Why must n 2 − 1 be factorized only as ( n + 1 ) ( n − 1 ) ?
For example, if n = 5 , can't we have 2 × 1 2 ?
Log in to reply
But can't we say like this: Since this is true for any integer x , we can choose x = n − a + 1 . Substituting, we get ( n − a + 1 9 9 2 ) ( n + 1 ) = ( n − 1 ) ( n + 1 ) ⇒ ( − a + 1 9 9 3 ) ( n + 1 ) = 0
Now, if n = − 1 , the original expression become ( x + 1 9 9 1 ) ( x + a ) = 0 which is not always true. Therefore, a = 1 9 9 3 .
Simmilarly, when we choose x = n − a − 1 , we will get a = 1 9 8 9 and we can check that both value of a satisfy the required condition.
Log in to reply
( x + 1 9 9 1 ) ( x + a ) = − 1
Now, there are only two ways to express -1 as a product, i.e. − 1 × 1 , 1 × − 1
Case 1:
x + 1 9 9 1 = − 1 x + a = 1
Subtracting the latter equation from the former, we get 1 9 9 1 − a = − 2 ⇒ a = 1 9 9 3
Case 2:
x + 1 9 9 1 = 1 x + a = − 1
Again, subtracting the latter equation from the former, 1 9 9 1 − a = 2 ⇒ a = 1 9 8 9
Sum of solutions = 1 9 8 9 + 1 9 9 3 = 3 9 8 2 □
This solution is not valid.
Vieta's can be applied too, as suggested by Nihar's solution.
This question looks familiar, or is it? @Mehul Arora
Log in to reply
Log in to reply
Perhaps its an old RMO question.
Log in to reply
@Harsh Shrivastava – Yes it is. We got it in FIITJEE, and we're in the same batch. That was intended to taunt ;)
Log in to reply
@Mehul Arora – Good job! :P
@Mehul Arora – Ohk kudos!
@Harsh Shrivastava – Hm, I'm willing to bet that most people scored 0/1 for the RMO grading of this problem. E.g. none of the solutions here are rigorously correct.
We are sure that x is an integer. But we aren't that a is also an integer. So are you sure that we can assume both brackets to be integers?
Log in to reply
There will be no value of a where a is non integral, and the expression is a perfect square.
Log in to reply
That we know by the method of making discriminant=0 which I did but how can you presume that?
Log in to reply
@Kushagra Sahni – Who said I presumed? It's just that I didn't mention it in the solution :P
I disagree with this claim. Just because "when n is an integer, f ( n ) is a perfect square" doesn't imply that "when n is not an integer, f ( n ) is not a perfect square".
Remember that given a statement, we can only take the contrapositive.
I don't get the first line. Why must we have ( x + 1 9 9 1 ) ( x + a ) = − 1 for some value of x ? Just because f ( n ) is a perfect square, doesn't imply that f ( n ) = 1 has a solution. E.g. The function f ( x ) = 1 0 0 satisfies the "perfect square when integer" condition, but doesn't have a solution to f ( x ) = 1 .
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Quadratic Discriminant - Problem Solving
f ( x ) = ( x + 1 9 9 1 ) ( x + a ) + 1 = x 2 + ( 1 9 9 1 + a ) x + 1 9 9 1 a + 1
For f ( x ) to be a perfect square, it must have the form of f ( x ) = x 2 + 2 k x + k 2 , therefore,
⟹ ( 2 1 9 9 1 + a ) 2 a 2 + 3 9 8 2 a + 3 9 6 4 0 8 1 a 2 − 3 9 8 2 a + 3 9 6 4 0 7 7 ( a − 1 9 8 9 ) ( a − 1 9 9 3 ) = 1 9 9 1 a + 1 = 7 9 6 4 a + 4 = 0 = 0
The sum of all a is 3 9 8 2 (Of course, Vieta's formula confirms it).