Discrete Mathematics Math 6A Homework 8 Solution.

Slides:



Advertisements
Similar presentations
Discrete Mathematics Math 6A Homework 9 Solution.
Advertisements

22C:19 Discrete Math Sequence and Sums Fall 2011 Sukumar Ghosh.
MA/CSSE 473/474 How (not) to do an induction proof.
1 Mathematical Induction. 2 Mathematical Induction: Example  Show that any postage of ≥ 8¢ can be obtained using 3¢ and 5¢ stamps.  First check for.
Induction Sections 41. and 4.2 of Rosen Fall 2008 CSCE 235 Introduction to Discrete Structures Course web-page: cse.unl.edu/~cse235 Questions:
Induction Sections 4.1 and 4.2 of Rosen Fall 2010
1 Intro to Induction Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
Kavita Hatwal Fall Sequences and Induction.
1 Mathematical Induction. 2 Mathematical Induction: Example  Show that any postage of ≥ 8¢ can be obtained using 3¢ and 5¢ stamps.  First check for.
CSE115/ENGR160 Discrete Mathematics 03/22/12 Ming-Hsuan Yang UC Merced 1.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 12 Number theory Mathematical induction Proof by induction Examples.
CSS342: Induction1 Professor: Munehiro Fukuda. CSS342: Induction2 Today’s Topics Review of sequence and summations Mathematical induction Strong form.
Geometry Warm ups.
CSE115/ENGR160 Discrete Mathematics 03/29/11 Ming-Hsuan Yang UC Merced 1.
1 Strong Mathematical Induction. Principle of Strong Mathematical Induction Let P(n) be a predicate defined for integers n; a and b be fixed integers.
1 Mathematical Induction. 2 Mathematical Induction: Example  Show that any postage of ≥ 8¢ can be obtained using 3¢ and 5¢ stamps.  First check for.
MATHEMATICS INDUCTION AND BINOM THEOREM By : IRA KURNIAWATI, S.Si, M.Pd.
What it is? Why is it a legitimate proof method? How to use it?
Recursive Definitions and Structural Induction
ICS 253 Presents Mathematical Induction Sultan Almuhammadi muhamadi
Lecture 9. Arithmetic and geometric series and mathematical induction
Chapter 6 Mathematical Induction
Lecture 3.1: Mathematical Induction CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.
CSNB143 – Discrete Structure Topic 5 – Induction Part I.
Discrete Mathematics Tutorial 11 Chin
Math 140 Quiz 6 - Summer 2004 Solution Review (Small white numbers next to problem number represent its difficulty as per cent getting it wrong.)
My clicker is working. (T/F/not sure). I’m a vegetarian. (T/F/not sure)
Properties of Real Numbers. Properties of Addition & Multiplication: For all real #’s, a, b, c… Closure: then a+b is a real number ab is a real number.
Relations & Their Properties: Selected Exercises.
1 Recursive Definitions and Structural Induction CS 202 Epp section ??? Aaron Bloomfield.
MAT 2720 Discrete Mathematics Section 2.2 More Methods of Proof Part II
1+2+3+…+n = n(n+1)/2 We want to prove the above statement by mathematical Induction for all natural numbers (n=1,2,3,…) Next SlideSlide 1.
CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction Linda Shapiro Winter 2015.
PreAP Computer Science Quiz
CS Discrete Mathematical Structures Mehdi Ghayoumi MSB rm 132 Ofc hr: Thur, 9:30-11:30a.
Quiz 7 The way I expected it.. How to do it! 1. Let P(n) be the statement that n 2 = n(n + 1)(2n + 1)/6 for the positive integer n. Be.
UCI ICS/Math 6D, Fall Induction-1 Induction Let P(n) be a predicate (“propositional function”) regarding integers n≥n 0 for some n 0 (typically.
Jessie Zhao Course page: 1.
1 Discrete Mathematical Mathematical Induction ( الاستقراء الرياضي )
6/12/2016 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(2) Mathematical Induction & Recursion Dr.Saad Alabbad Department of.
1 Recursive Definitions and Structural Induction CS/APMA 202 Rosen section 3.4 Aaron Bloomfield.
Mathematical Induction EECS 203: Discrete Mathematics Lecture 11 Spring
Mathematical Induction And Recursion Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Mathematical Induction I Lecture 19 Section 4.2 Mon, Feb 14, 2005.
Презентацию подготовила Хайруллина Ч.А. Муслюмовская гимназия Подготовка к части С ЕГЭ.
1 Section 4.4 Inductive Proof What do we believe about nonempty subsets of N? Since  N, <  is well-founded, and in fact it is linear, it follows that.
11.7 – Proof by Mathematical Induction
Using Number Sense to Solve One-Step Equations
CSE15 Discrete Mathematics 03/22/17
Using Number Sense to Solve One-Step Equations
Find the equation of the tangent line for y = x2 + 6 at x = 3
Visit for more Information: %284PK%29+-+New+Compatible+Inkjet+Cartridges.
CSE 311: Foundations of Computing
CSNB 143 Discrete Mathematical Structures
BACK SOLUTION:
CSE373: Data Structures and Algorithms Lecture 2: Proof by Induction
The Derivative as a Function
BaSIC Math Reviews.
Notes 9.5 – Mathematical Induction
Exercise Use mathematical induction to prove the following formula.
Lesson 11 – Proof by induction
Lecture 3.1: Mathematical Induction
Follow me for a walk through...
Mathematical Induction
Mathematical Induction
Follow me for a walk through...
MATHEMATICAL INDUCTION
BETONLINEBETONLINE A·+A·+
Agenda Proofs (Konsep Pembuktian) Direct Proofs & Counterexamples
Lecture 3.1: Mathematical Induction
Presentation transcript:

Discrete Mathematics Math 6A Homework 8 Solution

3.2-2 a)128 b) 7 c) 2 d) a)a0=2, a1=3, a2=5, a3=9 b)a0=1, a1=4, a2=27, a3=256 c)a0=0, a1=0, a2=1, a3=1 d)a0=0, a1=1, a2=2, a3= a) =20 b)1-2+4=8+16=11 c) = 10*3 = 30 d)(2-1)+(4-2)+(8-4)+...+( ) = 511

