Théorème de Brun-Titchmarsh; application au théorème de Fermat. (French) Zbl 0557.10035

Denote by \(A^*_ a(x,\delta)\) the number of primes \(p\leq x\) with \(p\equiv 2 mod 3\) for which the greatest prime factor of p-a exceeds \(x^{\delta}\). It is immediate that \(A^*_ 1(x,\delta)=\sum_{x^{\delta}<p\leq x}\pi^*(x,p)\), in the notation of the preceding review. The author proves that \[ A_ a(x,\delta) \gg x/\log x\quad if\quad x>x_ 0, \] \(x_ 0\) and the implied constant depending on a and \(\delta\), for \(\delta =0.6687..\). \((>2/3)\). This is the criterion required for the application to Fermat’s last theorem reviewed above. Similar results with smaller values of \(\delta\) had been obtained by the present author [Acta Arith. 43, 417-424 (1984; Zbl 0514.10035)], J.-M. Deshouillers and H. Iwaniec [Topics in classical number theory, Colloq. Budapest 1981, Vol. I, Colloq. Math. Soc. János Bolyai 34, 319-333 (1984; Zbl 0548.10026)], and by earlier workers.
Following a method of Chebyshev as developed by C. Hooley [Mathematika 20, 135-143 (1973; Zbl 0288.10013)], where a result was obtained for any \(\delta <5/8\), it is necessary to study the quantity \(\pi (x,q,a)=| \{p; p\leq x, p\equiv a mod q\}|\) with a view to obtaining estimates of the type \(\pi (x,q,a)\leq \{C(\theta)x\}/\{\phi (q) \log x\}\) for ”almost all” q between \(x^{\theta}\) and \(2x^{\theta}\). This is then followed by an integration; the requirement is \(\int_{<\theta <\delta}C(\theta) d\theta <\). The author’s methods, which are highly technical, lead to particularly significant improvements in the available C(\(\theta)\) for values of \(\theta\) nearer to \(1/2\).
Reviewer: G.Greaves


11N35 Sieves
11D41 Higher degree equations; Fermat’s equation
Full Text: DOI EuDML


[1] Bombieri, E., Friedlander, J., Iwaniec, H.: Primes in arithmetic progressions tolarge moduli (à paraître) · Zbl 0588.10042
[2] Deshouillers, J.-M., Iwaniec, H.: Kloosterman sums and Fourier coefficients of cusp forms. Invent. Math.70, 219-288 (1982) · Zbl 0502.10021
[3] Deshouillers, J.-M., Iwaniec, H.: On the Brun-Titchmarsh theorem on average. Janos Bolyai Conf. 1981 (à paraître) · Zbl 0548.10026
[4] Fouvry, E.: Répartition des suites dans les progressions arithmétiques, Résultats du type Bombieri-Vinogradov avec exposant supérieur à 1/2. Thése de Doctorat d’Etat, Université de Bordeaux I (1981)
[5] Fouvry, E.: Répartition des suites dans les progressions arithmétiques. Acta Arith.41, 359-382 (1982) · Zbl 0469.10028
[6] Fouvry, E.: Autour du théorème de Bombieri-Vinogradov. Acta Math.152, 219-244 (1984) · Zbl 0552.10024
[7] Fouvry, E.: Sur le théorème de Brun-Titchmarsh. Acta Arith.43, 417-424 (1984) · Zbl 0514.10035
[8] Fouvry, E., Iwaniec, H.: On a theorem of Bombieri-Vinogradov type. Mathematika27, 135-152 (1980) · Zbl 0469.10027
[9] Fouvry, E., Iwaniec, H.: Primes in arithmetic progressions. Acta Arith.42, 197-218 (1983) · Zbl 0517.10045
[10] Heath-Brown, D.R.: Prime numbers in short intervals and a generalized Vaughan identity. Can. J. of Math.34, 1365-1377 (1982) · Zbl 0494.10027
[11] Hooley, C.: On the largest prime factor ofp+a. Mathematika20, 135-143 (1973) · Zbl 0288.10013
[12] Iwaniec, H.: The half dimensional sieve. Acta Arith.29, 69-95 (1976) · Zbl 0327.10046
[13] Iwaniec, H.: A new form of the error term in thelinear sieve. Acta Arith.37, 307-321 (1980) · Zbl 0444.10038
[14] Iwaniec, H.: On the Brun-Titchmarsh Theorem. J. Math. Soc. of Japan34, 95-123 (1982) · Zbl 0486.10033
[15] Ribenboim, P.: 13 lectures on Fermat’s last Theorem. Berlin-Heidelberg-New York: Springer 1979 · Zbl 0456.10006
[16] Tenenbaum, G.: Sur la probabilité qu’un entier possède un diviseur dans un intervalle donné. Comp. Math.51, 243-263 (1984) · Zbl 0541.10038
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.