Skip to Content
Concrete Mathematics: A Foundation for Computer Science, 2nd Edition
book

Concrete Mathematics: A Foundation for Computer Science, 2nd Edition

by Ronald L. Graham, Donald E. Knuth, Oren Patashnik
February 1994
Intermediate to advanced content levelIntermediate to advanced
672 pages
18h 51m
English
Addison-Wesley Professional
Content preview from Concrete Mathematics: A Foundation for Computer Science, 2nd Edition

4

Number Theory

Integers are central to the discrete mathematics we are emphasizing in this book. Therefore we want to explore the theory of numbers, an important branch of mathematics concerned with the properties of integers.

We tested the number theory waters in the previous chapter, by introducing binary operations called ‘mod’ and ‘gcd’. Now let’s plunge in and really immerse ourselves in the subject.

In other words, be prepared to drown.

4.1 Divisibility

We say that m divides n (or n is divisible by m) if m > 0 and the ratio n/m is an integer. This property underlies all of number theory, so it’s convenient to have a special notation for it. We therefore write

(The notation ‘m|n’ is actually much more common than ‘m\n’ in current mathematics ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Grokking Algorithms, Second Edition

Grokking Algorithms, Second Edition

Aditya Bhargava
Algorithms: 24-part Lecture Series

Algorithms: 24-part Lecture Series

Robert Sedgewick, Kevin Wayne

Publisher Resources

ISBN: 9780134389974Purchase book