Scribd
Upload
161 views3 pages

Inductie Matematica

Mathematical induction is a method of proof that can establish that a statement holds for all natural numbers. There are three main theorems: 1) the principle of mathematical induction, 2) strong mathematical induction, and 3) downward mathematical induction. A list of 20 problems demonstrates applications of these theorems, such as proving statements are true for all natural numbers and showing certain expressions are divisible. References for further reading on the topic are also provided.

Uploaded by

Claudia Irina Moruz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
161 views3 pages

Inductie Matematica

Mathematical induction is a method of proof that can establish that a statement holds for all natural numbers. There are three main theorems: 1) the principle of mathematical induction, 2) strong mathematical induction, and 3) downward mathematical induction. A list of 20 problems demonstrates applications of these theorems, such as proving statements are true for all natural numbers and showing certain expressions are divisible. References for further reading on the topic are also provided.

Uploaded by

Claudia Irina Moruz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Mathematical Induction

Important results

Theorem 1 (The Principle of Mathmatical Induction). Let P (n) be a state-


ment involving n ∈ N, and let n0 ∈ N. If
i) P (n0 ) holds, and

ii) for every k ≥ n0 , P (k) → P (k + 1),


then P (n) holds for every n ≥ n0 .
.
Example. 23n − 1 .. 7, ∀ n ∈ N∗ .
Theorem 2 (Strong Mathematical Induction). Let P (n) be a statement in-
volving n ∈ N, and let n0 ∈ N. If
i) P (n0 ) holds, and

ii) for every k ≥ n0 , (P (n0 ) ∧ · · · ∧ P (k − 1) ∧ P (k)) → P (k + 1),


then P (n) holds for every n ≥ n0 .
Example. Any positive integer n ≥ 2 can be expressed as a product of primes.
Theorem 3 (Downward Mathematical Induction). Let P (n) be a statement
involving n ∈ N, and let n0 ∈ N. If
i) P (n) holds for infinitely many values of n ≥ n0 , and

ii) for each k ≥ n0 + 1, P (k) → P (k − 1),


then P (n) holds for every n ≥ n0 .
Example. See Problem 19.
List of problems

1. Prove the following statements:

(i) 6n + 6 < 2n , ∀ n ∈ N, n ≥ 6.

(ii) 3n2 + 3n + 1 < 2n , ∀ n ∈ N, n ≥ 10.


1 1
2. Let α be a real number such that α + ∈ Z. Show that αn + n ∈ Z, for
α α
all n ∈ N.
3. Let f, g : N∗ → R be given by
1 1 1 1 1 1 1
f (n) = 1 − + − ··· + − , g(n) = + + ··· + .
2 3 2n − 1 2n n+1 n+2 2n
Show that f (n) = g(n), ∀ n ∈ N∗ .
4. Let the sequence (sn )n be defined by s0 = 1, s1 = 2, s2 = 3 and sn =
sn−3 + sn−2 + sn−1 ∀ n ≥ 3. Prove that sn ≤ 3n , ∀ n ∈
 nN.
∗
5. Show that, for every n ∈ N , 2 + 2 + · · · + 2 = n2 · n+1
1 2
      
2
.
3n
6. Show that, for all n ∈ N, 2 + 1 is divisible by 3 , but not by 3n+2 .
n+1

7. Show that the numbers 1007, 10017, 100117, . . . , 100 |11 {z . . . 1} 7 are divisible
by 53. n times
8. Prove that the terms Fn of the Fibonacci sequence verify the relation

Fn2 = Fn−1 Fn+1 + (−1)n−1 ,

for all n ≥ 2.
9. Show that 33n+3 − 26n − 27 is divisible by 169, for every n ∈ N∗ .
.
10. Show that 32n · 7n − 23n · 5n .. 23, ∀ n ∈ N.
11. Let x be a positive real number. Show that, for all n ≥ 1,
1 1 1
xn + xn−2 + xn−4 + · · · + + + ≥ n + 1.
xn−4 xn−2 xn
12. Show that for every k ∈ Z there exist m ∈ N and some choice of the signs
+ or − such that
k = ±12 ± 22 ± · · · ± m2 .
Hint: (m + 1)2 − (m + 2)2 − (m + 3)2 + (m + 4)2 = 4, ∀ m ∈ N.
13. Find the numbers n ∈ N∗ for which there exists some choice of the signs +
and − such that n = ±12 ± 22 ± · · · ± n2 .
14. Find all functions f : Q+ → Q+ with the property that
 y f (y)
f x+ = f (x) + + 2y, ∀ x, y ∈ Q+ .
x f (x)
n
15. Let n ∈ N∗ . Show that 22 − 1 has at least n distinct prime factors.
16. Given n ∈ N∗ , we denote by [n] the set of positive integers that are at most
n. Prove that, for all n ≥ 1,
X 1
Q = n.
s
∅6=S⊆[n]
s∈S

17. Prove that, for each n ∈ N∗ , there exists a positive integer consisting of n
digits, each digit being 1 or 2, which is divisible by 2n .
18. Show that, for any n ∈ N∗ , the following relation holds:
n2
X √ n2 − 1
{ i} ≤ .
i=1
2

19. Let a1 , a2 , . . . , an , . . . be nonnegative reals with ai ≤ 1, ∀ i ∈ N∗ . Show


that n
X 1 n
≤ √ , ∀ n ≥ 2.
i=1
1 + a i 1 + n a a ...a
1 2 n

20. For any given n ≥ 1, consider the subsets of {1, 2, . . . , n} which do not
contain two consecutive numbers. For example, if n = 4, these subsets are {1},
{2}, {3}, {4}, {1, 3}, {1, 4} and {2, 4}. Prove that the sum of the squares of the
products in each set is (n + 1)! − 1.
(When n = 4, the sum is 12 + 22 + 32 + 42 + 32 + 42 + 82 = 119 = 5! − 1.)

References and supplementary reading

[1] D. S. Gunderson, Handbook of Mathematical Induction, Theory and Applica-


tions, Chapman & Hall/CRC, 2011.

[2] L. Panaitopol, M. E. Panaitopol, M. Lascu, Inductia matematica, Ed. Gil,


2002.

[3] A. Engel, Problem solving strategies, Springer, 1998.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy