Abstract Algebra: Preliminaries

From Department of Mathematics at UTSA

Revision as of 08:44, 18 November 2021 by Lila (talk | contribs) (→‎Natural numbers)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Contents

1 Natural numbers
- 1.1 Well-ordering principle
- 1.2 Induction
2 Integers
3 Division algorithm
4 Congruence modulo m
5 Algebra on $\mathbb {Z} _{m}$
6 GCD, LCM, and Bézout's identity
7 Primes
- 7.1 Euclid's Lemma
8 Fundamental Theorem of Arithmetic
9 Licensing

Natural numbers

Well-ordering principle

Induction

Integers

Division algorithm

Congruence modulo m

Algebra on $\mathbb {Z} _{m}$

GCD, LCM, and Bézout's identity

Primes

Euclid's Lemma

Fundamental Theorem of Arithmetic

Licensing

Content obtained and/or adapted from:

[] under a CC BY-SA license

Retrieved from "https://mathresearch.utsa.edu/wiki/index.php?title=Abstract_Algebra:_Preliminaries&oldid=4000"