Related papers: Residue of a Mod 5 Euler Product

We prove character sum estimates for additive Bohr subsets modulo a prime. These estimates are analogous to classical character sum bounds of Polya-Vinogradov and Burgess. These estimates are applied to obtain results on recurrence mod $p$…

We generalize and solve the $\roman{mod}\,q$ analogue of a problem of Littlewood and Offord, raised by Vaughan and Wooley, concerning the distribution of the $2^n$ sums of the form $\sum_{i=1}^n\varepsilon_ia_i$, where each $\varepsilon_i$…

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

Let $k$ be a natural number and let $c=2.134693\ldots$ be the unique real solution of the equation $2c=2+\log (5c-1)$ in $[1,\infty)$. Then, when $s\ge ck+4$, we establish an asymptotic lower bound of the expected order of magnitude for the…

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 $m\ge 1$ be a rational integer. We give an explicit formula for the mean value $$\frac{2}{\phi(f)}\sum_{\chi (-1)=(-1)^m}\vert L(m,\chi )\vert^2,$$ where $\chi$ ranges over the $\phi (f)/2$ Dirichlet characters modulo $f>2$ with the…

The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study…

Let a be a positive integer which is not a perfect h-th power with h greater than 1, and Q_a(x;4,j) be the set of primes p less than x such that the residual order of a(mod p) is congruent to j modulo 4. When j=0, 2, it is known that…

J.P. Serre showed that for any integer $m,~a(n)\equiv 0 \pmod m$ for almost all $n,$ where $a(n)$ is the $n^{\text{th}}$ Fourier coefficient of any modular form with rational coefficients. In this article, we consider a certain class of…

Let $n=p_1^{\nu_1}... p_r^{\nu_r} >1$ be an integer. An integer $a$ is called regular (mod $n$) if there is an integer $x$ such that $a^2x\equiv a$ (mod $n$). Let $\varrho(n)$ denote the number of regular integers $a$ (mod $n$) such that…

Burgess proved that for $\chi_q$ a primitive Dirichlet character modulo $q$ with $q$ cubefree, $\Big|\sum_{M< n\le M+N}\chi_q(n)\Big| \ll N^{1-\frac{1}{r}}q^{\frac{r+1}{4r^2}+\epsilon}$ for all integers $r\ge1.$ More recently, explicit…

Given a prime $p\geq 5$, we reduce modulo p a convolution of order p-1 of powers of two weighted Bernoulli numbers with Bernoulli numbers in terms of harmonic numbers and generalized harmonic numbers. Our proof is based on studying the…

We consider the problem of representing the fraction $5/P$ as a sum of three distinct unit fractions $1/A+1/B+1/C$ with $A<B<C$ and $A,B,C\in\mathbb{N}$. The case of primes $P\equiv 1 \pmod{5}$ is analyzed, where two constructive types of…

The signs of Fourier coefficients of certain eta quotients are determined by dissecting expansions for theta functions and by applying a general dissection formula for certain classes of quintuple products. A characterization is given for…

A study of products of factorials modulo p and complete residues.

For a nonzero integer $a$ let ${E_n^{(a)}}$ be given by $\sum_{k=0}^{[n/2]}\binom n{2k}a^{2k}E_{n-2k}^{(a)}=(1-a)^n$ $(n=0,1,2,...)$, where $[x]$ is the greatest integer not exceeding $x$. As $E_n^{(1)}=E_n$ is the Euler number, $E_n^{(a)}$…

We fix a non-zero integer $a$ and consider arithmetic progressions $a \bmod q$, with $q$ varying over a given range. We show that for certain specific values of $a$, the arithmetic progressions $a \bmod q$ contain, on average, significantly…

Let p1, p2,..., pn be distinct prime numbers, and let Nn be their product. We prove that, for any positive integer L that is divisible by the least common multiple of p1 minus one, p2 minus one, and so on, and for integers a1, a2,..., an…

We give several families of reasonably small integers $k, \ell \ge 1$ and real positive $\alpha, \beta \le 1$, such that the products $p_1\ldots p_k s$, where $p_1, \ldots, p_k \le m^\alpha$ are primes and $s \le m^\beta$ is a product of at…

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…