a) =10 b){(3^9-1)/(3-2)} – {(2^9-1)/(2-1)} = 9330 c)(2*(3^9)-2)/(3-1) – (3*(2^9)-3)/(2-1) = d)2^9 – 2^0 = a)200*201/2 – 99*100/2 = ^2*201^2/4 – 98^2*99^2/4 = 380,477,799

a)countable: 1  > -1, 2  > -2, 3  > b)countable: 1  >0, 2  >2, 3  > -2, 4  >4,... c)not countable d)countable Yes, not countable p(n)=3+3* *5^n = (5^n+1 -1)/4 p(0) = 3 p(k+1) = 3+3* *5^k + 3*5^k+1 = (5^k+2 -1)/4 p(k+1) = 3*(5^k+1-1)/4 + 3*5^k+1 = (5^k+2 -1)/ p(n)=2-2*7 + 2*7^ (-7)^n = (1-(-7)^n+1)/4 p(0) = 2 p(k+1) = 2-2*7 + 2*7^ (-7)^k + 2(-7)^k+1 = (1-(-7)^k+2)/4 p(k+1) = (1-(-7)^k+1)/4 + 2*(-7)^k+1 = (1-(-7)^k+2)/ p(n) = ½ + 4/1 + 1/ ½^n = 2^n-1/2^n p(1)=1/2 p(k+1)= 2^(k+1)-1/2^(k+1) p(k+1) = 2^k-1/2^k – ½^(k+1)= 2^(k+1)-1/2^(k+1)

3.3-6 p(n) = 1/1*2 + 1/2*3 +...*1/n*(n+1) = n/n+1 p(1)=1/2 p(k+1) = k+1/k+2 p(k+1) = k/k+1 + 1/(k+1)(k+2) = k+1/k n=5  2^5 = 32 > 5^2=25 Assume that 2^k > k^2 and want to derive the statement that 2^(k+1) > (k+1)^2 (k+1)^2 = k^2 +2k + 1 < k^2 +2k + k = k^2 +3k < k^2 +k^2. Thus (k+1)^2 = 2k^2 < 2*2^k p(n)=1*2 + 2* n(n+1) = n(n+1)(n+2)/3 p(1) = 2=2 p(k+1) = {1*2 + 2* k(k+1)}+(k+1)(k+2) = (k+1)(k+2)(k+3)/3 p(k+1) = k(k+1)(k+2)/3 + (k+1)(k+2) = (k+1)(k+2)(k+3)/3

(x  y)  z = (x  z)  (y  z) p(n) = (A1  A2 ...  An)  B= (A1  B)  (A2  B) ...  (An  B) p(1) = (A1  B) p(n+1) = (A1  A2 ...  An  An+1)  B = {(A1  B)  (A2  B) ...  (An  B)}  (An+1  B) = (A1  B)  (A2  B) ...  (An  B)  (An+1  B)