Demostración de Fórmulas por Inducción
Cargado por
Macario Ortiz PérezDemostración de Fórmulas por Inducción
Cargado por
Macario Ortiz PérezUtilice inducción matemática para demostrar que la formula dada se cumple
para toda n = 1, 2, …
( ) [ ( )]
n n +1
1 1 −1 3 −1
a .− + −…+ = 1−
3 9 3 4 3
n=1
( ) [ ( )]
1 1+1
1 1 −1 3 −1
1− + −…+ = 1−
3 9 3 4 3
[ ( )]
2
1 3 −1
1− = 1−
3 4 3
1 3
1− = 1−
3 4
1
9 [ ]
2 3 8
=
3 4 9 []
2 24 12 6 2
= = = =
3 36 18 9 3
2 2
=
3 3
n=k
( ) [ ( )]
k k +1
1 1 −1 3 −1
1− + −…+ = 1−
3 9 3 4 3
n=k +1
[ ( ) ]
( )( )
k k +1 k+ 1+1
1 1 −1 −1 3 −1
1− + −…+ + = 1−
3 9 3 3 4 3
[ ( ) ]( ) [ ( ) ]
k +1 k +1 k+2
3 −1 −1 3 −1
1− + = 1−
4 3 3 4 3
[ ( )] [ ( )]
k +2 k+ 2
3 −1 3 −1
1− =¿ 1−
4 3 4 3
2 2
n ( n+1 )
b . 13 +23 +33 +… n3 =
4
n=1
2 2
1 ( 1+1 )
13 =
4
2 2
1 (2 )
13 =
4
4
1=
4
1=1
n=k
2 2
3 3 3 k ( k +1 ) 3
1 +2 +3 +… k =
4
n=k +1
( k +1 )2 ( k +1+1 )2
13 +23 +33 +… k 3+ ( k +1 )3=
4
2 2 2 2
k ( k +1 ) ( k +1 ) ( k +2 )
+ ( k +1 )3=
4 4
2 2 3 2 2
k ( k +1 ) +4 ( k +1 ) ( k +1 ) ( k +2 )
=
4 4
2 2 3 2 2
k ( k +1 ) +4 ( k +1 ) ( k +1 ) ( k +2 )
=
4 4
2 2 2 2 2
k ( k +1 ) +4 ( k +1 ) ( k +1 ) ( k +1 ) ( k +2 )
=
4 4
( k +1 )2 ( k 2 +4 k + 4 ) ( k +1 )2 ( k +2 )2
=
4 4
( k +1 )2 ( k +2 )2 ( k +1 )2 ( k +2 )2
=
4 4
Utilice inducción matemática para demostrar que 2 n+n3 es divisible entre 3
para todo entero positivo n.
3
2 n+n
+¿→ ∈Z → 2n +n3 será unmultiplo de3 ¿
3
n∈Z
n=1
3
2(1)+(1)
∈Z
3
2+ 1
3
3
3
1∈Z
n=k
3
2 k +k
∈Z
3
n=k +1
3
2(k +1)+(k +1)
∈Z
3
3 2
2 k +2+k +3 k +3 k + 1
3
3 2
2 k +k 3 k +3 k +3
+
3 3
2 k +k 3 ( k + k +1 )
3 2
+
3 3