Related papers: On a polynomial involving roots of unity and its a…

In this brief note, we consider p-adic unit roots or poles of L-functions of exponential sums defined over finite fields. In particular, we look at the number of unit roots or poles, and a congruence relation on the units. This raises a…

We study the maximum modulus set, $\mathcal{M}(p)$, of a polynomial $p$. We are interested in constructing $p$ so that $\mathcal{M}(p)$ has certain exceptional features. Jassim and London gave a cubic polynomial $p$ such that…

For a prime $p\equiv 1 \,(\bmod{4})$, let \[ \varepsilon = \frac{1}{2}\left( t + u\sqrt{p}\right) \] be the fundamental unit of the real quadratic field $\mathbb{Q}(\sqrt{p})$. In 1951, N. Ankeny, E. Artin, and S. Chowla asked whether $p$…

In recent, H. Sun defined a new kind of refined Eulerian polynomials, namely, \begin{eqnarray*} A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)} \end{eqnarray*} for $n\geq 1$, where ${odes}(\pi)$ and ${edes}(\pi)$…

In this paper we prove three results conjectured by Z.-W. Sun. Let $p$ be an odd prime and let $h\in \mathbb{Z}$ with $2h-1\equiv0\pmod{p^{}}$. For $a\in\mathbb{Z}^{+}$ and $p^a>3$, we show that \begin{align}\notag…

In this paper, we study congruences on sums of products of binomial coefficients that can be proved by using properties of the Jacobi polynomials. We give special attention to polynomial congruences containing Catalan numbers, second-order…

The concept of p-ordering for a prime p was introduced by Manjul Bhargava (in his PhD thesis) to develop a generalized factorial function over an arbitrary subset of integers. This notion of p-ordering provides a representation of…

Let p be an odd prime. Let F_p^* be the no-null part of the finite field of p elements. Let K=\Q(zeta) be a p-cyclotomic field and O_K be its ring of integers. Let pi be the prime ideal of K lying over p. Let sigma : zeta --> zeta^v be the…

An observation by J-P. Serre implies that cubic polynomials are unique among generic monic polynomials of degree 2 or higher in that they have a root that is a power series in the discriminant of the polynomial. We provide formulas for this…

Finding polynomial solutions to Pell's equation is of interest as such solutions sometimes allow the fundamental units to be determined in an infinite class of real quadratic fields. In this paper, for each triple of positive integers…

If $p:\mathbb{C} \to \mathbb{C}$ is a non-constant polynomial, the Gauss--Lucas theorem asserts that its critical points are contained in the convex hull of its roots. We consider the case when $p$ is a random polynomial of degree $n$ with…

We estimate the number of primes represented by a general quadratic polynomial with discriminant $\Delta$, assuming that the corresponding real character is exceptional.

In 1874, Mertens famously proved an asymptotic formula for the product $p/(p-1)$ over all primes $p$ up to $x$. On the other hand, one may expand Mertens' prime product into series over numbers $n$ with only small prime factors. It is…

Let $p\geq 3$ be a prime number. In this article, we study the canonical expansion of the primitive $p^n$-th root of unity $\zeta_{p^n}$ in $p$-adic Mal'cev-Neumann field $\mathbb{L}_p$ for $n\geq 1$. More precisely, we give the explicit…

A frequently cited theorem says that for n > 0 and prime p, the sum of the first p n-th powers is congruent to -1 modulo p if p-1 divides n, and to 0 otherwise. We survey the main ingredients in several known proofs. Then we give an…

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…

Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…

We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…

A cubic Galois polynomial is a cubic polynomial with rational coefficients that defines a cubic Galois field. Its discriminant is a full square and its roots $x_1,x_2,x_3$ (enumerated in some order) are real. There exists (and only one)…