Racine carrée de deux

Résumé

La racine carrée de deux, notée (ou parfois 2), est définie comme le seul nombre réel positif qui, lorsqu’il est multiplié par lui-même, donne le nombre 2, autrement dit × = 2. C’est un nombre irrationnel, dont une valeur approchée à 10 près est : : ≈ 1,414 213 562. vignette|L’hypoténuse d’un triangle rectangle isocèle de côté 1 vaut . Le calcul d’une valeur approchée de a été un problème mathématique pendant des siècles. Ces recherches ont permis de perfectionner les algorithmes de calculs d’extraction de racines carrées. En informatique, ces recherches se sont poursuivies afin d’optimiser ces algorithmes en réduisant les temps de calcul et la consommation de mémoire. Géométriquement, est le rapport de la diagonale d'un carré sur son côté, dit autrement le rapport de l’hypoténuse d’un triangle rectangle isocèle sur l'un des côtés de l'angle droit, ce qui est un cas particulier du théorème de Pythagore. Le nombre est connu depuis longtemps : en Mésopotamie, les scribes savai

Source officielle

https://fr.wikipedia.org/wiki/Racine_carr%C3%A9e_de_deux

À 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 (25)

Publications associées

Chargement

Personnes associées (2)

Personnes associées

Chargement

Unités associées (1)

Unités associées

Chargement

Concepts associés (54)

Concepts associés

Chargement

Cours associés (23)

Cours associés

Chargement

Séances de cours associées (29)

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

Fourier Interpolation From Spheres

Martin Peter Stoller

In every dimension d >= 2, we give an explicit formula that expresses the values of any Schwartz function on R-d only in terms of its restrictions, and the restrictions of its Fourier transform, to all origin-centered spheres whose radius is the square root of an integer. We thus generalize an interpolation theorem by Radchenko and Viazovska [Publ. Math. Inst. Hautes Etudes Sci. 129 (2019), pp. 51-81] to higher dimensions. We develop a general tool to translate Fourier uniqueness and interpolation results for radial functions in higher dimensions, to corresponding results for non-radial functions in a fixed dimension. In dimensions greater or equal to 5, we solve the radial problem using a construction closely related to classical Poincare series. In the remaining small dimensions, we combine this technique with a direct generalization of the Radchenko-Viazovska formula to higher-dimensional radial functions, which we deduce from general results by Bondarenko, Radchenko and Seip [Fourier interpolation with zeros of zeta and L-functions, arXiv:2005.02996, 2020]

AMER MATHEMATICAL SOC2021

Chargement

Let K be a finite extension of Q(p), let L/K be a finite abelian Galois extension of odd degree and let D-L be the valuation ring of L. We define A(L/K) to be the unique fractional D-L-ideal with square equal to the inverse different of L/K. For p an odd prime and L/Q(p) contained in certain cyclotomic extensions, Erez has described integral normal bases for A(L)/Q(p) that are self-dual with respect to the trace form. Assuming K/Q(p) to be unramified we generate odd abelian weakly ramified extensions of K using Lubin-Tate formal groups. We then use Dwork's exponential power series to explicitly construct self-dual integral normal bases for the square-root of the inverse different in these extensions. (C) 2009 Elsevier Inc. All rights reserved.

2009

Chargement