Let $a,b,c\in\{0,1,2,\cdots,9\}$.The quadratic equation $ax^2+bx+c=0$ has a rational root. Prove that the three-digit number $abc$ is not a prime number.
Problem
Source:
Tags: quadratics, algebra, number theory unsolved, number theory
01.11.2010 16:31
longlong123 wrote: Let $a,b,c\in\{0,1,2,\cdots,9\}$.The quadratic equation $ax^2+bx+c=0$ has a rational root. Prove that the three-digit number $abc$ is not a prime number. Wrong. Choose as counter example $(a,b,c)=(0,1,3)$
01.11.2010 16:36
pco wrote: longlong123 wrote: Let $a,b,c\in\{0,1,2,\cdots,9\}$.The quadratic equation $ax^2+bx+c=0$ has a rational root. Prove that the three-digit number $abc$ is not a prime number. Wrong. Choose as counter example $(a,b,c)=(0,1,3)$ The phrase "QUADRATIC equation $ax^2+bx+c=0$" assume that $a \neq 0$, n'est pas?
01.11.2010 16:39
nnosipov wrote: pco wrote: longlong123 wrote: Let $a,b,c\in\{0,1,2,\cdots,9\}$.The quadratic equation $ax^2+bx+c=0$ has a rational root. Prove that the three-digit number $abc$ is not a prime number. Wrong. Choose as counter example $(a,b,c)=(0,1,3)$ The phrase "QUADRATIC equation $ax^2+bx+c=0$" assume that $a \neq 0$, n'est pas? I dont know. I think that if $a$ is supposed to be non zero and if this is a serious real olympiad exercice, then $a\ne 0$ should be indicated.
01.11.2010 16:48
pco wrote: I dont know. I think that if $a$ is supposed to be non zero and if this is a serious real olympiad exercice, then $a\ne 0$ should be indicated. Vous avez raison mais ... cette probleme est assez trivial pour etre "a serious real olympiad exercice". D'accord?
02.11.2010 14:13
I think $ a\neq 0 $ . Can I do like this?
If I made any mistake, please tell me.
02.11.2010 16:08
We need to prove that there exist a decomposition $ax^2+bx+c=(px+q)(rx+s)$ with $p,q,r,s \in \mathbb{Z}$.
02.11.2010 16:35
More than that, there exists a decomposition $P(x) = ax^2+bx+c=(px+q)(rx+s)$ with $p,q,r,s \in \mathbb{N}$, since once $P(x)$ has a rational root, the other is also rational, and they both need be non-positive. After that, as in the hidden solution, $P(10) = \overline{abc} = \overline{pq}\cdot \overline{rs}$, where $p,r \neq 0$, and we are done.
18.07.2011 11:54
It is special case of Cohn Criterion in polynomial. $P(x)=a_nx^n+...+a_1x+a_0$ is irreducible if p-prime is written in base b :$p_b=\overline {a_na_{n-1}...a_1a_0} $