【算法基础】数字的基本性质

Properties of Integers

Well Ordering Principle

Every nonempty set of positive integers contains a smallest member

Division Algorithm

Let $a$ and $b$ be integers with $b>0$. Then there exist unique integers $q$ and $r$ with property that $a=bq+r$, where $0\le r<b$.

GCD Is a Linear Combination

Definition Greatest Common Divisor, Relatively Prime Integers

The greatest common divisor of two nonzero integers a and b is the largest of all common divisions of a and b. We denote this integer by $gcd(a,b)$. When $gcd(a,b)=1$, we say $a$ and $b$ are relatively prime.

Theory

For any nonzero integers $a$ and $b$, there exist integers $s$ and $t$ such that $gcd(a,b)=as+bt$. Moreover, $gcd(a,b)$ is the smallest positive integer of the form $as+bt$.

Corollary

If $a$ and $b$ are relatively prime, then exist integers $s$ and $t$ such that $as+bt=1$.

Euclid’s Lemma $p|ab$ implies $p|a$ or $p|b$

If $p$ is a prime that divides $ab$, then $p$ divides $a$ or $p$ divides $b$.

Fundamental Theory of Arithmetic

Every integer greater than $1$ is a prime or a product of primes. This product is unique, except for the order in which the factors appear. That is, if $n=p_1{p}_1\cdot \cdot \cdot p_r$ and $n=q_1{q}_2\cdot \cdot \cdot q_s$, where the $p^{\prime }s$ and the $q^{\prime }s$ are primes, then $r=s$ and, after renumbering the $q^{\prime }s$, we have $p_i=q_i$ for all $i$.