Scribd
Upload
37 views1 page

Homework Assignment: Course: Discrete Structures: Y. Desmedt October 17, 2016

This homework assignment contains 4 problems: 1) Use properties of Fibonacci numbers to prove a relationship between Fibonacci and integer factors. 2) Use induction to show that an expression involving factorials and a sum of integers is always an integer. 3) Use induction to prove an inequality involving a multiplication of consecutive integers up to n. 4) Solve two exercises from Discrete Mathematics and Its Applications, with the problems worth double the usual grade.

Uploaded by

Achut Cherukuri
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
37 views1 page

Homework Assignment: Course: Discrete Structures: Y. Desmedt October 17, 2016

This homework assignment contains 4 problems: 1) Use properties of Fibonacci numbers to prove a relationship between Fibonacci and integer factors. 2) Use induction to show that an expression involving factorials and a sum of integers is always an integer. 3) Use induction to prove an inequality involving a multiplication of consecutive integers up to n. 4) Solve two exercises from Discrete Mathematics and Its Applications, with the problems worth double the usual grade.

Uploaded by

Achut Cherukuri
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/ 1

Homework assignment: course:

Discrete Structures
Y. Desmedt
October 17, 2016

This homework is due by 10am on October 31, 2016.

Problem 1 Preliminary comment: From Exc. 2, p. 379, we learned that:

∀m ≥ 0 ∀l ≥ m + 1 : fl = fm+1 ∗ fl−m + fm ∗ fl−(m+1) , (1)

where fl is the l − th Fibonacci number, where f0 = 0, f1 = 1, etc.


Use Eqn. 1 to prove that:

∀k ≥ 1 ∀l ≥ 1 : fl | fk∗l .

Explain why for this problem, you did not use general induction.

Problem 2 (The maximum grade of this problem is worth 2 times


the usual.)
Consider any set {a1 , a2 , ..., an } of nonnegative integers. Use any form of
induction to show that the expression

(a1 + a2 + · · · + an )!
X=
(a1 !) · (a2 !) · · · (an !)
is an integer.

Problem 3 (The maximum grade of this problem is worth 4 times


the usual.)
Use any form of induction to show the following:
v s
u
√
u r q
∀m ≥ 1∀m ≤ n : m (m + 1) (m + 2) (m + 3) · · ·
t
n<m+1

Problem 4 Solve the following problem from Discrete Mathematics and Its
Applications, by Kenneth H. Rosen, McGraw Hill, Seventh edition.
(The maximum grade of all the following problems are worth 2
times the usual.)

• Exc. 14, p. 358

• Exc. 36, p. 380

You might also like