WEBVTT

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

2
00:00:07.288 --> 00:00:10.434
A polynomial equation of degree 3 in x.

3
00:00:11.234 --> 00:00:12.697
Start with the equation.

4
00:00:13.147 --> 00:00:15.121
Move every term to one side.

5
00:00:15.571 --> 00:00:24.824
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.274 --> 00:00:26.946
Collect the real solutions.

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

8
00:00:31.702 --> 00:00:35.290
It crosses zero exactly at the solutions we found.

9
00:00:36.089 --> 00:00:50.950
So the answer is x equals negative 0.38388615; complex: 0.52527641 plus or minus 1.2085987i.

10
00:00:51.400 --> 00:01:03.602
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.402 --> 00:01:14.503
x equals negative 0.38388615: left side equals 0, right side equals 0, which checks out.