How many primes can divide the values of a polynomial?
From MaRDI portal
Recommendations
- On arithmetical properties of solutions of norm equations
- A divisibility theorem for factorials
- On the factorization of \(f(n)\) for \(f(x)\) in \(\mathbb Z[x]\)
- scientific article; zbMATH DE number 7306636
- On a problem of Oppenheim concerning Factorisatio Numerorum
- scientific article; zbMATH DE number 2063250
- scientific article; zbMATH DE number 4173122
- The distribution of the number of factors in a factorization
- scientific article; zbMATH DE number 1789700
- On the number of factorizations of an integer
Cited in
(12)- An asymptotic formula for the number of smooth values of a polynomial
- Prime and coprime values of polynomials
- Common divisors of totients of polynomial sequences
- \(S\)-parts of values of univariate polynomials
- scientific article; zbMATH DE number 4173122 (Why is no real title available?)
- scientific article; zbMATH DE number 3899010 (Why is no real title available?)
- On f(n) modulo Ω(n) and ω(n) when f is a polynomial
- Number of prime divisors and subgroup chains
- Polynomial values free of large prime factors
- The number of prime factors in h-free and h-full polynomials over function fields
- Andrzej Schinzel selecta. Volume I: Diophantine problems and polynomials. Volume II: Elementary, analytic and geometric number theory. Edited by Henryk Iwaniec, Władysław Narkiewicz and Jerzy Urbanowicz
- Sur une question d'Erdős et Schinzel. II. (On a question of Erdős and Schinzel. II)
This page was built for publication: How many primes can divide the values of a polynomial?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649926)
