22C:19 Discrete Math Advanced Counting Fall 2010 Sukumar Ghosh.

Slides:



Advertisements
Similar presentations
Tower of Hanoi Tower of Hanoi is a mathematical puzzle invented by a French Mathematician Edouard Lucas in The game starts by having few discs stacked.
Advertisements

22C:19 Discrete Structures Advanced Counting Spring 2014 Sukumar Ghosh.
Chapter Recurrence Relations
22C:19 Discrete Math Sets and Functions Fall 2011 Sukumar Ghosh.
Chapter 6 Advanced Counting 6.1 Recurrence Relations.
What is Compound Interest? Compound interest is interest that is compounded at certain intervals or earned continuously (all the time). Annually: A = P(1.
CS 2210 (22C:19) Discrete Structures Advanced Counting
Use of Computer Technology in Education Course Management Systems Learning Management Systems Classroom Teaching Technology Modeling and Simulation and.
CSE115/ENGR160 Discrete Mathematics 04/21/11 Ming-Hsuan Yang UC Merced 1.
Recursion.
1 Section 6.1 Recurrence Relations. 2 Recursive definition of a sequence Specify one or more initial terms Specify rule for obtaining subsequent terms.
6.Advanced Counting Techniques 1 Copyright M.R.K. Krishna Rao 2003 Ch 6. Recurrence Relations A recurrence relation for the sequence {a n } is an equation.
Financial Algebra © 2011 Cengage Learning. All Rights Reserved. Slide COMPOUND INTEREST FORMULA Become familiar with the derivation of the compound.
7-8 simple and compound interest
22C:19 Discrete Math Induction and Recursion Fall 2011 Sukumar Ghosh.
1. Definitions for Savings Account 2. Common Compounding Periods 3. New from Previous Balance 4. Present and Future Value 5. Simple Interest 6. Effective.
EXAMPLE 5 Find the balance in an account You deposit $4000 in an account that pays 2.92% annual interest. Find the balance after 1 year if the interest.
Recursively Defined Sequences Lecture 35 Section 8.1 Wed, Mar 23, 2005.
Applied Discrete Mathematics Week 9: Relations
Advanced Counting Techniques
Notes Over 7 – 8 1. Suppose you deposit $1000 in a savings account that earns 6% per year. Find the interest earned in two years. Simple Interest Formula.
Periodic Compound Interest. Annual Compound Interest.
Computer Science: A Structured Programming Approach Using C1 6-9 Recursion In general, programmers use two approaches to writing repetitive algorithms.
13.2 Recursive Definitions Objective 1) Provide the recursive definition for sequences; 2) Identify the type of a sequence from a recursive definition.
CSE 2813 Discrete Structures Recurrence Relations Section 6.1.
Module #20 - Recurrences 1 Ch. 7 Recurrence Relations Rosen 6 th ed., §§7.1.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 5 Recurrence Relations.
2 pt 3 pt 4 pt 5pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2pt 3 pt 4pt 5 pt 1pt 2pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4pt 5 pt 1pt Evaluate Separate the log Write as.
Module #1 - Logic 1 Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank and Modified By Mingwu Chen Recurrence.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Notes Over 7 – 7 Solve for the indicated variable.
Java Programming: Guided Learning with Early Objects Chapter 11 Recursion.
6.5 Applications of the Definite Integral. In this section, we will introduce applications of the definite integral. Average Value of a Function Consumer’s.
after UCI ICS/Math 6A, Summer AdvancedCounting -1 Recurrence Relations (RRs) A “Recurrence Relation”
Chapter 6.1: Recurrence Relations Discrete Mathematical Structures: Theory and Applications.
Hanoi Towers Big Oh Recursion Data Structures and Algorithms CS 244 Brent M. Dingle, Ph.D. Department of Mathematics, Statistics, and Computer Science.
Recursion. The Fibonacci sequence presented in 1201 by Leonardo Fibonacci is one of the most famous. It looks like this 1, 1, 2, 3, 5, 8, 13, 21, 34,
7-7 Simple and Compound Interest. Definitions Left side Principal Interest Interest rate Simple interest Right side When you first deposit money Money.
CHAPTER TWO RECURRENCE RELATION
Discrete Mathematics Chapter 6 Advanced Counting Techniques.
COMP 170 L2 L11: Recursion, Recurrence, and Induction l Objective n Recursion  A problem solving technique that reduces big problems into smaller ones.
Warm - Up A = d(1+r a )[(1+r a ) nt – 1] r a If you deposit $50 every quarter in an account that pays 5% interest compounded quarterly what will your balance.
1 In this puzzle, the player begins with n disks of decreasing diameter placed one on top of the other on one of three pegs of the game board. The player.
Tower of Hanoi Tower of Hanoi is a mathematical puzzle invented by a French Mathematician Edouard Lucas in The game starts by having few discs stacked.
Recursively Defined Sequences Lecture 40 Section 8.1 Wed, Apr 11, 2007.
Interest Applications - To solve problems involving interest.
1 Towers of Hanoi Three pegs, one with n disks of decreasing diameter; two other pegs are empty Task: move all disks to the third peg under the following.
Discrete Math For Computing II. Contact Information B. Prabhakaran Department of Computer Science University of Texas at Dallas Mail Station EC 31, PO.
Tower of Hanoi problem: Move the pile of rings from one peg to another
EXAMPLE 5 Find the balance in an account
Compound Interest.
8.3 Compound Interest HW: (1-21 Odds, Odds)
Applied Discrete Mathematics Week 11: Relations
Introduction to Recurrence Relations
Examples Compound Interest
Discrete Math (2) Haiming Chen Associate Professor, PhD
Examples Compound Interest
Tower of Hanoi problem: Move the pile of rings from one peg to another
The Hanoi Tower Problem
CS 2210 Discrete Structures Advanced Counting
Tower of Hanoi Algorithm
Recursion.
1A Recursively Defined Functions
Chapter 7 Advanced Counting Techniques
Recurrence Relations.
Warm up honors algebra 2 3/7/19
Recurrence Relations Rosen 5th ed., §6.2 5/22/2019
ICS 253: Discrete Structures I
Tower of Hanoi problem: Move the pile of rings from one peg to another
Recursively Defined Sequences
Presentation transcript:

22C:19 Discrete Math Advanced Counting Fall 2010 Sukumar Ghosh

Compound Interest A person deposits $10,000 in a savings account that yields 10% interest annually. How much will be there in the account After 30 years? Let P n = account balance after n years. Then P n = P n P n-1 = 1.1P n-1 Note that the definition is recursive. Can you compute the value of P 30

Tower of Hanoi Transfer these disks from one peg to another. However, at no time, a disk should be placed on another disk of smaller size. Start with 64 disks. When You have finished transferring them one peg to another, the world will end.

Tower of Hanoi Let, H n = number of moves to transfer n disks. Then H n = 2H n-1 +1 Can you solve this and compute H 64 ?