You have already added 0 works in your ORCID record related to the merged Research product.
You have already added 0 works in your ORCID record related to the merged Research product.
Sur une question d'Erdős et Schinzel
Sur une question d'Erdős et Schinzel
document différent de la version publiée: de nombreuses erreurs typographiques introduites après l'envoi des épreuves ont été corrigées.; Let F(n) denote a polynomial with integer coefficients and define H_F(x,y,z) to be the number of integers not exceeding x for which F(n) has at least one divisor d such that y
- Cambridge University Press United Kingdom
- Université Paris Diderot France
- French Institute for Research in Computer Science and Automation France
- Cambridge University Press United States
Microsoft Academic Graph classification: Combinatorics Mathematics
polynomial values, sieve, Chebyshev problem, 11N32, divisors in an interval, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT], largest prime factor
polynomial values, sieve, Chebyshev problem, 11N32, divisors in an interval, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT], largest prime factor
Microsoft Academic Graph classification: Combinatorics Mathematics
1612
[5] P. Erd˝os, On the greatest prime factor of f (k), J. London Math. Soc. 27 (1952), 379-384.
[6] P. Erd˝os et A. Schinzel, On the greatest prime factor of kx=1 f (k), Acta Arith. 55, no. 2, 191-200.
[7] H. Halberstam et H.-E. Richert, Sieve Methods, Academic Press, London, NewYork, San Francisco (1974).
[8] R.R. Hall et G. Tenenbaum, Divisors, Cambridge Tracts no 90, Cambridge University Press (1988).
[9] C. Hooley, On the greatest prime factor of a quadratic polynomial, Acta Math. 117 (1967), 2-16. [OpenAIRE]
[10] C. Hooley, Applications of sieve methods to the theory of numbers, Cambridge Tracts no 70, Cambridge University Press (1976).
[11] E. Landau, Einfu¨hrung in die elementa¨re und analytische Theorie der algebraischen Zahlen, Teubner, Leipzig (1927) ; r´eimpression : Chelsea, New York (1949).
[12] S. Lang, Algebraic Number Theory, Addison-Wesley, Reading, Menlo Park, London, Don Mills (1970).
[13] H. Maier et G. Tenenbaum, On the set of divisors of an integer, Invent. Math. 76 (1984), 121-128. [OpenAIRE]
[14] A. A. Markov, U¨ber die Primteiler der Zahlen von der Form 1 + 4x2, Bull. Acad. Sci. St. Petersburg, 3 (1895), 55-59.
- 1
- 2
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).9 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).9 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!- Cambridge University Press United Kingdom
- Université Paris Diderot France
- French Institute for Research in Computer Science and Automation France
- Cambridge University Press United States
document différent de la version publiée: de nombreuses erreurs typographiques introduites après l'envoi des épreuves ont été corrigées.; Let F(n) denote a polynomial with integer coefficients and define H_F(x,y,z) to be the number of integers not exceeding x for which F(n) has at least one divisor d such that y