ics141-lecture15-Primes

ics141-lecture15-Primes - University of Hawaii ICS141:...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
15-1 ICS 141: Discrete Mathematics I (Spr 2008) University of Hawaii ICS141: Discrete Mathematics for Computer Science I Department of Information and Computer Sciences University of Hawaii Stephen Y. Itoga
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
15-2 ICS 141: Discrete Mathematics I (Spr 2008) University of Hawaii Lecture 15 Chapter 3. The Fundamentals 3.5 Primes and Greatest Common Divisors
Background image of page 2
15-3 ICS 141: Discrete Mathematics I (Spr 2008) University of Hawaii Some material in these slides were taken/adapted from the slides made by Prof. Michael P. Frank and Prof. Jonathan L. Gross which are provided through the publisher of “Discrete Mathematics and Its Applications” written by Kenneth H. Rosen. Some slides were made by Prof. Baek
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
15-4 ICS 141: Discrete Mathematics I (Spr 2008) University of Hawaii Review: The mod Operator An integer “division remainder” operator. Let a , d Z with d 1 . Then a mod d denotes the remainder r from the division “algorithm” with dividend a and divisor d ; i.e. the remainder when a is divided by d . Also, a div d
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/12/2008 for the course ICS 141 taught by Professor Idk during the Fall '08 term at Hawaii.

Page1 / 10

ics141-lecture15-Primes - University of Hawaii ICS141:...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online