Leibnitz-Reihe
Author: Haftendorn
Date: Dez 05

f(x) = 1 / x
g(x) = 1 / (x + 1)
A: (2, f(2))
B: (2, g(2))
C: (3, f(3))
D: (3, g(3))
E: (4, f(4))
F = Intersect(g, a, (1, 0.55))
b = Segment(F, A)
c = Segment(B, A)
d = Segment(B, C)
e = Segment(C, D)
h = Segment(D, E)
i = UpperSum(g, 1, 10, 9)
g_1(x) = -1 / (2 x) + 1 / (2 x - 1)
j = LowerSum(g_1, 1, 15, 14)
k = OrthogonalLine(F, a)
G = Intersect(k, yAxis)
H = Intersect(xAxis, yAxis)
I = Intersect(xAxis, a)
P, h_1, i_1, f_1, g_2 = Polygon(H, I, F, G)