Page 1 University Of Colorado Boulder Department of Computer ...

Recommend Documents

Announcements o Homework 2 is due by Noon under my office door (or now) o Homework 3 is will be up on Moodle sometime to

Page 1 University Of Colorado Boulder Department of Computer ...

University Of Colorado Boulder. Department of Computer Science. CSC 2824: Discrete Structures. Chris Ketelsen. Lecture 8

Page 1 University Of Colorado Boulder Department of Computer ...

University Of Colorado Boulder. Department of Computer Science. CSC 2824: Discrete Structures. Chris Ketelsen. Lecture 3

Page 1 University Of Colorado Boulder Department of Computer ...

Def: An integer p > 1 is prime if it is only divisible by 1 and itself. Example: 2, 3, 5, 7, and 11 are prime. Def: A

Page 1 University Of Colorado Boulder Department of Computer ...

Example: Suppose I have two bags of marbles containing black and White marbles: Bag 2. NOW Suppose I put the tWO bags in

Page 1 University Of Colorado Boulder Department of Computer ...

University Of Colorado Boulder. Department of Computer Science. CSC 2824: Discrete Structures. Chris Ketelsen. Lecture 1

Page 1 University Of Colorado Boulder Department of Computer ...

Powerball where the White balls are picked at random from a drum that holds 69 balls numbered from 1 to 69. The POWerbal

Page 1 University Of Colorado Boulder Department of Computer ...

The Product Rule: Suppose that a procedure can be broken down into two tasks. If there are n1 ways to do the first task,

Page 1 University Of Colorado Boulder Department of Computer ...

Wow I CANT YOUVE SHOWN THE INCONSISTENCY-DEAR Dr. Knun, IAM WRITING Tocal ECT. PND FAULTWTH AND THUS INNALIDITY-OF BASIC

Page 1 University Of Colorado Boulder Department of Computer ...

The Pigeonhole Principle: If k is a positive integer and k + 1 or more objects are placed into ... As soon as We add 1 m

Page 1 University Of Colorado Boulder Department of Computer ...

University Of Colorado Boulder. Department of Computer Science. CSC 2824: Discrete Structures. Chris Ketelsen. Lecture 5

Page 1 University Of Colorado Boulder Department of Computer ...

Task: Find the largest element in a finite sequence. Example: Given sequence {1, 3, 10, 17, 2,5} return 17. Solution in

Page 1 University Of Colorado Boulder Department of Computer ...

Warm-Up: Solve the congruence 5x E 4 (mod 17) ... When this happens We have a couple of Ways to solve the system ... Sol

Page 1 University Of Colorado Boulder Department of Computer ...

Prove that if we tip over the first domino, the rest of them will fall. Page 3. Mathematical induction. Last time We did

Page 1 University Of Colorado Boulder Department of Computer ...

University Of Colorado Boulder. Department of Computer Science. CSC 2824: Discrete Structures. Chris Ketelsen. Lecture 3

Page 1 University Of Colorado Boulder Department of Computer ...

Example: Consider again this C++ function. In int square(int n) { int s; s = n n; return s : Q: What are the square func

Page 1 University Of Colorado Boulder Department of Computer ...

The most famous sequence is the following: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55. This is the Fibonacci Sequence. It has r

Page 1 University Of Colorado Boulder Department of Computer ...

Example: Suppose the experiment is to roll a die and the event is that an even number is rolled. Find the probability. T

Page 1 University Of Colorado Boulder Department of Computer ...

University Of Colorado Boulder. Department of Computer Science. CSC 2824: Discrete Structures. Chris Ketelsen. Lecture 9

Page 1 University Of Colorado Boulder Department of Computer ...

University Of Colorado Boulder. Department of Computer Science. CSC 2824: Discrete Structures. Chris Ketelsen. Lecture 5

Page 1 University Of Colorado Boulder Department of Computer ...

Department of Computer Science ... of you have not enrolled in the course Moodle page, do so ... There are three conditi

Page 1 University Of Colorado Boulder Department of Computer ...

o Prime Number Sieves, GCDs, and the Euclidean Algorithm o Congruences and the Chinese Remainder Theorem o Cryptography,

Page 1 University Of Colorado Boulder Department of Computer ...

More on Algorithm Complexity + Matrix Operations ... whenever n > k Said out loud: f(n) is big-Omega of g(n)") ... Wa

Page 1 University Of Colorado Boulder Department of Computer ...

Pigeonhole Principle. Example: Show that for any number n there is a multiple of n that has only 0's and 1's in it's dec