相关论文: The parity problem for irreducible cubic forms

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…

A polynomial f(x) has emergent reducibility at depth n if f^{\circ k}(x) is irreducible for 0\leq k\leq n-1 but f^{\circ n}(x) is reducible. In this paper we prove that there are infinitely many irreducible cubics f \in \mathbb{Z}[x] with…

Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…

We determine a necessary and sufficient condition for the infinitude of primes $p$ such that none of the equations $a_i^x \equiv b_i \pmod{p}, 1 \le i \le n,$ are solvable. We control the insolvability of $a^x \equiv b \pmod{p}$ by power…

Let $G$ be a finite group, and let $d$ be the degree of an irreducible character of $G$ such that $|G|=d(d+e)$ for some $e>1$. Consider the case when $G$ is solvable, $d$ is square-free, and $(d,d+e)=1$. We wish to explore an equivalent…

In his paper Almost-Primes Represented by Quadratic Polynomials, Iwaniec proved that the polynomial n^2 + 1 takes on values with at most two prime factors (counted with multiplicity) infinitely often. He states that "in order to avoid…

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

Let $Q_1,...,Q_r\in \mathbb{Z}[x]$ be polynomials having $0$ as a root. Let $f(x,y)\in\mathbb{Z}[x,y]$ be a homogeneous polynomial with factorization $f(x,y)=f_1(x,y)^{e_1}\cdots f_u(x,y)^{e_u}$, where $f_i(x,y)$ are irreducible homogeneous…

Let $\mathbb{F}_q$ denote the finite field of $q$ elements and $\mathbb{F}_{q^n}$ the degree $n$ extension of $\mathbb{F}_q$. A normal basis of $\mathbb{F}_{q^n}$ over $\mathbb{F} _q$ is a basis of the form…

For $F \in \mathbb{Z}[s,t]$ a binary quadratic form which is irreducible over $\mathbb{Q}$, and $L$ an abelian number field with class number $1$, we obtain the order of magnitude for the number of values $F(s,t)$ which are a norm from $L$.…

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…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the…

We study the question up to which power an irreducible integer-valued polynomial that is not absolutely irreducible can factor uniquely. For example, for integer-valued polynomials over principal ideal domains with square-free denominator,…

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…

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…

This paper investigates whether or not polynomials that are irreducible over $\mathbb{Q}$ and $\mathbb{Z}$ can remain irreducible under substitution by all quadratic polynomials. It answers this question in the negative in the degree 2 and…

Within the scope of elementary number theory, we prove that, as the main result, if $1 \leq x < y < z$ are integers such that at least one of $y, z, x+y$ is prime then $x^{n}+y^{n} \neq z^{n}$ for every odd integer $n \geq 3$. This result…

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…