English
Related papers

Related papers: Cubefree Trinomial Discriminants

200 papers

In this paper, we develop Furstenberg's proof of infinity of primes, and prove several results about prime divisors of sequences of integers, including the celebrated Schur's theorem. In particular, we give a simple proof of a classical…

Number Theory · Mathematics 2017-11-07 Xianzu Lin

Suppose x^m + c*x^n is a permutation polynomial over GF(p), where p>5 is prime, m>n>0, and c is in GF(p)^*. We prove that gcd(m-n,p-1) is not 2 or 4. In the special case that either (p-1)/2 or (p-1)/4 is prime, this was conjectured in a…

Number Theory · Mathematics 2008-06-09 Ariane M. Masuda , Michael E. Zieve

We show that if two monic polynomials with integer coefficients have square-free resultant, then all positive divisors of the resultant arise as the greatest common divisor of the values of the two polynomials at a suitable integer.

Number Theory · Mathematics 2017-05-30 Péter E. Frenkel , József Pelikán

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

History and Overview · Mathematics 2022-02-03 Devendra Prasad

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

We explicitly describe the splitting of odd integral primes in the radical extension $\mathbb{Q}(\sqrt[n]{a})$, where $x^n-a$ is an irreducible polynomial in $\mathbb{Z}[x]$. Our motivation is to classify common index divisors, the primes…

Number Theory · Mathematics 2025-07-25 Hanson Smith

In this paper, we prove that a binary definite quadratic form over F_q[t], where q is odd, is completely determined up to equivalence by the polynomials it represents up to degree 3m-2, where m is the degree of its discriminant. We also…

Number Theory · Mathematics 2011-11-15 Jean Bureau , Jorge Morales

Let $n$ be a squarefree positive odd integer. We will show that there exist infinitely many imaginary quadratic number fields with discriminant divisible by $n$ and-at the same time-having an element of order $n$ in the class group. We then…

Number Theory · Mathematics 2021-08-17 Meng Fai Lim

We prove that for all squarefree $m$ and any set $A\subset\mathbb{Z}_m$ such that $A-A$ does not contain non-zero squares the bound $|A|\leq m^{1/2}(3n)^{1.5n}$ holds, where $n$ denotes the number of odd prime divisors of $m$.

Number Theory · Mathematics 2016-10-18 Mikhail Gabdullin

In 2012, for any integer $n \ge 2$, Kedlaya constructed an infinite class of monic irreducible polynomials of degree $n$ with integer coefficients having squarefree discriminants. Such polynomials are necessarily monogenic. Further, by…

Number Theory · Mathematics 2025-06-23 Rupam Barman , Anuj Narode , Vinay Wagh

We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general…

Number Theory · Mathematics 2013-11-20 Salvatore Tringali

Let $F(X,Y)=Y^d+a_1(X)Y^{d-1}+...+a_d(X)$ be a polynomial in $n+1$ variables $(X,Y)=(X_1,...,X_n,Y)$ with coefficients in an algebraically closed field K. Assuming that the discriminant $D(X)=\disc_Y F(X,Y)$ is nonzero we investigate the…

Algebraic Geometry · Mathematics 2010-04-23 Arkadiusz Pĺoski

Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…

Number Theory · Mathematics 2023-12-05 William Banks , Igor E. Shparlinski

In this paper, the discriminant of homogeneous polynomials is studied in two particular cases: a single homogeneous polynomial and a collection of n-1 homogeneous polynomials in n variables. In these two cases, the discriminant is defined…

Commutative Algebra · Mathematics 2012-10-18 Laurent Busé , Jean-Pierre Jouanolou

Let f\in \mathbb{Z}[x,y] be an irreducible homogeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

Number Theory · Mathematics 2007-05-23 H. A. Helfgott

Motivated by a question of Venkataramana, we consider the greatest common divisor of $\phi(f(n))$ where $f$ is a primitive polynomial with integer coefficients, and $n$ ranges over all natural numbers. Assuming Schinzel's hypothesis, we…

Number Theory · Mathematics 2019-09-25 J. Brüdern , K. Soundararajan

We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must…

Number Theory · Mathematics 2014-02-26 Rafe Jones

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

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

We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…

Symbolic Computation · Computer Science 2024-09-11 Hoon Hong , Jing Yang