0% found this document useful (0 votes)
60 views3 pages

$R5YYXTO

The document is an assignment for an introductory mathematics course containing 50 proof problems involving different types of numbers and mathematical induction. Students are instructed to answer all questions, which involve proving properties of numbers, relationships between number sets, and formulas through induction. They have seven weeks to complete and submit the assignment.

Uploaded by

daniel kingsley
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
0% found this document useful (0 votes)
60 views3 pages

$R5YYXTO

The document is an assignment for an introductory mathematics course containing 50 proof problems involving different types of numbers and mathematical induction. Students are instructed to answer all questions, which involve proving properties of numbers, relationships between number sets, and formulas through induction. They have seven weeks to complete and submit the assignment.

Uploaded by

daniel kingsley
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

THE FEDERAL UNIVERSITY OF TECHNOLOGY, AKURE

SCHOOL OF SCIENCES
DEPARTMENT OF MATHEMATICAL SCIENCES
MTS 101 INTRODUCTORY MATHEMATICS I ASSIGNMENT
FIRST SEMESTER 2020/2021 ACADEMIC SESSION

INSTRUCTION: Answer all the questions. Time Allowed: Seven Weeks (1,176 Hours)

To be submitted on or before 10:00am on Wednesday 9th February, 2022.

1. What is a number?

2. State and explain ten (10) properties of real numbers that you know.

3. Define the term the Principle of Mathematical Induction.

4. Highlight the steps involved in the Principle of Mathematical Induction.

5. Write a short note on each of the following types of numbers: (a) Natural/Counting Numbers;
(b) Integers; (c) Rational Numbers; (d) Irratioanal Numbers; (e) Real Numbers; (f) Complex
Numbers; (g) Even Numbers; (h) Odd Numbers; (i) Prime Numbers (j) Complex Numbers.

6. With the aid of a well labelled Venn diagram, explain the relationship that exists among all
the types of numbers in 5(a)-(j) above.

7. Prove that 10n − 1 is a multiple of 9 for all positive integers.

8. Prove 3n > 2n for all natural numbers n.

9. Prove that n! > 3n for n ≥ 7.

10. Prove using mathematical induction that for all n ≥ 1,

n(3n − 1)
1 + 4 + 7 + ... + (3n − 2) =
2

11. Prove that 4n − 1 is a multiple of 3 for all values of n using the principle of Mathematical
Induction.

12. Prove that n3 + 2n is a multiple of 3 for all values of n using the principle of Mathematical
Induction.

13. Use the principle of Mathematical Induction to show that 3n > n2 .

14. Prove that (xy)n = xn y n for all values of n using the principle of Mathematical Induction.
1 2n −1
15. Use the principle of Mathematical Induction to show that 2
+ 14 + 18 + ... + 1
2n
= 2n
.
1
16. Use the principle of Mathematical Induction to show that 4×12 −1
+ 4×212 −1 + ... + 4×n12 −1 = n
2n+1
.

17. Prove by Mathematical Induction that 1 × 20 + 2 × 21 + 3 × 22 + ... + n × 2n−1 = 1 + (n − 1)2n .

1 sin θ2 (2n−1)
18. Prove by Mathematical Induction that 2
+ cosθ + ... + cos(n − 1)θ = 2sin θ2
.

19. Prove that 4n2 − 1 is divisible by 5 for all positive integers n.


sin 12 (n+1)θsin 12 nθ
20. Use Mathematical Induction to show that sinq + sin2q + sin3q + ... + sinnq = sin 12 θ
.

1
21. Verify that for all n ≥ 1, the sum of the squares of the first 2n positive integers is given by the
formula
n(2n + 1)(4n + 1)
12 + 22 + 32 + + (2n)2 =
3
22. Find the first positive integer n that causes the statement n2 − 3n < 100 to fail using the
principle of Mathematical Induction.
√ √
23. Prove that (3+ 5)n + (3 − 5)n is an even integer for all natural numbers n using the principle
of Mathematical Induction.

24. Find the first positive integer n that causes the statement 3n +4n > 5n to fail using the principle
of Mathematical Induction.

25. Use the principle of Mathematical Induction to prove that 2002n+2 + 20032n+1 is divisible by
4005.
n n2 (n+1)2
26. Prove by Mathematical Induction that Σr=1 r3 = 4
.

27. Prove that the sum of the cube of any three consecutive natural numbers is divisible by 9 using
mathematical induction.

28. Prove by Mathematical Induction that 12 + 22 + 32 + ... + n2 = n6 (n + 1)(2n + 1).

29. Use the principle of Mathematical Induction to prove that for positive integers

a1 , a2 , ...0 an , a1 +a2n+...an ≥ n a1 , a2 , ...an .

30. show that 34n+2 + 2.43n+1 is exactly divisible by 17 if n is a positive integer.

31. Prove that 6n + 10n + 6 is a multiple of 5 for all values of n using the principle of Mathematical
Induction.
1 1 1 1 n
32. Use the principle of Mathematical Induction to show that 1.2
+ 2.3
+ 3.4
+ ... + n(n+1)
= n+1
.

33. Prove that 6n − 1 is a multiple of 5 for all values of n using the principle of Mathematical
Induction.

34. Use the principle of Mathematical Induction to show that the arithmetic mean (AM) is always
greater than or equal to the geometric mean (GM).

35. Use the Principle of Mathematical Induction to prove that 5n + 2 × 11n is a multiple of 3 for
all positive integer n.

36. Use the Principle of Mathematical Induction to prove that 2n > n.

37. Prove that for any natural number n ≥ 2,


1 1 1
2
+ 2 + + 2 <1
2 3 n

38. Prove that n4 + 4n2 + 11 is a multiple of 16 for all odd positive integers.

39. Prove that for all positive integer values of n, 52n + 3n − 1 is an integer multiple of 9.

40. Prove that n(n+1)(n+2) is an integer multiple of 6.

41. Show that 18n − 1 is exactly divisible by 17 if n is a positive integer.


1 1 1 1 n
42. Prove by the Principle of Induction 1.3
+ 3.5
+ 5.7
+ ... + (2n+1)(2n−1)
= 2n+1
.

2
43. Prove or disprove that n2 + 21n + 1 is a prime number for all positive values of n.

44. Prove that for any positive integer n > 7 can be written as the sum of three or fewer squares
of positive integers.

45. Prove that, if sin x 6= 0 and n is a natural number then


sin2n x
cosx × cos2x . . . cos2n−1 x =
2n sinx
if sin x 6= 0.

46. Prove that every integer greater than 1 is a product of prime numbers.
1
47. Use the principle of Mathematical Induction to show that x
+ x12 + x13 + ... + x1n = 1
x−1
1
− xn (x−1) .

48. Prove that n(n + 1)(n + 2)(n + 3)(n + 4)(n + 5) is a multiple of 720 for all positive integers.

49. As each of the students of MTS 101 arrives for an examination, each have a short discussion
with all the other students present. Use mathematical induction to show that if n students
come for the examination, then n(n−1)
2
discussions occur.

50. Prove that for any natural number n,


1 3 5 2n − 1 1
. . ... ≤√
2 4 6 2n 3n + 1

DR. A. S. AFOLABI,
DEPARTMENT OF MATHEMATICAL SCIENCES,
THE FEDERAL UNIVERSITY OF TECHNOLOGY, AKURE.

You might also like