WEBVTT

1
00:00:00.000 --> 00:00:07.071
Here is the problem: 2x cubed plus 4x squared minus 4x plus 3 equals 0.

2
00:00:07.521 --> 00:00:10.714
A polynomial equation of degree 3 in x.

3
00:00:11.514 --> 00:00:13.023
Start with the equation.

4
00:00:13.473 --> 00:00:15.423
Move every term to one side.

5
00:00:15.874 --> 00:00:25.336
No further rational roots; approximate the remaining 3 roots numerically. The Durand–Kerner method iterates on all roots at once until they stop changing.

6
00:00:25.786 --> 00:00:27.493
Collect the real solutions.

7
00:00:28.293 --> 00:00:31.904
Now look at the graph of the left side minus the right side.

8
00:00:32.354 --> 00:00:35.988
It crosses zero exactly at the solutions we found.

9
00:00:36.788 --> 00:00:51.161
So the answer is x equals negative 2.8765546; complex: 0.4382773 plus or minus 0.57390781i.

10
00:00:51.611 --> 00:01:03.627
A degree-3 polynomial has exactly 3 roots counted with multiplicity (some may be complex). Exact rational roots are found first, then the rest are solved exactly or approximated.

11
00:01:04.427 --> 00:01:14.330
x equals negative 2.8765546: left side equals 0, right side equals 0, which checks out.