In number theory, given a prime number p, the p-adic numbers form an extension of the rational numbers which is distinct from the real numbers, though with some similar properties; p-adic numbers can be written in a form similar to (possibly infinite) decimals, but with digits based on a prime number p rather than ten, and extending (possibly infinitely) to the left rather than to the right. Formally, given a prime number p, a p-adic number can be defined as a series where k is an integer (possibly negative), and each is a integer such that A p-adic integer is a p-adic number such that In general the series that represents a p-adic number is not convergent in the usual sense, but it is convergent for the p-adic absolute value where k is the least integer i such that (if all are zero, one has the zero p-adic number, which has 0 as its p-adic absolute value). Every rational number can be uniquely expressed as the sum of a series as above, with respect to the p-adic absolute value. This allows considering rational numbers as special p-adic numbers, and alternatively defining the p-adic numbers as the completion of the rational numbers for the p-adic absolute value, exactly as the real numbers are the completion of the rational numbers for the usual absolute value. p-adic numbers were first described by Kurt Hensel in 1897, though, with hindsight, some of Ernst Kummer's earlier work can be interpreted as implicitly using p-adic numbers. Roughly speaking, modular arithmetic modulo a positive integer n consists of "approximating" every integer by the remainder of its division by n, called its residue modulo n. The main property of modular arithmetic is that the residue modulo n of the result of a succession of operations on integers is the same as the result of the same succession of operations on residues modulo n. If one knows that the absolute value of the result is less than n/2, this allows a computation of the result which does not involve any integer larger than n.

About this result
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.
Ontological neighbourhood
Related courses (32)
MATH-417: Number theory II.b - selected topics
This year's topic is "Additive combinatorics and applications." We will introduce various methods from additive combinatorics, establish the sum-product theorem over finite fields and derive various a
MATH-494: Topics in arithmetic geometry
P-adic numbers are a number theoretic analogue of the real numbers, which interpolate between arithmetics, analysis and geometry. In this course we study their basic properties and give various applic
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 a
Show more
Related lectures (64)
P-adic Numbers: Completion and Norm
Explores the definition of Q_p and the completion of Q,1(p) to form Qp.
Conductor of X: Waldsparger Formula and Subconvexity Bound
Covers the equidistribution of representations of integers by ternary forms and the conductor of X.
Relations in Computer Science
Explores the properties of relations in computer science, including equivalence relations and the partition of a set.
Show more
Related publications (33)

BPS invariants from p-adic integrals

Dimitri Stelio Wyss, Francesca Carocci, Giulio Orecchia

We define p-adic BPS or pBPS invariants for moduli spaces M-beta,M-chi of one-dimensional sheaves on del Pezzo and K3 surfaces by means of integration over a non-archimedean local field F. Our definition relies on a canonical measure mu can on the F-analyt ...
Cambridge Univ Press2024

Unlikely intersections on the p-adic formal ball

Vlad Serban

We investigate generalizations along the lines of the Mordell-Lang conjecture of the author's p-adic formal Manin-Mumford results for n-dimensional p-divisible formal groups F. In particular, given a finitely generated subgroup (sic) of F(Q(p)) and a close ...
SPRINGER INT PUBL AG2023

BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications

Ngoc Khanh Karol Nguyen

We give a construction of an efficient one-out-of-many proof system, in which a prover shows that he knows the pre-image for one element in a set, based on the hardness of lattice problems. The construction employs the recent zero-knowledge framework of Ly ...
SPRINGER INTERNATIONAL PUBLISHING AG2022
Show more
Related concepts (48)
Inverse limit
In mathematics, the inverse limit (also called the projective limit) is a construction that allows one to "glue together" several related objects, the precise gluing process being specified by morphisms between the objects. Thus, inverse limits can be defined in any although their existence depends on the category that is considered. They are a special case of the concept of in category theory. By working in the , that is by reverting the arrows, an inverse limit becomes a direct limit or inductive limit, and a limit becomes a colimit.
Algebraic number field
In mathematics, an algebraic number field (or simply number field) is an extension field of the field of rational numbers such that the field extension has finite degree (and hence is an algebraic field extension). Thus is a field that contains and has finite dimension when considered as a vector space over . The study of algebraic number fields, and, more generally, of algebraic extensions of the field of rational numbers, is the central topic of algebraic number theory.
Bézout's identity
In mathematics, Bézout's identity (also called Bézout's lemma), named after Étienne Bézout, is the following theorem: Here the greatest common divisor of 0 and 0 is taken to be 0. The integers x and y are called Bézout coefficients for (a, b); they are not unique. A pair of Bézout coefficients can be computed by the extended Euclidean algorithm, and this pair is, in the case of integers one of the two pairs such that and equality occurs only if one of a and b is a multiple of the other.
Show more

Graph Chatbot

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.