{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

ics141-lecture15-Primes

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

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

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

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

View Full Document
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
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

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

View Full Document
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
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### 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
Ask a homework question - tutors are online