Implementation of a new primality test

Arjen Lenstra
1987
Article

Résumé

An implementation of the Cohen-Lenstra version (see ibid., vol. 42, p.297-330, 1984) of the Adleman-Pomerance-Rumely primality test (see L.M. Adleman, C. Pomerance and R.S. Rumely, Ann. of Math., vol.117, p.173-206, 1983) is presented. Primality of prime numbers of up to 213 decimal digits can now routinely be proved within approximately ten minutes

Source officielle

https://infoscience.epfl.ch/record/149468?ln=fr

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

A new elementary proof of the Prime Number Theorem

Florian Karl Richter

Let

\Omega(n)

denote the number of prime factors of

n

. We show that for any bounded

f\colon\mathbb{N}\to\mathbb{C}

one has [ \frac{1}{N}\sum_{n=1}^N, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1). ] This yields a ...

2021

A decomposition of multicorrelation sequences for commuting transformations along primes, Discrete Analysis 2021:4, 27 pp. Szemerédi's theorem asserts that for every positive integer

k

and every

\delta>0

there exists

n

such that every subset of ${1, ...

2021

Implementation of a new primality test

The double exponential runtime is tight for 2-stage stochastic ILPs

A new elementary proof of the Prime Number Theorem

The double exponential runtime is tight for 2-stage stochastic ILPs

A new elementary proof of the Prime Number Theorem