Related papers: Residue of a Mod 5 Euler Product

We establish an elementary, but rather striking pattern concerning the quartic residues of primes $p$ that are congruent to 5 modulo 8. Let $g$ be a generator of the multiplicative group of $\mathbb Z_p$ and let $M$ be the $4\times 4$…

Let p be a prime = 3 (mod 4). A number of elegant number-theoretical properties of the sums T(p) = \sqrt{p}sum_{n=1}^{(p-1)/2} tan(n^2\pi/p) and C(p) = \sqrt{p}sum_{n=1}^{(p-1)/2} cot(n^2\pi/p) are proved. For example, T(p) equals p times…

For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…

Let $n, k$ and $a$ be positive integers. The Stirling numbers of the first kind, denoted by $s(n,k)$, count the number of permutations of $n$ elements with $k$ disjoint cycles. Let $p$ be a prime. In recent years, Lengyel, Komatsu and…

Let $p \equiv 1 \pmod{4}$ be prime, let $m$ and $n$ be integers such that $p=m^2+n^2$, and let $b$ be a positive integer. Let $Q(z,q) = (z,q/z,q;q)_{\infty}(qz^2,q/z^2;q^2)_{\infty}$ denote the product appearing in the quintuple product…

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

Let $\mathcal{A}$ denote a finite set of arithmetic progressions of positive integers and let $s \geq 2$ be an integer. If the cardinality of $\mathcal{A}$ is at least 2 and $U$ is the union formed by taking certain arithmetic progressions…

Let $p>3$ be a prime. Euler numbers $E_{p-3}$ first appeared in H. S. Vandiver's work (1940) in connection with the first case of Fermat Last Theorem. Vandiver proved that $x^p+y^p=z^p$ has no solution for integers $x,y,z$ with…

We provide heuristic computations \`a la Euler of the regularized infinite products of Gauss and Eisenstein integers and primes. Our approach, yielding explicit expressions, is inspired by the work by Mu\~noz Garc\'ia and P\'erez-Marco, who…

Let $C_n$ be the $n$th Catalan number. For any prime $p \geq 5$ we show that the set $\{C_n : n \in \mathbb{N} \}$ contains all residues mod $p$. In addition all residues are attained infinitely often. Any positive integer can be expressed…

For a fixed rational number g, not equal to -1,0 or 1 and integers a and d we consider the set of primes p for which the order of g(mod p) is congruent to a(mod d). For d=4 and d=3 it is shown that, under the Generalized Riemann Hypothesis,…

We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…

Given a finitely generated multiplicative subgroup of rational numbers $\Gamma$, assuming the Generalized Riemann Hypothesis, we determine an asymptotic formula for average over prime numbers, powers of the order of the reduction group…

We define the generalized-Euler-constant function $\gamma(z)=\sum_{n=1}^{\infty} z^{n-1} (\frac{1}{n}-\log \frac{n+1}{n})$ when $|z|\leq 1$. Its values include both Euler's constant $\gamma=\gamma(1)$ and the "alternating Euler constant"…

Building on work of Kontsevich, we introduce a definition of the entropy of a finite probability distribution in which the "probabilities" are integers modulo a prime p. The entropy, too, is an integer mod p. Entropy mod p is shown to be…

Nagell proved that for each prime $p\equiv 1\pmod{3}$, $p > 7$, there is a prime $q<2p^{1/2}$ that is a cubic residue modulo $p$. Here we show that for each fixed $\epsilon > 0$, and each prime $p\equiv 1\pmod{3}$ with $p > p_0(\epsilon)$,…

We study the three term recurrence modulo m. In particular, we prove that Pell numbers modulo m is residue complete if and only m is 2, a power of 3, or a power of 5. Pell-Lucas numbers modulo m is residue complete if and only if m is a…

We define a family {$\gamma(P)$} of generalized Euler constants indexed by finite sets of primes $P$ and study their distribution. These arise from partial sums of reciprocals of integers not divisible by any prime in $P$. An apparent…

For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a computable formula for evaluating the mean square sums $\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for any positive integer $r\geq 3$.…

Given $k\in\mathbb N$, we study the vanishing of the Dirichlet series $$D_k(s,f):=\sum_{n\geq1} d_k(n)f(n)n^{-s}$$ at the point $s=1$, where $f$ is a periodic function modulo a prime $p$. We show that if $(k,p-1)=1$ or $(k,p-1)=2$ and…