Scribd
Upload
52 views

Assignment 4: Mathematical Inductions: Mathematical Logic - A (MSH1B3)

1. The document provides instructions for Assignment 4 on mathematical inductions. It includes 6 problems worth varying points that must be solved by hand and submitted by the deadline. 2. Problem 1 asks to determine a value using an identity and prove the identity holds for all integers using induction. Problem 2 asks to prove a statement about divisibility using induction. 3. Problems 3-4 ask to prove additional divisibility statements and determine values for an inequality using induction. Problems 5-6 define recursive sequences and ask to determine values and prove statements about the sequences using induction.

Uploaded by

ulfahrif
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
52 views

Assignment 4: Mathematical Inductions: Mathematical Logic - A (MSH1B3)

1. The document provides instructions for Assignment 4 on mathematical inductions. It includes 6 problems worth varying points that must be solved by hand and submitted by the deadline. 2. Problem 1 asks to determine a value using an identity and prove the identity holds for all integers using induction. Problem 2 asks to prove a statement about divisibility using induction. 3. Problems 3-4 ask to prove additional divisibility statements and determine values for an inequality using induction. Problems 5-6 define recursive sequences and ask to determine values and prove statements about the sequences using induction.

Uploaded by

ulfahrif
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Name: NIM: Class:

Assignment 4: Mathematical Inductions


Mathematical Logic - A (MSH1B3)
First Term 2016-2017
Instructions:

1. This assignment is due Thursday December 1 at 5:00 p.m.. Please submit your work at School of
Computing academic roster (roster akademik Fakultas Informatika), room A203A (building A room
A203A). Do not forget to write your identity on the space provided. You may submit this assignment as
of Monday November 28 at 8:00 a.m..

2. In order to prevent any academic misconduct, you also need to submit a readable scan or photograph of
this assignment to the provided submission slot in IDEA. Please contact your class instructor for more
detailed information. The due date of this online submission is the same as the hardcopy. Please make
sure that your file size do not exceed the maximum file size allowed.

3. To save paper, you may print and reproduce this assignment double-sided.

4. Your answers should be handwritten. You may use: HB or 2B pencil, or pen with blue or black ink.

5. All problems in this assignment are adapted from the textbooks. The problems are written in English.
If you are a student in a regular class, you may answer the problems in Bahasa. However, if you are a
student in international class, your answers must be written in English otherwise your assignment will
not be graded. You may ask your class instructor or teaching assistant for helping you understanding the
problem, but you should not ask them to give the solution of any problem.

6. Write your solutions on the space provided. If you need more space, you may use additional A4 papers
and attach them to your assignment.

7. Be neat and write legibly. You will be graded not only on the correctness of your answers, but also on
the clarity with which you express them.

8. This assignment consists of 6 problems, Problems 1, 2, 3, 4 are worth 15 points, Problems 5 and 6 are
worth 20 points.

9. Please retain yourself from copying answers from elsewhere without understanding the steps. This
assignment is an individual evaluation.

10. Important: late submission without reasonable explanation will not be graded.

page 1 of 7
Problem 1 (15 points) Consider the following identity

1 1! + 2 2! + + n n! = (n + 1)! 1, for n 1. (1)

(a). [5 points] Assuming that Equation (1) holds, determine the value of 1 1! + 2 2! + + 10 10!.

(b). [10 points] Use mathematical induction to show that Equation (1) holds for all integers n 1.

A NSWER :

page 2 of 7
Name: NIM: Class:

Problem 2 (15 points) Prove that 7n 1 is divisible by 6 for every integer n 0.

A NSWER :

page 3 of 7
Problem 3 (15 points) Prove that 32n 1 is divisible by 8 for every integer n 0.

A NSWER :

page 4 of 7
Name: NIM: Class:

Problem 4 (15 points) Determine all positive integers n that make the inequality 2n + 3 < 2n holds!
Justify your answer with mathematical induction!

A NSWER :

page 5 of 7
Problem 5 (20 points) A sequence han i is defined recursively as

a0 = 0, a1 = 1, and an = an 1 + 2an 2 + 2 for n 2.

(a). [5 points] Using the recursive definition, determine the value of a2 , a3 , and a4 .

(b). [15 points] Prove that an = 2n 1 for all n 0.

A NSWER :

page 6 of 7
Name: NIM: Class:

Problem 6 (20 points) A sequence hbn i is defined recursively as

9 10
b0 = , b1 = , and bn = bn 1 bn 2 for n 2.
10 11

(a). [5 points] Using the recursive definition, determine the value of b2 , b3 , and b4 .

(b). [15 points] Prove that for all n 0, the condition 0 < bn 1 holds.

A NSWER :

page 7 of 7

You might also like