Scribd
Upload
49 views

HW8 Key

This homework has 130 total points across two sections. Section 3.4 covers proofs regarding Fibonacci numbers, with problems worth 12 and 30 points. Section 7.1 covers relations and their properties, with problems worth 5, 10, 20, and 5 points each. The document provides the questions and fully worked out solutions.

Uploaded by

Linda Zhang
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
49 views

HW8 Key

This homework has 130 total points across two sections. Section 3.4 covers proofs regarding Fibonacci numbers, with problems worth 12 and 30 points. Section 7.1 covers relations and their properties, with problems worth 5, 10, 20, and 5 points each. The document provides the questions and fully worked out solutions.

Uploaded by

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

ITCS 2175 HW 8 Answer Key

There are 130 points total over the entire homework.

Section 3.4, pp. 270-271, 12, 14


Section 7.1, pp. 480-482, 4, 30, 48e, 54

Section 3.3
12) [30 points]
Prove that f12 + f22 ++ fn2 = fnfn+1 is true for all positive n where fn is the n'th
Fibonacci number.

Basis Step: We will show that the proposition is true for the least element P(1).
f12 = 12 = 11 = f1f2.

Inductive Step: We want to show that P(n) P(n+1).


Assume f12 + f22 ++ fn2 = fnfn+1 is true for any n > 0.
We must show that f12 + f22 ++ fn+12 = fn+1fn+2 is then true.
f12 + f22 ++ fn+12 = [f12 + f22 ++ fn2] + fn+12
= fnfn+1+ fn+12 Using the inductive assumption
= fn+1(fn+ fn+1)
= fn+1fn+2 Using the definition of Fibonacci numbers

This proves that f12 + f22 ++ fn2 = fnfn+1 is true whenever n is a positive integer.

14) [30 points]


Prove that fn+1fn-1 - fn2 = (-1)n whenever n is a positive integer where fn is the n'th
Fibonacci number.

Basis Step: We will show that P(1) is true.


f2f0 - f12 = 10 = (-1)1.

Inductive Step: We want to show that P(n) P(n+1).


Assume fn+1fn-1 - fn2 = (-1)n is true when n is a positive integer.
We must show that fn+2fn - fn+12 = (-1)n+1 is then true.
fn+2fn - fn+12 =( fn+1 + fn)fn - fn+12 Using the definition of fn+2
= fn2 + fn+1fn - fn+12
= fn2 + fn+1(fn - fn+1)
= fn2 - fn+1(fn+1 - fn)
= fn2 - fn+1fn-1 Using the definition of fn+1
= -1 (-1)n Using the inductive assumption
n
= (-1) +1

This proves that fn+1fn-1 - fn2 = (-1)n whenever n is a positive integer.


Section 7.1
4) [5 points each]
a) Antisymmetric and transitive
b) Reflexive, symmetric, and transitive
c) Reflexive, symmetric, and transitive
d) Reflexive and symmetric.

30) [10 points]


S o R = {(1,1),(1,2),(2,1),(2, 2)}

48e) [20 points]


Prove that S o R is reflexive if R and S are reflexive relations on the set A.

Given that R and S are reflexive, a A, (a,a) R and (a,a) S. Then by the definition
of the composite, (a,a) S o R , a A. Thus S o R is reflexive.

54) [5 points each]


Let R be the relation on the set {1,2,3,4,5} containing the ordered pairs:
{(1,1),(1,2),(1,3),(2,3),(2,4),(3,1),(3,4),(3,5),(4,2),(4,5),(5,1),(5,2),(5,4)}

a) R2 = R o R = {(1,1),(1,2),(1,3),(1,4),(1,5),
(2,1),(2,2),(2,4),(2,5),
(3,1),(3,2),(3,3),(3,4),(3,5),
(4,1),(4,2),(4,3),(4,4),
(5,1),(5,2),(5,3),(5,4),(5,5)}

R3 = R oR = {(1,1),(1,2),(1,3),(1,4),(1,5),
2
b)
(2,1),(2,2),(2,3),(2,4),(2,5),
(3,1),(3,2),(3,3),(3,4),(3,5),
(4,1),(4,2),(4,3),(4,4),(4,5),
(5,1),(5,2),(5,3),(5,4),(5,5)} = AA.

c) R4 = R3 = AA.

d) R5 = R4 = AA.

You might also like