Prove that for every $n$ nonzero integer , there are infinite triples of nonzero integers $a, b$ and $c$ that satisfy the conditions: 1. $a + b + c = n$ 2. $ax^2 + bx + c = 0$ has rational roots.
Problem
Source: Lusophon 2019 CPLP P2
Tags: algebra, trinomial, Rational roots
01.01.2020 01:06
Let $a=a_1a_2,b=-2a_1a_2+na_1+a_2=-(a_1(a_2-n)+a_2(a_1-1)),c=a_1a_2-a_2-na_1+n=(a_1-1)(a_2-n)$ $a+b+c=n$ and $ax^2+bx+c=(a_1x-(a_1-1))(a_2x-(a_2-n))$ has roots $1-\frac{1}{a_1},1-\frac{n}{a_2}$
19.05.2024 10:24
Can you explain what was the thought process there?
09.07.2024 01:29
Let $q\in\mathbb{Z},$ $\lvert q\lvert\neq 1$. The equation $n[(q^2-q)x^2+(1-2q^2)x+(q^2+q)]=0$ has roots $\frac{q}{q-1}$ and $\frac{q+1}{q}$. It clearly gives infinite solutions for $n$.
09.07.2024 05:23
If $ax^2+bx+c=0$ has a rational root then so does the quadratic equation $kax^2+kbx+kc=0$ for obvious reasons. So if we are able to prove the case when $n=1$, we can easily generate infintely many triples of $(a, b, c)$ in the case $n=k$ simply by letting $(ka, kb, kc)$. Rest is easy. Just let $(a, b, c)=(mn, -2mn+m+n, mn-m-n+1)$.