Lecture

Complex Numbers: Gauss Numbers

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture explores the concept of Gaussian integers, introduced by Gauss, where prime numbers in the set of natural numbers may not remain prime when considering complex numbers with integer coefficients. The lecture delves into the definition of Gaussian integers, their properties, and the factorization of numbers of this type. Through examples, it illustrates how certain prime numbers can be factorized in the Gaussian integers set, highlighting the distinction between primes that remain prime and those that do not. Additionally, it discusses a theorem in number theory that determines which prime numbers can be expressed as the sum of two integer squares.

Official source

Related concepts (30)

Prime number

A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4.

Eisenstein integer

In mathematics, the Eisenstein integers (named after Gotthold Eisenstein), occasionally also known as Eulerian integers (after Leonhard Euler), are the complex numbers of the form where a and b are integers and is a primitive (hence non-real) cube root of unity. The Eisenstein integers form a triangular lattice in the complex plane, in contrast with the Gaussian integers, which form a square lattice in the complex plane. The Eisenstein integers are a countably infinite set.

Quadratic integer

In number theory, quadratic integers are a generalization of the usual integers to quadratic fields. Quadratic integers are algebraic integers of degree two, that is, solutions of equations of the form x2 + bx + c = 0 with b and c (usual) integers. When algebraic integers are considered, the usual integers are often called rational integers. Common examples of quadratic integers are the square roots of rational integers, such as , and the complex number i = , which generates the Gaussian integers.

Gaussian integer

In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as or Gaussian integers share many properties with integers: they form a Euclidean domain, and have thus a Euclidean division and a Euclidean algorithm; this implies unique factorization and many related properties. However, Gaussian integers do not have a total ordering that respects arithmetic.

Algebraic integer

In algebraic number theory, an algebraic integer is a complex number which is integral over the integers. That is, an algebraic integer is a complex root of some monic polynomial (a polynomial whose leading coefficient is 1) whose coefficients are integers. The set of all algebraic integers A is closed under addition, subtraction and multiplication and therefore is a commutative subring of the complex numbers. The ring of integers of a number field K, denoted by OK, is the intersection of K and A: it can also be characterised as the maximal order of the field K.

Related lectures (46)

Basic Properties MOOC: Analysis I MOOC: Analysis I (part 1): Prelude, basic concepts, real numbers

Covers basic properties of natural numbers, including order relations and inverses.

Elementary Algebra: Numeric Sets

Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.

Generator of a Group

Explores checking a generator of a group, the Diffie-Hellman key exchange, and cryptographic algorithms.

Arithmetic Fundamentals: Equivalence and Irreducibility

Covers the fundamental theorem of arithmetic, focusing on equivalence and irreducibility of integers.

Temporal Complexity: Concrete Example MOOC: Information, Computation, Communication: Introduction to computational thinking