En admettant la conjecture de Dickson, nous démontrons que, pour chaque couple d’entiers $q\>0$ et $k\>0$, il existe une partie infinie $L_{q,k}\subset \mathbb{N}$ telle que, pour chacun des entiers $n\in L_{q,k}$ et tout entier $s$ tel que $0\<\left|s\right|\le q$, on ait $n+s=\left|s\right|t_1...t_k$ où $t_1\<...\<t_k$ sont des nombres premiers. De même, pour chaque couple d’entiers $q\>0$ et $k\>0$, il existe une partie infinie $M_{q,k}\subset \mathbb{N}$ telle que, pour chacun des entiers $n\in M_{q,k}$ et tout entier $s$ (nul ou non ) de l’intervalle $\left[-q,q\right]$, on ait $n+s=l{t}_1...t_k$ où $t_1\<...\<t_k$ sont des nombres premiers et l’entier $l$ appartient à l’intervalle $\left[1,2q+1\right]$. La lecture non standard...

Following the line of attack of La Bretèche, Browning and Peyre, we prove Manin's conjecture in its strong form conjectured by Peyre for a family of Châtelet surfaces which are defined as minimal proper smooth models of affine surfaces of the form Y² - aZ² = F(X,1), where a = -1, F ∈ ℤ[x₁,x₂] is a polynomial of degree 4 whose factorisation into irreducibles contains two non-proportional linear factors and a quadratic factor which is irreducible over ℚ [i]. This result...

Let ${𝔖}_n$ denote the symmetric group with $n$ letters, and $g\left(n\right)$ the maximal order of an element of ${𝔖}_n$. If the standard factorization of $M$ into primes is $M=q_1^{{\alpha }_1}{q}_2^{{\alpha }_2}...q_k^{{\alpha }_k}$, we define $\ell \left(M\right)$ to be $q_1^{{\alpha }_1}+q_2^{{\alpha }_2}+...+q_k^{{\alpha }_k}$; one century ago, E. Landau proved that $g\left(n\right)={max}_{\ell \left(M\right)\le n}M$ and that, when $n$ goes to infinity, $logg\left(n\right)\sim \sqrt{nlog\left(n\right)}$.There exists a basic algorithm to compute $g\left(n\right)$ for $1\le n\le N$; its running time is $𝒪\left(N^{3/2}/\sqrt{logN}\right)$ and the needed memory is $𝒪\left(N\right)$; it allows computing $g\left(n\right)$ up to, say, one million. We describe an algorithm to calculate $g\left(n\right)$ for $n$ up to ${10}^{15}$. The main idea is to use the so-called $\ell$-superchampion...

At the 1912 Cambridge International Congress Landau listed four basic problems about primes. These problems were characterised in his speech as “unattackable at the present state of science”. The problems were the following :(1)Are there infinitely many primes of the form $n^2+1$?(2)The (Binary) Goldbach Conjecture, that every even number exceeding 2 can be written as the sum of two primes.(3)The Twin Prime Conjecture.(4)Does there exist always at least one prime between neighbouring squares?All these...

La théorie des nombres premiers généralisés de Beurling fait intervenir $N\left(x\right)$, la fonction de décompte des entiers généralisés, $P\left(x\right)$, celle des nombres premiers généralisés, et $\zeta \left(s\right)$, la fonction dzeta adaptée. Les hypothèses sur $N\left(x\right)$ se traduisent en propriétés de $\zeta \left(s\right)$, qui entraînent ou non le “théorème des nombres premiers” (TNP) $P\left(x\right)\sim x/\log x$ ou “ l’inégalité de Tchebycheff” (IT) $P\left(x\right)=O(x/\log x)$. L’article est consacré au rôle de la fonction $it\zeta (1+it)$, en relation avec les algèbres ${\displaystyle A=ℱL^1\left(ℝ\right),A^{\infty }=\left\{f\underset{y\ge \left|x\right|}{sup}\left|\left(ℱf\right)\left(x\right)\right|\in L^1({ℝ}^{+},dy)\right\}}$ et $H^1=ℱL^2(ℝ,(1+y^2\left)dy\right)$. On montre que l’hypothèse $it\zeta (1+it)\exp (-2|t{|}^{\alpha })\in H^1$ entraîne (TNP) quand $\alpha \<2$ et...

We discuss the notion of a “Level of Distribution” in two settings. The first deals with primes in progressions, and the role this plays in Yitang Zhang’s theorem on bounded gaps between primes. The second concerns the Affine Sieve and its applications.