Integers modulo a prime form a field
Statement
Let be a prime number. Then the ring of the integers modulo p is a field. That is, each nonzero element of has a multiplicative inverse.
Remarks
The proof: if , then , so . Bézout's identity gives , and then . The converse holds: if is composite, with and , then , so is not a field. The field is often written or . It is the finite field with elements.
Reading path
To understand this page from the ground up, read these 10 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Congruence modulo n definition
- Greatest common divisor definition
- Prime number definition
- Congruence is compatible with addition statement
- Congruence is compatible with multiplication statement
- Residue class definition
- Bézout's identity statement
- Integers modulo n definition
- Integers modulo a prime form a field statement
Further reading
- Web https://en.wikipedia.org/wiki/Finite_field, lead section
About this page
| Tag | 0R8YXRC9AJ |
|---|---|
| URI | m2://0R8YXRC9AJ |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 11A07 |
| Status | This copy of the site has no build data. Run m2 status 0R8YXRC9AJ. |
| Uses | Integers modulo n, Prime number, Bézout's identity |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.