How many primes can divide the values of a polynomial?

DOI10.4064/AA156-1-3zbMATH Open1271.11089OpenAlexW2317695325MaRDI QIDQ4649926FDOQ4649926

Florian Luca, Paul Pollack

Publication date: 15 November 2012

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/aa156-1-3

zbMATH Keywords

subspace theoremhypothesis Hnumber of prime factors

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Primes represented by polynomials; other multiplicative structures of polynomial values (11N32) Approximation to algebraic numbers (11J68)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On a problem of Oppenheim concerning Factorisatio Numerorum 👍 👎
• A divisibility theorem for factorials 👍 👎
• On arithmetical properties of solutions of norm equations 👍 👎
• On the factorization of \(f(n)\) for \(f(x)\) in \(\mathbb Z[x\)] 👍 👎
• The distribution of the number of factors in a factorization 👍 👎
• On the number of factorizations of an integer 👍 👎

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)