Scribd
Upload
15 views2 pages

Fall 2024 Math 1101 DS - HW2 - Deadline Nov 11 - 2024

Uploaded by

Toğrul Quluzadə
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
15 views2 pages

Fall 2024 Math 1101 DS - HW2 - Deadline Nov 11 - 2024

Uploaded by

Toğrul Quluzadə
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/ 2

Fall 2024 - Discrete Structures.

HW2 (0.2 pt for each task)


Deadline is November 11, 2024, 23:59
Upload a pdf version of the solutions file into BB.
Name of the file: “Name_Surname_Fall 24_DS_HW2_CRN_xxx.pdf”
TOPICS: Mathematical Induction (MI), Strong induction (SI),
Structural Induction

IMPORTANT!!! (Late submission will result in a 0.5 point deduction per


day.)

Student MUST upload (submit) HW2 into BB.


How to prepare HW2 for the submission.
1. Student must prepare handwritten solution of each task from HW2. At the top of
page 1 you have to write the following text
__________________________________________________________________________

Name, Surname, Name of Program (i.e. computer science, math, EEE, etc.).
Fall 24, Discrete Structures

HW2
_________________________________________________________________________

2. Please insert page numbers in your HW2


3. Prepare multipage pdf version (file) of your paper. To perform this job, you
can use any mobile application to scan your handwritten document.
Name of your pdf file: Name_Surname_Fall 24_DS_HW2_CRN_xxx.pdf
_________________________________________________________________________
Tasks (based on Lectures 6 and 7).

Task 1. Use MI to prove that if h>−1, then 1+nh≤(1+h)n for all nonnegative integers n.
Task 2. Prove that 3n<n! if n is an integer greater than 6. Use MI.
Task 3. Prove that 1·1!+2·2!+…+n·n! = (n+1)!−1 whenever n is a positive integer. Use MI.
Task 4. Prove that a set with n elements has n(n−1)(n−2)/6 subsets containing exactly three elements
whenever n is an integer greater than or equal to 3. Use MI.
Task 5. Use MI to prove that the derivative of f(x)=xn equals nxn−1 whenever n is a positive integer.
Hint. For the inductive step, use the product rule for derivatives.
Task 6. Suppose that m and n are positive integers with m>n and f:{1, 2, ..., m}→{1, 2, ..., n}.
Use MI on the variable n to show that f is not one-to-one.
Fall 24, DS, HW2 Page 1
Task 7. Suppose that a and b are real numbers with 0<b<a. Prove that if n is a positive integer, then
an−bn≤nan−1(a−b).
Task 8. Suppose that we want to prove that for all positive integers n.
1 3 2𝑛 − 1 1
⋅ ⋅ …⋅ <
2 4 2𝑛 √3𝑛
a) Show that if we try to prove this inequality using mathematical induction, the basis step
works, but the inductive step fails.
b) Show that mathematical induction can be used to prove the stronger inequality
1 3 2𝑛 − 1 1
⋅ ⋅…⋅ <
2 4 2𝑛 √3𝑛 + 1
for all n>1, which, together with a verification for the case where n=1, establishes the weaker
inequality we originally tried to prove using mathematical induction.
Task 9. Let P(n) be the statement that a postage of n cents can be formed using just 4-cent stamps
and 7-cent stamps. Use a SI to proof that P(n) is true for n≥18.
Task 10. Prove using SI that every amount of postage of 28 cents or more can be formed using just
5-cent and 8-cent stamps.

Task 11. Let S be the subset of the set of ordered pairs of integers defined recursively by
Basis step: (0, 0)∈S.
Recursive step: If (a, b)∈S, then (a, b+1)∈S, (a+1, b+1)∈S, and (a+2, b+1)∈S.
(a) List the elements of S produced by the first three applications of the recursive definition.
(b) Use strong induction on the number of applications of the recursive step of the definition to show
that a≤2b whenever (a, b)∈S.
c) Use structural induction to show that a≤2b whenever (a, b)∈S
Task 12. Let S be the subset of the set of ordered pairs of integers defined recursively by
Basis step: (0, 0) ∈ S.
Recursive step: If (a, b)∈S, then (a+2, b+3)∈S and (a+3, b+2)∈S.
a) List the elements of S produced by the first four applications of the recursive definition.
b) Use strong induction on the number of applications of the recursive step of the definition to show
that 5|(a+b) when (a, b)∈S.
c) Use structural induction to show that 5 |(a+b) when (a, b) ∈ S.
1 1 1 n
Task 13. Prove: + + ⋯ + (4𝑛−3)∙(4𝑛+1) = . Use MI.
1∙5 5∙9 4𝑛+1
Task 14. Prove that 7n−2n is divisible by 5 for all n ∈ N. Use MI.
Task 15. Prove that n3−4n+6 is divisible by 3 for all n ∈ N. Use MI.

Good Luck.

Fuad bey

Fall 24, DS, HW2 Page 2

You might also like