**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept# Number theory

Summary

Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics." Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example, rational numbers), or defined as generalizations of the integers (for example, algebraic integers).
Integers can be considered either in themselves or as solutions to equations (Diophantine geometry). Questions in number theory are often best understood through the study of analytical objects (for example, the Riemann zeta function) that encode properties of the integers, primes or other number-theoretic objects in some fashion (analytic number theory). One may also study real numbers in relation to rational numbers, for example, as approximat

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading

Related publications (30)

Related people (2)

Loading

Loading

Loading

Related concepts (226)

Mathematics

Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These top

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. F

Field (mathematics)

In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined and behave as the corresponding operations on rational and real numbers do. A field is thus

Related courses (32)

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, discrete structures & algorithmic thinking.

COM-401: Cryptography and security

This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how they work and sketch how they can be implemented.

MATH-313: Introduction to analytic number theory

The aim of this course is to present the basic techniques of analytic number theory.

Related units (2)

Related lectures (39)

Let K be a field with char(K) ≠ 2. The Witt-Grothendieck ring (K) and the Witt ring W (K) of K are both quotients of the group ring ℤ[𝓖(K)], where 𝓖(K) := K*/(K*)2 is the square class group of K. Since ℤ[𝓖(K)] is integral, the same holds for (K) and W(K). The subject of this thesis is the study of annihilating polynomials for quadratic forms. More specifically, for a given quadratic form φ over K, we study polynomials P ∈ ℤ[X] such that P([φ]) = 0 or P({φ}) = 0. Here [φ] ∈ (K) denotes the isometry class and {φ} ∈ W(K) denotes the equivalence class of φ. The subset of ℤ[X] consisting of all annihilating polynomials for [φ], respectively {φ}, is an ideal, which we call the annihilating ideal of [φ], respectively {φ}. Chapter 1 is dedicated to the algebraic foundations for the study of annihilating polynomials for quadratic forms. First we study the general structure of ideals in ℤ[X], which later on allows us to efficiently determine complete sets of generators for annihilating ideals. Then we introduce a more natural setting for the study of annihilating polynomials for quadratic forms, i.e. we define Witt rings for groups of exponent 2. Both (K) and W(K) are Witt rings for the square class group 𝓖(K). Studying annihilating polynomials in this more general setting relieves us to a certain extent from having to distinguish between isometry and equivalence classes of quadratic forms. In Section 1.1 we study the structure of ideals in R[X], where R is a principal ideal domain. For an ideal I ⊂ R[X] there exist sets of generators, which can be obtained in a natural way by considering the leading coefficients of elements in I. These sets of generators are called convenient. By discarding super uous elements we obtain modest sets of generators, which under certain assumptions are minimal sets of generators for I. Let G be a group of exponent 2. In Section 1.2 we study annihilating polynomials for elements of ℤ[G]. With the help of the ring homomorphisms Hom(ℤ[G],ℤ) it is possible to completely classify annihilating polynomials for elements of ℤ[G]. Note that an annihilating polynomial for an element f ∈ ℤ[G] also annihilates the image of f in any quotient of ℤ[G]. In particular, Witt rings for G are quotients of ℤ[G]. In Section 1.3 we use the ring homomorphisms Hom(ℤ[G],ℤ) to describe the prime spectrum of ℤ[G]. The obtained results can then be employed for the characterisation of the prime spectrum of a Witt ring R for G. Section 1.4 is dedicated to proving the structure theorems for Witt rings. More precisely, we generalise the structure theorems for Witt rings of fields to the general setting of Witt rings for groups of exponent 2. Section 1.5 serves to summarise Chapter 1. If R is a Witt ring for G, then we use the structure theorems to determine, for an element x ∈ R, the specific shape of convenient and modest sets of generators for the annihilating ideal of x. In Chapter 2 we study annihilating polynomials for quadratic forms over fields. More specifically, we first consider fields K, over which quadratic forms can be classified with the help of the classical invariants. Calculations involving these invariants allow us to classify annihilating ideals for isometry and equivalence classes of quadratic forms over K. Then we apply methods from the theory of generic splitting to study annihilating polynomials for excellent quadratic forms. Throughout Chapter 2 we make heavy usage of the results obtained in Chapter 1. Let K be a field with char(K) ≠ 2. Section 2.1 constitutes an introduction to the algebraic theory of quadratic forms over fields. We introduce the Witt-Grothendieck ring (K) and the Witt ring W(K), and we show that these are indeed Witt rings for 𝓖(K). In addition we adapt the structure theorems to the specific setting of quadratic forms. In Section 2.2 we introduce Brauer groups and quaternion algebras, and in Section 2.3 we define the first three cohomological invariants of quadratic forms. In particular we use quaternion algebras to define the Clifford invariant. In Section 2.4 we begin our actual study of annihilating polynomials for quadratic forms. Henceforth it becomes necessary to distinguish between isometry and equivalence classes of quadratic forms. We start by classifying annihilating ideals for quadratic forms over fields K, for which (K) and W(K) have a particularly simple structure. Subsequently we use calculations involving the first three cohomological invariants to determine annihilating ideals for quadratic forms over a field K such that I3(K) = {0}, where I(K) ⊂ W(K) is the fundamental ideal. Local fields, which are a special class of such fields, are studied in Section 2.5. By applying the Hasse-Minkowski Theorem we can then determine annihilating ideals of quadratic forms over global fields. Section 2.6 serves as an introduction to the elementary theory of generic splitting. In particular we introduce Pfister neighbours and excellent quadratic forms, which are the subjects of study in Section 2.7. We use methods from generic splitting to study annihilating polynomials for Pfister neighbours. The obtained result can be applied inductively to obtain annihilating polynomials for excellent quadratic forms. We conclude the section by giving an alternative, elementary approach to the study of annihilating polynomials for excellent forms, which makes use of the fact that (K) and W(K) are quotients of ℤ[𝓖(K)].

Since the discovery of the utility of the numbers, the human being tried to differentiate them. We decide between them according to whether they are even or odd. Or, according to the fact that they are prime or composite. A natural number n >1 is called a prime number if it has no positive divisors other than 1 and n. Therefore, other numbers that are not prime have other divisors. That is why we call them composite numbers because we can write them : n = p*q with {p,q} ≠ {1,n}. The problem has always been to decide whether a number is prime or not. To answer this problem, many algorithms have been created like the Trial Division. It uses the property which says that the biggest divisor of n is smaller or equal to the square root of n. But for numbers that exceed 30 digits, it will take more than 10^13 years to know the answer. So, the interest would be to create an algorithm using mathematical bases which would answer to this question as fast as possible. This is what we will see in this project. The study of prime numbers became really important to code texts. Cryptography is one of the most important application of prime numbers theory. At the beginning, it was only used to code texts during the wars and more recently it was used for other applications, like the security of an account. Fist of all, I will focus on randomized algorithms for primality testing. Then, I will focus on a deterministic algorithm that I have implemented.

2006We consider the variational problem of finding the longest closed curves of given minimal thickness on the unit sphere. After establishing the existence of solutions for any given thickness between 0 and 1, we explicitly construct for each given thickness Theta(n) := sin pi/(2n), n is an element of N, exactly phi(n) solutions, where. is Euler's totient function from number theory. Then we prove that these solutions are unique, and also provide a complete characterisation of sphere filling curves on the unit sphere; that is of those curves whose spherical tubular neighbourhood completely covers the surface area of the unit sphere exactly once. All of these results carry over to open curves as well, as indicated in the last section.