Well-Ordering Principle

 Let  $ \mathbb{Z}$ denotes set of all integers, that is, $\mathbb{Z} = \{\dots,~ -4,~-3,~-2,~-1,~0,~1,~2,~3,~4,~ \cdots\}$ and $\mathbb{Z}^{+}$ denotes set of all nonnegative integers, that is, $\mathbb{Z}^{+} = \{0,~1,~2,~3,~4,~ \cdots\}$. 


 Well-Ordering Principle: Every nonempty set $S$ of a nonnegative integers contains a least element; that is, there exists integer $a \in S$ such that $a \leq b$ for all $b \in S$.

If we take set $S = \{8,~ 5, ~90, ~3, ~29, ~57\}$. One can observe that $S$ is nonempty and $S \subseteq \mathbb{Z}^{+}$ and $3 \in S$ such that $3$ is less than or equal to all other elements of $S$. So that $3$ is the least element of $S$.




Popular posts from this blog

Definition of divisibility and Theorem on divisibility

The Division Algorithm / Prove that given integers $a$ and $b$, with $b > ~ 0$, there exist unique integers $q$ and $r$ such that $a = b \cdot q +r$, where $0 \leq r < b$. The integer $q$ is called the $\textbf{quotient}$ and the integer $r$ is called $\textbf{remainder}$.

Define Greatest Common Divisor and Prove that if $a$ and $b$ are any integers, not both of them are zero. Then there exist integers $x$ and $y$ such that $gcd(a, b) =a \cdot x + b \cdot y$.