Entier naturel

Résumé

En mathématiques, un entier naturel est un nombre permettant fondamentalement de compter des objets considérés comme des unités équivalentes : un jeton, deux jetons… une carte, deux cartes, trois cartes… Un tel nombre entier peut s'écrire avec une suite finie de chiffres en notation décimale positionnelle (sans signe et sans virgule). L’étude des entiers naturels est l’objet de l’arithmétique, branche des mathématiques, constituée dès l'Antiquité grecque. Chaque nombre entier a un successeur unique, c'est-à-dire un entier qui lui est immédiatement supérieur, et la liste des entiers naturels est infinie. Les définitions modernes d’entier naturel sont fondées sur :

l’axiomatisation de l’arithmétique réalisée par Peano et Dedekind à la fin du ;
la construction d’ensembles vérifiant les axiomes de l’arithmétique : Ernst Zermelo, quand il a axiomatisé la théorie des ensembles, a montré que les entiers naturels pouvaient être définis en termes ensemblistes (on utilise aujourd'hui le

Source officielle

https://fr.wikipedia.org/wiki/Entier_naturel

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (29)

Publications associées

Chargement

Personnes associées

Chargement

Unités associées

Chargement

Concepts associés (181)

Concepts associés

Chargement

Cours associés (56)

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.

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.

Ce cours couvre les fondements des systèmes numériques. Sur la base d'algèbre Booléenne et de circuitscombinatoires et séquentiels incluant les machines d'états finis, les methodes d'analyse et de synthèse de systèmelogiques sont étudiées et appliquée

Afficher plus

Cours associés

Chargement

Séances de cours associées (155)

Séances de cours associées

Chargement

Primality Testing

Kamal Tahiri Jouti

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.

2006

Chargement

Le carré de la fonction des diviseurs

Nicolas Bersier

Let d(n) denote Dirichlet's divisor function for positive integer numbers. This work is primarily concerned with the study of We are interested, in the error term where Ρ3 is a polynomial of degree 3 ; more precisely xΡ3(log x) is the residue of in s = 1. A. Ivić showed that E(x) = Ο(x1/2+ε) for all ε > 0 (cf. [9], p.394). We will prove that for all x > 0, we have With this intention, we apply Perron's formula to the generating function ζ4(s)/ ζ (2s) and Landau's finite difference method. It was conjectured that E(x) = Ο(x1/4+ε) for ε > 0. The existence of non-trivial zeros of the Riemann ζ function implies that we cannot do better, that is The study of the Riesz means for ρ sufficiently large shows that their error term, is an infinite series , on the zeros of the Riemann Zeta function added with a development , into a series of Hardy-Voronoï's type, both being convergent. To find the "meaning" of , one could consider the difference But the series (probably) doesn't converge.We will thus substract only a finite part of , weighted by a smooth function ω, the number of terms of the finite part depending on x. If we consider this new error term , we obtain, using a classical method due to Hardy, that for x ≥ 1.

EPFL2007

Chargement

Every Elementary Higher Topos Has A Natural Number Object

Nima Rasekh

We prove that every elementary (infinity, 1)-topos has a natural number object. We achieve this by defining the loop space of the circle and showing that we can construct a natural number object out of it. Part of the proof involves showing that various definitions of natural number objects (Lawvere, Freyd and Peano) agree with each other in an elementary (infinity, 1)-topos. As part of this effort we also study the internal object of contractibility in (infinity, 1)-categories, which is of independent interest. Finally, we discuss various applications of natural number objects. In particular, we use it to define internal sequential colimits in an elementary (infinity, 1)-topos.

2021

Chargement