Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Mathematical Induction Proofs, Assignments of Mathematical Methods for Numerical Analysis and Optimization

Solutions to assignment #1 problems in math 315. The proofs use mathematical induction to establish statements about sequences and numbers. Topics include the truth of certain statements for all natural numbers, the recursive definition of a sequence, and the irrationality of specific numbers.

Typology: Assignments

Pre 2010

Uploaded on 07/23/2009

koofers-user-y4a
koofers-user-y4a ๐Ÿ‡บ๐Ÿ‡ธ

10 documents

1 / 2

Toggle sidebar

Related documents


Partial preview of the text

Download Mathematical Induction Proofs and more Assignments Mathematical Methods for Numerical Analysis and Optimization in PDF only on Docsity! Assignment #1 โ€” Solutions Math 315. III.4 For each n โˆˆ IN consider the statement Pn : 7 + 11 + 15 + ยท ยท ยท + (3 + 4n) = 2n2 + 5n. We claim that Pn is true for all n โˆˆ IN. Use induction. (B) 7 = 2 ยท 12 + 5, so P1 is true. (IS) Let n โˆˆ IN and assume that Pn is true. Then 7 + 11 + 15 + ยท ยท ยท+ (3 + 4n) + (3 + 4(n + 1)) (IH)= 2n2 + 5n + (3 + 4(n + 1)) = 2n2 + 9n + 7 = (2n2 + 4n + 2) + (5n + 5) = 2(n + 1)2 + 5(n + 1) So by induction Pn is true for all n โˆˆ IN. III.7 Given that s1 = 1 and sn+1 = sn + 3n for all n โˆˆ IN, we claim that Pn : sn = (3n โˆ’ 1)/2 for all n โˆˆ IN. We use induction. (B) s1 = 1 = (31 โˆ’ 1)/2, so P1 is true. (IS) Let n โˆˆ IN and assume that sn = (3n โˆ’ 1)/2. Then, first using recursion, we have sn+1 = sn + 3n (IH) = (3n โˆ’ 1)/2 + 3n = (3n โˆ’ 1 + 2 ยท 3n)/2 = (3 ยท 3n โˆ’ 1)/2 = (3n+1 โˆ’ 1)/2 So, by induction, Pn is true for all n โˆˆ IN. S1. Use Mathematical Induction to prove that 5n โˆ’ 2n is divisible by 3 for all n โˆˆ IN. Let Pn be the statement that 5n โˆ’ 2n = 3m for some m โˆˆ IN. Using induction we prove that Pn is true for all n โˆˆ IN. (B) 51 โˆ’ 21 = 3 = 3 ยท 1, so P1 is true. (IS) Let n โˆˆ IN and assume that 5n โˆ’ 2n = 3m for some m โˆˆ IN. Then, we have 5n+1 โˆ’ 2n+1 = 5n+1 โˆ’ 5(2n) + 5(2n)โˆ’ 2n+1 = 5(5n โˆ’ 2n) + 2n(5โˆ’ 2) (IH) = 5(3m) + 2n ยท 3 = 3(5m + 2n) so Pn+1 is true and the proof is complete by induction. S2. Prove that each of the following real numbers is irrational: (a) r = 3 โˆš 5; Assume that r = 3 โˆš 5 is rational, so r = m/n with m,n โˆˆ IN relatively prime. Then r3 = 5 or m3 = 5n3, so that m = 5k for some k โˆˆ IN. Thus, m3 = 53k3 = 5n3 and n3 = 52k3. But then n = 5h for some h โˆˆ IN which is contrary to the fact that m and n are relatively prime. Therefore, our original assumption must be wrong and so r is not rational. [Alternate Proof.] By Theorem 2.2 if r = m/n (in lowest terms) is a rational root of x3 โˆ’ 5 = 0, then m is a factor of 5 and n is a factor of 1; that is, m = ยฑ1 or ยฑ5 and n = ยฑ1. But, trivially, none of ยฑ1 or ยฑ5 is a root of x3 โˆ’ 5 = 0, so no rational number is 3 โˆš 5.
Docsity logo



Copyright ยฉ 2024 Ladybird Srl - Via Leonardo da Vinci 16, 10126, Torino, Italy - VAT 10816460017 - All rights reserved