MHB Find (x₁²+1)(x₂²+1)(x₃²+1)(x₄²+1)

  • Thread starter Thread starter anemone
  • Start date Start date
anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Let $a,\,b,\,c$ and $d$ be real numbers such that $b-d\ge 5$ and all zeros $x_1,\,x_2,\,x_3$ and $x_4$ of the polynomial $P(x)=x^4+ax^3+bx^2+cx+d$ are real. Find the smallest value the product $(x_1^2+1)(x_2^2+1)(x_3^2+1)(x_4^2+1)$ can take.
 
Mathematics news on Phys.org
Difference of squares
 
We know that $P(x)=(x-x_1)(x-x_2)(x-x_3)(x-x_4)$ so if we factor the difference of squares, we get

$(x-x_1^2)(x-x_2^2)(x-x_3^2)(x-x_4^2)\\=(\sqrt{x}-x_1)(\sqrt{x}-x_2)(\sqrt{x}-x_3)(\sqrt{x}-x_4)(\sqrt{x}+x_1)(\sqrt{x}+x_2)(\sqrt{x}+x_3)(\sqrt{x}+x_4)\\=P(\sqrt{x})P(-\sqrt{x})$

Let's try this on the given expression.

$(x_1^2+1)(x_2^2+1)(x_3^2+1)(x_1^4+1)\\=(x_1^2-i^2)(x_2^2-i^2)(x_3^2-i^2)(x_1^4-i^2)\\=(x_1-i)(x_2-i)(x_3-i)(x_4-i)(x_1+i)(x_2+i)(x_3+i)(x_4+i)\\=P(i)P(-i)\\=(1-ai-b+ci+d)(1+ai-b-ci+d)\\=(1-b+d+(c-a)i)(1-b+d-(c-a)i)\\=(b-d-1)^2+(c-a)^2$

Now it is clear where the condition $b-d\ge 5$ comes in, we have

$(b-d-1)^2+(c-a)^2\ge (5-1)^2+0^2=16$

But we are not done yet, we need to exhibit a polynomial $P(x)$ that achieves the value 16. For this, we need $b-d=5$ and $c-a=0$ to hold. Fortunately there is any easy polynomial that satisfies this condition:

$(x+1)^4=x^4+4x^3+6x^2+4x+1$ and we conclude that the answer is indeed 16.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top