Related papers: A proof of the Corrected Beiter conjecture
We build a new theory for analyzing the coefficients of any cyclotomic polynomial by considering it as a gcd of simpler polynomials. Using this theory, we generalize a result known as periodicity and provide two new families of flat…
In this paper I prove a conjecture which gives a lower bound for the largest absolute value of the coefficients of the n-th cyclotomic polynomial for some n. Moreover this estimate is essentially sharp.
It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…
We promote the recent research by Akiyama and Kaneko on the higher-order derivative values $\Phi_n^{(k)}(1)$ of the cyclotomic polynomials. This article focuses on Lehmer's explicit formula of $\Phi_n^{(k)}(1)/\Phi_n(1)$ as a polynomial of…
Quadratic conjecture is a strengthening of oliver's $p$-group conjecture. Let $G$ be a $p$-group of maximal class of order $p^n$. We prove that if $n\le 8$ or $n\ge \max\{2p-6,p+2\}$ then $G$ satisfies Quadratic Conjecture. Hence quadratic…
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…
In this paper, we confirm the following conjecture of Guo and Schlosser: for any odd integer $n>1$ and $M=(n+1)/2$ or $n-1$, $$ \sum_{k=0}^{M}[4k-1]_{q^2}[4k-1]^2\frac{(q^{-2};q^4)_k^4}{(q^4;q^4)_k^4}q^{4k}\equiv…
We show that for any positive integer $h$, either $h$ or $h+1$ is a height of some cyclotomic polynomial $\Phi_n$, where $n$ is a product of three distinct primes.
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials $\Phi_n^*(x)$. They can be written as certain products of cyclotomic poynomials. We study the case where $n$ has two or three distinct prime…
Using Watson's terminating $_8\phi_7$ transformation formula, we prove a family of $q$-congruences modulo the square of a cyclotomic polynomial, which were originally conjectured by the author and Zudilin [J. Math. Anal. Appl. 475 (2019),…
The $n^{th}$ cyclotomic polynomial $\Phi_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Hence $\Phi_n(x)$ is trivially zero at primitive $n^{th}$ roots of unity. Using finite Fourier analysis we derive a formula for…
This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…
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.
Taking a combinatorial point of view on cyclotomic polynomials leads to a larger class of polynomials we shall call the inclusion-exclusion polynomials. This gives a more appropriate setting for certain types of questions about the…
The $n^{th}$ cyclotomic polynomial $\Phi_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Its coefficients are the subject of intensive study and some formulas are known for them. Here we are interested in formulas…
The Schinzel hypothesis claims (but it seems hopeless to prove) that any irreducible Q[x] polynomial without a constant factor assumes infinitely many prime values at integer places. On the other hand, it is easy to see that a reducible…
Let $A_n$ denote the height of cyclotomic polynomial $\Phi_n$, where $n$ is a product of $k$ distinct odd primes. We prove that $A_n \le \epsilon_k\phi(n)^{k^{-1}2^{k-1}-1}$ with $-\log\epsilon_k\sim c2^k$, $c>0$. The same statement is true…
Let $p$ be a prime number. As a standard application of the irreducibility criterion of Eisenstein, it is well known that the $p$-th cyclotomic polynomial $\Phi_p(t)=1+t+\dots+t^{p-1}$ is the minimal polynomial of $e^{2\pi i/p}$ over…
For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…
The Polignac's Conjecture, first formulated by Alphonse de Polignac in 1849, asserts that, for any even number M, there exist infinitely many couples of prime numbers P, P+M. When M = 2, this reduces to the Twin Primes Conjecture. Despite…