Polynomial values free of large prime factors (Q5948355): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1015237700066 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1741449670 / rank | |||
Normal rank |
Latest revision as of 11:11, 30 July 2024
scientific article; zbMATH DE number 1668879
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial values free of large prime factors |
scientific article; zbMATH DE number 1668879 |
Statements
Polynomial values free of large prime factors (English)
0 references
5 November 2001
0 references
Let \(F\) be a polynomial with integer coefficients, let \(g\) be the largest of the degrees of its irreducible factors, and let \(k\) be the number of distinct irreducible factors of \(F\) of degree \(g\). One of the main results in this paper is that, given any positive number \(\varepsilon \), the number of the numbers \(n\leq x\) such that \(F(n)\) is free of prime factors exceeding \(x^{g+\varepsilon -1/k}\) lies between two constant multiples of \(x\). The proof makes use of results due to the third author on the localization of divisors of polynomial values. An analogous result is obtained also on the values \(F(p)\), where \(p\) is restricted to prime numbers.
0 references
integers free of large prime factors
0 references