Related papers: Residue of a Mod 5 Euler Product

Let $p$ be a large odd prime, let $x=\log p)(\log\log p)^{3+\varepsilon}$ and let $q\ll\log\log p$ be an integer, where $\varepsilon>0$ is a small number. This note proves the existence of small prime quadratic residues and small prime…

G. Andrews proved that if $n$ is a prime number then the coefficients $a_k$ and $a_{k+n}$ of the product $(q,q)_\infty/(q^n,q^n)_\infty=\sum_k a_kq^k$ have the same sign, see [A1]. We generalize this result in several directions. Our…

This paper makes the following conjecture: For every prime $p$ there exists a positive integer $x$ with $\left\lceil \frac{p}{4} \right\rceil \leq x \leq \left\lceil \frac{p}{2} \right\rceil$ and a positive divisor $d|x^2$ so that either:…

Let $p$ be an odd prime. For any $p$-adic integer $a$ we let $\overline{a}$ denote the unique integer $x$ with $-p/2<x<p/2$ and $x-a$ divisible by $p$. In this paper we study some permutations involving quadratic residues modulo $p$. For…

An \emph{indexing} of a finite set $S$ is a bijection $D : \{1,...,|S|\} \rightarrow S$. We present an indexing for the set of quadratic residues modulo $N$ that is decodable in polynomial time on the size of $N$, given the factorization of…

Let l be an odd prime. For primes, p \equiv 1 (mod l), Gauss (l = 3) and Dickson (l = 5) considered the Diophantine systems in terms of which cyclotomic numbers of order 3 and 5 were obtained. The aim of this paper is to show how to obtain…

We prove that, if $x$ and $q\leqslant x^{1/16}$ are two parameters, then for any invertible residue class $a$ modulo $q$ there exists a product of exactly three primes, each one below $x^{1/3}$, that is congruent to $a$ modulo $q$.

Let $p>3$ be a prime, and let $d\in\mathbb Z$ with $p\nmid d$. For the determinants $$S_m(d,p)=\det\left[(i^2+dj^2)^{m}\right]_{1\leqslant i,j \leqslant (p-1)/2}\ \ \left(\frac{p-1}2\leqslant m\leqslant p-1\right),$$ Sun recently determined…

Let $\Bbb Z$ be the set of integers, and let $(m,n)$ be the greatest common divisor of integers $m$ and $n$. Let $p\equiv 1\mod 4$ be a prime, $q\in\Bbb Z$, $2\nmid q$ and $p=c^2+d^2=x^2+qy^2$ with $c,d,x,y\in\Bbb Z$ and $c\e 1\mod 4$.…

Fix a prime $p$ and define $T_p(n)$ to be the number of nonzero residues in the $n$th row of pascal's triangle mod $p$, and define $\phi_p(n)$ to be the number of nonzero residues in the first $n$ rows of pascal's triangle mod $p$. We…

This note provides truncated formulae with explicit error terms to compute Euler products over primes in arithmetic progressions of rational fractions. It further provides such a formula for the product of terms of the shape $F(1/p, 1/p^s)$…

For every modulus $q\ge3$, we define a family of subsets $\mathcal{A}$ of the multiplicative group $(\mathbb{Z}/{q}\mathbb{Z})^\times$ for which the Euler product $\prod_{p\text{mod}q\in\mathcal{A}}(1-p^{-s})$ can be computed in double…

We provide a uniform bound on the partial sums of multiplicative functions under very general hypotheses. As an application, we give a nearly optimal estimate for the count of $n \le x$ for which the Alladi-Erd\H{o}s function $A(n) =…

Assuming a uniform $q$-variant of the prime $k$-tuple conjecture, we compute moments of the number of primes in arithmetic progressions to a large modulus $q$ as the residue classes vary. Consequently, depending on the size of $\varphi(q)$,…

The Postnikov character formula is used to express large portions of a Dirichlet character sum in terms of quadratic exponential sums. The quadratic sums are then computed using an analytic algorithm previously derived by the author. This…

We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes $p$ in a dyadic interval $[Q,2Q]$ for which a given interval $[u+1,u+\psi(Q)]$ does not contain a quadratic non-residue modulo $p$. The bound…

A folklore proof of Euclid's theorem on the infinitude of primes uses the Euler product and the irrationality of $\zeta(2) = \pi^2/6$. A quantified form of Euclid's Theorem is Bertrand's postulate $p_{n+1} < 2p_n$. By quantifying the…

Let S be an infinite set of non-empty, finite subsets of the nonnegative integers. If p is an odd prime, let c(p) denote the cardinality of the set {T {\in} S : T {\subseteq} {1,...,p-1} and T is a set of quadratic residues (respectively,…

Modulo a prime number, we define semi-primitive roots as the square of primitive roots. We present a method for calculating primitive roots from quadratic residues, including semi-primitive roots. We then present progressions that generate…

We extend the results obtained by E. Ntienjem to all positive integers. Let $\EuFrak{N}$ be the subset of $\mathbb{N}$ consisting of $\,2^{\nu}\mho$, where $\nu$ is in $\{0,1,2,3\}$ and $\mho$ is a squarefree finite product of distinct odd…