Professional Documents
Culture Documents
The Leibniz Criterion Modified by Spanu Dumitru Viorel Spanu Dumitru Viorel Study of Convergent Series
The Leibniz Criterion Modified by Spanu Dumitru Viorel Spanu Dumitru Viorel Study of Convergent Series
Gottfried Leibniz
1. Leibniz Criterion modified by Spanu
Dumitru Viorel
Capitolul 8
( capitol cu caracter didactic )
4. studiul seriei
k k
∑ (-1) ----------
k p
k
(7
(Sloane's A078437) converges (Robinson and Potter 1971), but it is not known if the sum
(8
I studied my self
the series studied by Paul Erdos , Finch and Guy
and mine conclusion is that this series
is a convergent series and the sum of this convergent
series is approximately - 0.05
k k
∑ (-1) ----------
k p
k
k k
∑ (-1) ---------- ≈ - 0. 05
k p
k
where
p - the prime numbers in their succession .
k
5. Formula care aproximeaza seria
x 1 . . 1000000000
x
x. ln( x 1)
( 1) .4
2
1 x ( ln( x ) )
x
5.1 Teorema numerelor prime
x 1000000001 . . 2000000000
x
x ln( x 1 ) 4
( 1) . = 7.809 . 10
2
1 x ( ln( x) )
x
x 2000000001 .. 3000000000
x
x ln( x 1 ) 4
( 1) . = 4.338 . 10
2
1 x ( ln( x) )
x
x 3000000001 . . 4000000000
x
x ln( x 1) 4
( 1) . = 2.981 . 10
2
1 x ( ln( x) )
x
x 4 0 0 0 0 0 0 0. 06.10 0 0 0 0 0 0 0 0
x
x ln( x 1 ) 4
( 1) . = 4 .0 7 .31 0
2
1 x ( ln( x) )
x
x ..
60000000018000000000
x
x ln( x 1 ) . 10 4
( 1) . = 2.80171044110288
2
1 x ( ln( x) )
x
x 8 0 0 00 0 00 0. 1. 1 00 0 00 0 0 00 0
x
x ln( x 1 ) 4
( 1) . = 2 .1 2 4 96 4 510 89 4. 10
78
2
1 x ( ln( x) )
x
x 12000000001 . . 14000000000
x
x ln( x 1) 4
( 1) . = 1.422 . 10
2
1 x ( ln( x) )
x
x . .
1400000000116000000000
x
x ln( x 1 ) . 4
( 1) . = 1.21610
2
1 x ( ln( x) )
x
x 1 6 0 0 0 0 0 0 0. 0.118 0 0 0 0 0 0 0 0 0
x
x ln( x 1 ) . 04
( 1) . = 1 .0 6 11
2
1 x ( ln( x) )
x
x . . 20000000000
18000000001
x
x ln( x 1 ) . 5
( 1) . = 9.40610
2
1 x ( ln( x) )
x
x 2 0 00 0 00 0 00. .12 20 0 00 0 00 0 0
x
x ln( x 1 ) . 10 5
( 1) . = 8 .4 3 6 74 0 95
2
1 x ( ln( x) )
x
6 . Programul care calculeaza exact suma primilor
5000000 – 6000000 de termeni ai seriei . Ce indica
calculatorul ?
Programul
1 OPEN "d:\rez10100.bas" FOR OUTPUT AS #1
2 OPEN "d:\rez20200.bas" FOR OUTPUT AS #2
3 OPEN "d:\rez30300.bas" FOR OUTPUT AS #3
4 OPEN "d:\rez40400.bas" FOR OUTPUT AS #4
5 OPEN "d:\rez50500.bas" FOR OUTPUT AS #5
6 OPEN "d:\rez60600.bas" FOR OUTPUT AS #6
7 LET q = 699999
8 LET x! = 3
9 LET x! = x! + 2
10 PRINT x!
11 IF x! < q THEN
12 GOTO 17
13 END IF
14 IF x! >= q THEN
15 END
16 END IF
17 LET y! = 3
18 IF x! MOD y! = 0 THEN
19 GOTO 30
20 ELSE
21 LET y! = y! + 2
22 END IF
23 IF y! >= x! - 1 THEN
24 LET zet! = x!
25 IF y! >= x! - 1 THEN WRITE #1, "zet!=", zet!
26 GOTO 31
27 ELSE
28 END IF
29 GOTO 18
30 GOTO 9
31 FOR z! = 1 TO zet! STEP 1
32 GOTO 36
33 LET q2! = x1!
34 NEXT z!
35 GOTO 18
43 WRITE #2, "s#=", s#, "suma1#=", suma1#, "zet!=", zet, "q1#=", q1#, "k1=", k1, "k2=",
k2, "k3=", k3
44 WRITE #3, "s#=", s#, "z=", z, "k1=", k1, "zet!=", zet!, "q1#=", q1#
46 IF s1# = INT(s1#) THEN WRITE #4, "x!=", x!, "zet!=", zet!, "s#=", s#, "s1#=", s1#, "z=",
z
47 IF s1# = INT(s1#) THEN LET q3! = s1#
48 LET x1! = 1
49 IF x1! < q3! THEN
50 LET x1! = 3
51 END IF
52 IF q3! MOD x1! = 0 THEN
53 GOTO 62
54 ELSE
55 LET x1! = x1! + 2
56 END IF
57 IF x1! >= (q3! - 1) AND (s1# = INT(s1#)) THEN
58 WRITE #5, "q3!=", q3!, "s#=", s#, "s1#=", s1#, "zet!=", zet!, "x1!=", x1!, "x!=", x!
59 END IF
60 WRITE #6, "s1#=", s1#, "s#=", s#, "zet!=", zet!, "x1!=", x1!, "q3!=", q3!, "x!=", x!
61 GOTO 52
62 GOTO 33
Citat
O teorema spune ca :
“ O conditie necesara ca seria
u + u + u + ... + u + ...
1 2 3 n
k k
∑ (-1) ----------
k p
k
Textul propriuzis :
sau de forma
n
- x + x - x + x - x + … + ( -1 ) · x + … ,
1 2 3 4 5 n
este convergenta . “
Consecinta ( Propozitie ) :
sau
De scris in continuare :
n +1
x - x + x - x + … + ( -1 ) · x + … ,
1 2 3 4 n
sau de forma
n
- x + x - x + x - x + … + ( -1 ) · x + … ,
1 2 3 4 5 n
poate fi si crescator . “
This is the programm used to sum the terms
of the series
k k
∑ (-1) ----------
k p
k
11 If x! < q Then
12 GoTo 17
13 End If
14 If x! >= q Then
15 End
16 End If
17 Let y! = 3
18 If x! Mod y! = 0 Then
19 GoTo 30
20 Else
21 Let y! = y! + 2
22 End If
23 If y! >= x! - 1 Then
24 Let zet! = x!
25 If y! >= x! - 1 Then Write #1, "zet!=", zet!
26 GoTo 31
27 Else
28 End If
29 GoTo 18
30 GoTo 9
31 For z! = 1 To zet! Step 1
32 GoTo 36
33 Let q2! = x1!
34 Next z!
35 GoTo 18
GoTo 43
End If
42 Let s5# = -0.185302990447678
43 Let s6# = s5# + ((k1) / (q1#)) * ((-1) ^ k1)
Let s5# = s6#
Let k3 = k3 + 1
Let k2 = 0 + k3
Let s# = suma1#
End Sub
Work in progress .