Related papers: Random ordering in modulus of consecutive Hecke ei…

We provide a criterion to determine whether a real multiplicative function is a strong Benford sequence. The criterion implies that the $k$-divisor functions, where $k \neq 10^j$, and Hecke eigenvalues of newforms, such as Ramanujan tau…

Let $\tau$ be the substitution $1\to 101$ and $0\to 1$ on the alphabet $\{0,1\}$. The fixed point of $\tau$ leading by 1, denoted by $\mathbf{s}$, is a Sturmian sequence. We first give a characterization of $\mathbf{s}$ using…

An integer $k$ is called regular (mod $n$) if there exists an integer $x$ such that $k^2x\equiv k$ (mod $n$). This holds true if and only if $k$ possesses a weak order (mod $n$), i.e., there is an integer $m\ge 1$ such that $k^{m+1} \equiv…

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

For each positive integer $m$, the $m$th order harmonic numbers are given by $$H_n^{(m)}=\sum_{0<k\le n}\frac1{k^m}\ \ (n=0,1,2,\ldots).$$ We discover exact values of some series involving harmonic numbers of order not exceeding four. For…

In the article, we consider a question concerning the estimation of summatory function of the Fourier coefficients of Hecke eigenforms indexed by a sparse set of integers. In particular, we provide an estimate for the following sum;…

In this paper we prove Lehmer's conjecture on Ramanujan's tau function, namely tau(n) not equal to zero for n >= 1 by investigating the additive group structure attached to tau(n) with the aid of the pigeonhole principle and unique…

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…

Let $n$ and $k$ be integers such that $1\le k\le n$ and $f(x)$ be a nonzero polynomial of integer coefficients such that $f(m)\ne 0$ for any positive integer $m$. For any $k$-tuple $\vec{s}=(s_1, ..., s_k)$ of positive integers, we define…

For each prime $p$, we determine the distribution of the $p^{th}$ Fourier coefficients of the Hecke eigenforms of large weight for the full modular group. As $p\to\infty$, this distribution tends to the Sato--Tate distribution.

This paper provides a survey of results on the greatest prime factor, the number of distinct prime factors, the greatest squarefree factor and the greatest m-th powerfree part of a block of consecutive integers, both without any assumption…

An elementary recursive relation for M$\ddot{\mathrm{o}}$bius function $\mu (n)$ is introduced by two simple ways. With this recursive relation, $\mu (n)$ can be calculated without directly knowing the factorization of the $n$. $\mu (1)…

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…

Using the framework relating hypergeometric motives to modular forms, we define an explicit family of weight 2 Hecke eigenforms with complex multiplication. We use the theory of ${}_2F_1(1)$ hypergeometric series and Ramanujan's theory of…

Let $\lambda(n)$ denote the Fourier coefficients of a fixed modular form and $h(n)$ a Steinhaus or Rademacher random multiplicative function. In this paper, we determine the order of magnitude of \[ \E|\sum_{n \leq x} h(n)\lambda(n)|^{2q}…

Let $n\geq 1$, $0\leq t\leq {n \choose 2}$ be arbitrary integers. Define the numbers $I_n(t)$ as the number of permutations of $[n]$ with $t$ inversions. Let $n,d\geq 1$ and $0\leq t\leq (d-1)n$ be arbitrary integers. Define {\em the…

We survey divisibility properties of the Fourier coefficients of modular functions inspired by Ramanujan. Then using recent results of the generalized Hecke operator on harmonic Maass functions and known divisibility of Fourier coefficients…

In this article, we give evidence that computing Fourier coefficients of the Hecke eigenforms for composite indices is no easier than factoring integers. In particular, we show that the existence of a polynomial time algorithm that, given…

Let $p_{1}<p_2<... <p_{\nu}<...$ be the sequence of prime numbers and let $m$ be a positive integer. We give a strong asymptotic formula for the distribution of the set of integers having prime factorizations of the form…

Let $n_0(N,k)$ be the number of initial Fourier coefficients necessary to distinguish newforms of level $N$ and even weight $k$. We produce extensive data to support our conjecture that if $N$ is a fixed squarefree positive integer and $k$…