Review Notes for Discrete Mathematics
Review Notes for Discrete Mathematics
11.1: Division and Euclidean Algorithm
Definition of divisibility: if a | b, then there exists and integer c such that b = ac.
For example, 4 | 16 and 6 | 42.
The division algorithms says that when you divide an integer a by an integer b, you will always get a unique quotient q, and remainder r, where q and r are integers such that
a = bq + r, and 0 ................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related searches
- marketing notes for students
- strategic management notes for mba
- great job notes for students
- medical student notes for billing
- doctor notes for work
- school notes for students
- thank you notes for service provided
- encouraging notes for students
- discrete mathematics symbols meaning
- discrete mathematics symbols
- interest factors for discrete compounding
- standard deviation for discrete data