English
Related papers

Related papers: Almost-Prime Polynomials with Prime Arguments

200 papers

Let $S$ be a domain and $R=S[t;\sigma,\delta]$ a skew polynomial ring, where $\sigma$ is an injective endomorphism of $S$ and $\delta$ a left $\sigma$ -derivation. We give criteria for skew polynomials $f\in R$ of degree less or equal to…

Rings and Algebras · Mathematics 2021-04-22 Christian Brown , Susanne Pumpluen

Let $k\geq 2$ and $\mathcal{P} (n) = (A_1 n + B_1 ) \cdots (A_k n + B_k)$ where all the $A_i, B_i$ are integers. Suppose that $\mathcal{P} (n)$ has no fixed prime divisors. For each choice of $k$ it is known that there exists an integer…

Number Theory · Mathematics 2022-03-18 Paweł Lewulis

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

Number Theory · Mathematics 2018-11-21 Domingo Gómez-Pérez , László Mérai , Igor E. Shparlinski

Let $p$ be a prime number and let $S=\{x^p+c_1,\dots,x^p+c_r\}$ be a finite set of unicritical polynomials for some $c_1,\dots,c_r\in\mathbb{Z}$. Moreover, assume that $S$ contains at least one irreducible polynomial over $\mathbb{Q}$. Then…

Number Theory · Mathematics 2023-08-29 Wade Hindes , Reiyah Jacobs , Benjamin Keller , Albert Kim , Peter Ye , Aaron Zhou

Consider polynomials over ${\rm GF}(2)$. We describe efficient algorithms for finding trinomials with large irreducible (and possibly primitive) factors, and give examples of trinomials having a primitive factor of degree $r$ for all…

Number Theory · Mathematics 2021-05-18 Richard P. Brent , Paul Zimmermann

We study how often exceptional configurations of irreducible polynomials over finite fields occur in the context of prime number races and Chebyshev's bias. In particular, we show that three types of biases, which we call "complete bias",…

Number Theory · Mathematics 2024-03-05 Alexandre Bailleul , Lucile Devin , Daniel Keliher , Wanlin Li

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

Number Theory · Mathematics 2021-07-12 Asif Zaman

In the present paper we investigate the relations between irreducible slice algebraic sets in $\mathbb{H}^n$ and quasi prime right ideals of the ring of slice regular polynomials in $n$ quaternionic variables. We provide algebraic…

Algebraic Geometry · Mathematics 2025-09-16 Anna Gori , Giulia Sarfatti , Fabio Vlacci

The Schinzel Hypothesis is a conjecture about irreducible polynomials in one variable over the integers: under some standard condition, they should assume infinitely many prime values at integers. We consider a relative version: if the…

Number Theory · Mathematics 2020-02-13 Arnaud Bodin , Pierre Dèbes , Salah Najib

We show that finite quasisimple groups of Lie type in characteristic $p$ with an irreducible representation of prime degree $r$ over a finite field of characteristic $p$ have orders bounded above by a function of $r$, independent of $p$. We…

Group Theory · Mathematics 2026-01-06 D. L. Flannery , A. E. Zalesski

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

Number Theory · Mathematics 2019-07-31 Simone Ugolini

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

Number Theory · Mathematics 2016-03-29 Andreas O. Bender , Olivier Wittenberg

In 2002, M.Ram Murty showed that if p is a prime with k-adic expansion :$p = \sum_{i = 0}^n a_i k^i$ , then the polynomial $f(x) = \sum_{i = 0}^n a_ix^i$ is irreducible in $\mathbb{Z}[x]$.When $k = 10$ , it's a result of A.Cohn. I think…

General Mathematics · Mathematics 2023-03-01 Boyang Zhao

Using an explicit version of Selberg's upper sieve, we obtain explicit upper bounds for the number of $n\leq x$ such that a non-empty set of irreducible polynomials $F_i(n)$ with integer coefficients are simultaneously prime; this set can…

Number Theory · Mathematics 2022-11-22 Matteo Bordignon , Ethan Simpson Lee

Let a polynomial $f \in \mathbb{Z}[X_1,\ldots,X_n]$ be given. The square sieve can provide an upper bound for the number of integral $\mathbf{x} \in [-B,B]^n$ such that $f(\mathbf{x})$ is a perfect square. Recently this has been generalized…

Number Theory · Mathematics 2026-03-25 Dante Bonolis , Lillian B. Pierce

Jakhar shown that for $f(x)=a_nx^n + a_{n-1}x^{n-1}+\cdot+ a_0$ ($a_0\neq 0$) is a polynomial with rational coefficients, if there exists a prime integer $p$ satisfying $\nu_p(a_n)=0$ and $n\nu_p(a_i)\ge (n-i)\nu_p(a_0)> 0$ for every $0\le…

Number Theory · Mathematics 2020-07-16 Lhoussain El Fadil

Let $K$ be a global field and let $Z$ be a geometrically irreducible algebraic variety defined over $K$. We show that if a big set $S\subseteq Z$ of rational points of bounded height occupies few residue classes modulo $\mathfrak{p}$ for…

Number Theory · Mathematics 2021-11-16 Juan Manuel Menconi , Marcelo Paredes , Román Sasyk

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 give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree $n$ over a finite field and their roots in the extension field in quasilinear where $N=n^2$…

Discrete Mathematics · Computer Science 2016-08-12 Nader H. Bshouty , Nuha Diab , Shada R. Kawar , Robert J. Shahla

Matom\"aki proved that if $\alpha\in \mathbb{R}$ is irrational, then there are infinitely many primes $p$ such that $|\alpha-a/p|\le p^{-4/3+\varepsilon}$ for a suitable integer a. In this paper, we extend this result to all quadratic…

Number Theory · Mathematics 2024-08-01 Stephan Baier , Sourav Das , Esrafil Ali Molla