The zeros of a function f(x) are the values of x that cause f(x) to be equal to zero
There are many theorems to find the zeros of the polynomial functions and one of them is
The Factor TheoremThe Factor Theorem can be used
to analyze polynomial equations. By it we can know that there is a relation between factors and zeros.
<span>let: f(x)=(x−a)q(x)+r.
</span>
If a is one of the zeros of the function , then the remainder r =f(a) =0
and <span>f(x)=(x−a)q(x)+0</span> or <span>f(x)=(x−a)q(x)</span>
Notice, written in this form, x – a is a factor of f(x)
the conclusion is: if a is one of the zeros of the function of f(x),
then x−a is a factor of f(x)
And vice versa , if (x−a) is a factor of f(x), then the remainder of the Division Algorithm <span>f(x)=(x−a)q(x)+r</span> is 0. This tells us that a is a zero.
So, we can use the Factor Theorem to completely factor a polynomial of degree n
into the product of n factors. Once the polynomial has been completely
factored, we can easily determine the zeros of the polynomial.
Answer:
(
x−
2
)
(
x
+
4
)
Step-by-step explanation:
I'll give you an example from topology that might help - even if you don't know topology, the distinction between the proof styles should be clear.
Proposition: Let
S
be a closed subset of a complete metric space (,)
(
E
,
d
)
. Then the metric space (,)
(
S
,
d
)
is complete.
Proof Outline: Cauchy sequences in (,)
(
S
,
d
)
converge in (,)
(
E
,
d
)
by completeness, and since (,)
(
S
,
d
)
is closed, convergent sequences of points in (,)
(
S
,
d
)
converge in (,)
(
S
,
d
)
, so any Cauchy sequence of points in (,)
(
S
,
d
)
must converge in (,)
(
S
,
d
)
.
Proof: Let ()
(
a
n
)
be a Cauchy sequence in (,)
(
S
,
d
)
. Then each ∈
a
n
∈
E
since ⊆
S
⊆
E
, so we may treat ()
(
a
n
)
as a sequence in (,)
(
E
,
d
)
. By completeness of (,)
(
E
,
d
)
, →
a
n
→
a
for some point ∈
a
∈
E
. Since
S
is closed,
S
contains all of its limit points, implying that any convergent sequence of points of
S
must converge to a point of
S
. This shows that ∈
a
∈
S
, and so we see that →∈
a
n
→
a
∈
S
. As ()
(
a
n
)
was arbitrary, we see that Cauchy sequences in (,)
(
S
,
d
)
converge in (,)
(
S
,
d
)
, which is what we wanted to show.
The main difference here is the level of detail in the proofs. In the outline, we left out most of the details that are intuitively clear, providing the main idea so that a reader could fill in the details for themselves. In the actual proof, we go through the trouble of providing the more subtle details to make the argument more rigorous - ideally, a reader of a more complete proof should not be left wondering about any gaps in logic.
(There is another type of proof called a formal proof, in which everything is derived from first principles using mathematical logic. This type of proof is entirely rigorous but almost always very lengthy, so we typically sacrifice some rigor in favor of clarity.)
As you learn more about a topic, your proofs typically begin to approach proof outlines, since things that may not have seemed obvious before become intuitive and clear. When you are first learning it is best to go through the detailed proof to make sure that you understand everything as well as you think you do, and only once you have mastered a subject do you allow yourself to omit obvious details that should be clear to someone who understands the subject on the same level as you.