English
Related papers

Related papers: Monogenic cyclotomic compositions

200 papers

Mersenne primes and Fermat primes may be thought of as primes of the form $\Phi_m(2)$, where $\Phi_m(x)$ is the $m$th cyclotomic polynomial. This paper discusses the more general problem of primes and composites of this form.

Number Theory · Mathematics 2024-12-05 Carl Pomerance

This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq…

General Mathematics · Mathematics 2021-04-15 N. A. Carella

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

Number Theory · Mathematics 2016-09-02 Jie Wu , Ping Xi

Let $K=\Q(\theta)$ be an algebraic number field with $\theta$ a root of an irreducible quadrinomial $f(x) = x^6+ax^m+bx+c\in\Z[x] $ with $m\in\{2,3,4,5\}$. In the present paper, we give some explicit conditions involving only $a,~b,~c$ and…

Number Theory · Mathematics 2023-03-02 Anuj Jakhar , Ravi Kalwaniya

We get some results about the factorization of $\phi_p(M) \in {\mathbb{F}}_2[x]$, where $p$ is a prime number, $\phi_p$ is the corresponding cyclotomic polynomial and $M$ is a Mersenne prime (polynomial). By the way, we better understand…

Number Theory · Mathematics 2021-06-21 Luis H. Gallardo , Olivier Rahavandrainy

We show that polynomial recursions $x_{n+1}=x_{n}^{m}-k$ where $k,m$ are integers and $m$ is positive have no nontrivial periodic integral orbits for $m\geq3$. If $m=2$ then the recursion has integral two-cycles for infinitely many values…

Dynamical Systems · Mathematics 2022-09-05 Hassan Sedaghat

An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such…

Number Theory · Mathematics 2023-08-03 Xiang-dong Hou

The factorizations of the polynomial $X^n-1$ and the cyclotomic polynomial $\Phi_n$ over a finite field $\mathbb F_q$ have been studied for a very long time. Explicit factorizations have been given for the case that $\mathrm{rad}(n)\mid…

Number Theory · Mathematics 2024-02-09 Anna-Maurin Graner

Let $p$ be a prime integer and $n,i$ be positive integers such that \linebreak $S=\{-1, \ \theta, \ \mu_i=1+\theta+... + \theta^{i-1} \ \mid 1 < i < \frac{p^n}{2}, \ gcd(p^n,i)=1 \}$ generates the group of units of $\mathbb{Z}[\theta],$…

Group Theory · Mathematics 2013-07-23 Raul Antonio Ferraz , Patricia Massae Kitani

Let $\mathbb{F}_q$ be the finite field with $q$ elements, and $T$ a positive integer. In this article we find a sharp estimative of the total number of monic irreducible binomials in $\mathbb F_q[x]$ of degree less or equal to $T$, when $T$…

An irreducible element of a commutative ring is absolutely irreducible if no power of it has more than one (essentially different) factorization into irreducibles. In the case of the ring $\text{Int}(D)=\{f\in K[x]\mid f(D)\subseteq D\}$,…

Commutative Algebra · Mathematics 2020-04-02 Sophie Frisch , Sarah Nakato

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

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

Number Theory · Mathematics 2025-11-19 Oleksiy Klurman , Vlad Matei

We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…

Logic · Mathematics 2020-05-22 Marco Barone , Nicolás Caro , Eudes Naziazeno

Let p be an odd prime. Let K = \Q(zeta) be the p-cyclotomic number field. Let v be a primitive root mod p and sigma : zeta --> zeta^v be a \Q-isomorphism of the extension K/\Q generating the Galois group G of K/\Q. For n in Z, the notation…

Number Theory · Mathematics 2007-05-23 Roland Queme

Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and…

Information Theory · Computer Science 2019-11-19 Minjia Shi , Tor Helleseth , Patrick Sole

Let $k\ge 1$ be an integer, and let $(U_n)$ be the Lucas sequence of the first kind defined by \begin{equation*}\label{Eq:Lucas} U_0=0,\quad U_1=1\quad \mbox{and} \quad U_n=kU_{n-1}+U_{n-2} \quad \mbox{ for $n\ge 2$}. \end{equation*} It is…

Number Theory · Mathematics 2023-07-18 Lenny Jones

In this article, we provide a short and elementary proof of the following result: For $n \geq 3$ the middle coefficient of $\Phi_n(x)$ is either zero (when $n$ is a power of $2$) or an odd integer.

Number Theory · Mathematics 2019-04-25 Gregory Dresden

We prove that certain basic hypergeometric series truncated at $k=n-1$ have the factor $\Phi_n(q)^2$, where $\Phi_n(q)$ is the $n$-th cyclotomic polynomial. This confirms two recent conjectures of the author and Zudilin. We also put forward…

Number Theory · Mathematics 2019-01-24 Victor J. W. Guo

Let $f(T)$ be a monic polynomial of degree $d$ with coefficients in a finite field $\mathbb{F}_q$. Extending earlier results in the literature, but now allowing $(q,2d)>1$, we give a criterion for $f$ to satisfy the following property: for…

Algebraic Geometry · Mathematics 2024-06-04 Kaloyan Slavov