MTH 311 Problem Set 1: Mathematical Proofs and Inductions, Assignments of Advanced Calculus

Problems from a university-level mathematics course, specifically from mth 311. The problems cover various topics such as even and odd numbers, fibonacci numbers, harmonic numbers, and mathematical induction. Students are asked to prove statements using direct methods and contradiction, as well as to use mathematical induction to establish identities.

Typology: Assignments

Pre 2010

Uploaded on 08/30/2009

koofers-user-0vw
koofers-user-0vw 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
MTH 311, Problems Type II, set 1, discussed 10/3
1. Exercises from the textbook: Note: Numbers like 1.1/7/p.11 refer to the
exercise #7 listed after Section 1.1 of the textbook on p.11.
1.1/2,10/p.12
1.2/6/p.17.
1.3/1,9/p.23
1.4/1,9/p.32.
2. Show by a direct method:
A: For all integers kand l, if k, l are both even, then kl is even.
Is the converse true ? If yes, prove it. If not, try to formulate a correct
statement which will use “if kl is even” as its hypothesis. Can you weaken
the hypothesis of A ?
3. Prove by contradiction:
B: For all integers kand l, if kl is odd, then k, l are both odd.
4. Try proving A by contradiction and B by a direct method.
5. Fibonacci numbers {Fn}nare defined as follows F0= 0, F1= 1 and
Fn=Fn1+Fn2, for n2. Show using mathematical induction that
Pn
i=1 F2
i=FnFn+1, for n1.
6. Harmonic numbers {Hn}nare defined as follows Hn= 1 + 1/2 + · · · 1/n.
Show that 1 + n/2H2n1 + n.
7. For what nis it true that 2n< n! ? Replace 2 by kand answer the same
question. Prove a general statement by induction.
8. Prove that for any n14, ncan be written as a sum of 3’s and/or of 8’s
(with no regard to order).
1

Partial preview of the text

Download MTH 311 Problem Set 1: Mathematical Proofs and Inductions and more Assignments Advanced Calculus in PDF only on Docsity!

MTH 311, Problems Type II, set 1, discussed 10/

  1. Exercises from the textbook: Note: Numbers like 1.1/7/p.11 refer to the exercise #7 listed after Section 1.1 of the textbook on p.11. - 1.1/2,10/p. - 1.2/6/p.17. - 1.3/1,9/p. - 1.4/1,9/p.32.
  2. Show by a direct method: A: For all integers k and l, if k, l are both even, then kl is even. Is the converse true? If yes, prove it. If not, try to formulate a correct statement which will use “if kl is even” as its hypothesis. Can you weaken the hypothesis of A?
  3. Prove by contradiction: B: For all integers k and l, if kl is odd, then k, l are both odd.
  4. Try proving A by contradiction and B by a direct method.
  5. Fibonacci numbers {Fn}n are defined as follows F 0 = 0, F 1 = 1 and F∑nn = Fn− 1 + Fn− 2 , for n ≥ 2. Show using mathematical induction that i=1 F^ i^2 =^ FnFn+1, for^ n^ ≥^ 1.
  6. Harmonic numbers {Hn}n are defined as follows Hn = 1 + 1/2 + · · · 1 /n. Show that 1 + n/ 2 ≤ H 2 n^ ≤ 1 + n.
  7. For what n is it true that 2n^ < n!? Replace 2 by k and answer the same question. Prove a general statement by induction.
  8. Prove that for any n ≥ 14, n can be written as a sum of 3’s and/or of 8’s (with no regard to order).