English
Related papers

Related papers: Power-Free Values of Polynomials

200 papers

For irreducible integer polynomials $f(n)=n^d+c$ we prove an asymptotic formula for the number of $k$-th power free values taken by $f(n)$, for $n$ running up to $x$, subject to the condition $k\ge (5d+3)/9$. This improves earlier results…

Number Theory · Mathematics 2011-03-11 D. R. Heath-Brown

We establish asymptotic formulae for the number of $k$-free values of polynmilas $F(x_1,\cdots,x_n)\in\mathbb{Z}[x_1,\cdots,x_n]$ of degree $d\geq 2$ for any $n\geq 1$, including when the variables are prime, as long as $k\geq (3d+1)/4$.…

Number Theory · Mathematics 2019-08-15 Kostadinka Lapkova , Stanley Yao Xiao

We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct…

Number Theory · Mathematics 2017-01-20 Andrew Booker , Tim Browning

Let f be a cubic polynomial. Then there are infinitely many primes p such that f(p) is square-free.

Number Theory · Mathematics 2007-06-12 Harald Andres Helfgott

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Number Theory · Mathematics 2014-07-21 David Krumm

Let k, r > 1 be two integers. We prove an asymptotic formula for the number of k-free values of the r variables polynomial t_1...t_r - 1 over the integral points of [1, x]^r.

Number Theory · Mathematics 2012-04-03 Pierre Le Boudec

Let $f\in \mathbb{Z}\lbrack x\rbrack$ be a polynomial of degree $d\geq 3$ without roots of multiplicity $d$ or $(d-1)$. Erd\H{o}s conjectured that, if $f$ satisfies the necessary local conditions, then $f(p)$ is free of $(d-1)$th powers for…

Number Theory · Mathematics 2007-07-04 H. A. Helfgott

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…

Number Theory · Mathematics 2015-06-02 Guy Lando

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Kenneth Ward

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

Number Theory · Mathematics 2020-04-02 Biswajit Koley , A. Satyanarayana Reddy

In this paper we prove that polynomials $F(x_1, \cdots, x_n) \in \mathbb{Z}[x_1, \cdots, x_n]$ of degree $d \geq 3$, satisfying certain hypotheses, take on the expected density of $(d-1)$-free values. This extends the authors' earlier…

Number Theory · Mathematics 2020-06-01 Kostadinka Lapkova , Stanley Yao Xiao

Let f\in Z[x], deg(f)=3. Assume that f does not have repeated roots. Assume as well that, for every prime q, the inequality f(x)\not\equiv 0 mod q^2 has at least one solution in (Z/q^2 Z)^*. Then, under these two necessary conditions, there…

Number Theory · Mathematics 2014-07-21 H. A. Helfgott

Let a be an integer and q a prime number. In this paper, we find an asymptotic formula for the number of positive integers n < x with the property that no divisor d > 1 of n lies in the arithmetic progression a modulo q.

Number Theory · Mathematics 2007-05-23 William D. Banks , John B. Friedlander , Florian Luca

Let $p$ be a prime and $b(x)$ be an irreducible polynomial of degree $k$ over $\mathbb{F}_p$. Let $d\geq 1$ be an integer. Consider the following question: Is $b(x^d)$ irreducible? We derive necessary conditions for $b(x^d)$ to be…

Number Theory · Mathematics 2016-04-29 Palash Sarkar , Shashank Singh

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Number Theory · Mathematics 2008-11-26 Xiang-dong Hou , Gary L. Mullen

Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…

Number Theory · Mathematics 2026-01-21 Biao Wang , Shaoyun Yi

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

Number Theory · Mathematics 2017-05-17 A. J. Irving

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Number Theory · Mathematics 2019-08-15 Sam Porritt

Building upon the work of A. Booker and C. Pomerance (2017), we prove that for a prime power $q \geq 7$, every residue class modulo an irreducible polynomial $F \in \mathbb{F}_q[X]$ has a non-constant, square-free representative which has…

Number Theory · Mathematics 2022-01-28 Christian Bagshaw

In a recent paper, we considered integers n for which the polynomial x^n - 1 has a divisor in Z[x] of every degree up to n, and we gave upper and lower bounds for their distribution. In this paper, we consider those n for which the…

Number Theory · Mathematics 2012-06-19 Lola Thompson
‹ Prev 1 2 3 10 Next ›