# ISI2015-MMA-16

1 vote
139 views

If two real polynomials $f(x)$ and $g(x)$ of degrees $m\: (\geq 2)$ and $n\: (\geq 1)$ respectively, satisfy

$$f(x^2+1)=f(x)g(x),$$

for every $x \in \mathbb{R}$, then

1. $f$ has exactly one real root $x_0$ such that $f’(x_0) \neq 0$
2. $f$ has exactly one real root $x_0$ such that $f’(x_0) = 0$
3. $f$ has $m$ distinct real roots
4. $f$ has no real root

retagged

1 vote
$\underline{\mathbf{Answer:D}}$

$\underline{\mathbf{Solution:}}$

Let's say, $\mathrm x$ is a root then $x\mathrm{^2+1}$ should also be a root.

Thus, if $\mathrm {x_1}$ is the largest real root, then we should have $\mathrm{x_1 \ge x_1^2+1}$

$\mathrm{\Rightarrow x_1^2 -x_1 + 1 \le 0}$

But,

$\mathrm{x_1^2-x_1+1 = (x_1-\frac{1}{2})^2 + \frac{3}{4} > 0}$

$\therefore \mathbf f$ has no real roots.

$\therefore \mathbf D$ is the correct answer.

edited by
0

@ankitgupta.1729

Can you please checkout this solution.

2

@JEET

yeah, correct according to me. I asked it previously.

https://gateoverflow.in/304571/isi-mma-2015

1

@JEET
The answer is correct. But your proof is fallacious as you show for the case only when $x_1$ is the largest real root. But you need to show what if $x_1$ is the lowest real root! I meant what if $x_1< {x_{1}}^2+1$.

1
So you mean I need to consider both the cases?
0
Yes.
1
ok.

f($x^{_{2}}+1$)=f(x)g(x)

when x=0; f(1)=f(0)g(0)

if k,q are the constant terms of polynomials f,g then

f(1)=kq

hence f(x)=k$x^{_{q-1}}$+k$x^{_{q-2}}$+.......+k

power of x terms in f($x^{_{2}}+1$) are always even numbers. hence f(x) and g(x) should have x terms with even powers.

f(x) is an polynomial with even degree m>=2 and all-one polynomial. hence f(x) has no real distinct roots.

ANSWER: D) no distinct real roots.

## Related questions

1
115 views
The number of real solutions of the equations $(9/10)^x = -3+x-x^2$ is $2$ $0$ $1$ none of the above
The number of real roots of the equation $2 \cos \left( \frac{x^2+x}{6} \right) = 2^x +2^{-x} \text{ is }$ $0$ $1$ $2$ infinitely many
Let $X$ be a nonempty set and let $\mathcal{P}(X)$ denote the collection of all subsets of $X$. Define $f: X \times \mathcal{P}(X) \to \mathbb{R}$ by $f(x,A)=\begin{cases} 1 & \text{ if } x \in A \\ 0 & \text{ if } x \notin A \end{cases}$ Then $f(x, A \cup B)$ equals $f(x,A)+f(x,B)$ $f(x,A)+f(x,B)\: – 1$ $f(x,A)+f(x,B)\: – f(x,A) \cdot f(x,B)$ $f(x,A)\:+ \mid f(x,A)\: – f(x,B) \mid$
Suppose that a function $f$ defined on $\mathbb{R} ^2$ satisfies the following conditions: $\begin{array} &f(x+t,y) & = & f(x,y)+ty, \\ f(x,t+y) & = & f(x,y)+ tx \text{ and } \\ f(0,0) & = & K, \text{ a constant.} \end{array}$ Then for all $x,y \in \mathbb{R}, \:f(x,y)$ is equal to $K(x+y)$ $K-xy$ $K+xy$ none of the above