00:01
Hello, welcome to this lesson.
00:03
In this lesson, we will use java in order to calculate or oppose me the value of the natural logarithm, which is e.
00:17
Okay, so let's have the main method, which is the active.
00:40
So we need a double e, which will hold the final results.
00:49
Okay, and we need an integer.
00:52
And that would be the number of times that we would want to go.
00:58
All right.
01:00
So the first fold will go from one to n.
01:06
Okay, that is.
01:09
So for example, we have the evo -tuce equals to 1 over 1 factorial, then plus 1 over 2 factorial, and plus 1 over 3, 1, over 3 factorial and plus 1 over n factorial so we need the first for loop that goes from 1 to the nf 10 okay so this we have integer i that is equals to 1 that is less than or equals to n actually wanted to go to the nfactorio then i plus plus so at that point we should also get a factorial for each of the time so for example when we get to first time which is one it has one one factorial if we get to two we have two factorial okay so we need to create a factorial okay let me make the the value one okay for beginning but it's factorial.
02:42
Let's use a counter j.
02:45
That's that from 1.
02:47
Okay.
02:48
And it goes from j that is less than or equal to i...