WEBVTT

1
00:00:00.000 --> 00:00:03.924
Here is the problem: x cubed minus 2 equals 0.

2
00:00:04.374 --> 00:00:07.567
A polynomial equation of degree 3 in x.

3
00:00:08.367 --> 00:00:09.888
Start with the equation.

4
00:00:10.338 --> 00:00:12.207
Move every term to one side.

5
00:00:12.657 --> 00:00:21.980
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:22.430 --> 00:00:24.137
Collect the real solutions.

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

8
00:00:29.102 --> 00:00:32.806
It crosses zero exactly at the solutions we found.

9
00:00:33.606 --> 00:00:46.725
So the answer is x equals 1.259921; complex: negative 0.62996052 plus or minus 1.0911236i.

10
00:00:47.175 --> 00:00:59.482
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:00.282 --> 00:01:09.268
x equals 1.259921: left side equals 0, right side equals 0, which checks out.