Related papers: Ramanujan's theorem and highest abundant numbers
We derive the mean square of the divisor function using only elementary techniques.
We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…
In this paper, we study $C(x, y)$, the second moment of Ramanujan sums. Assuming the Riemann Hypothesis(RH), we establish an asymptotic formula for $C(x, y)$ with improved error term. Our analysis applies uniformly to the case where $x$ and…
We prove the Ribenboim hypothesis, which states that if, starting from some integer $N$, consecutive prime numbers $p_ {n}$, $p_{n+1}$ satisfy the inequality $\sqrt {p_ {n+1}}-\sqrt{p_{n}} <1$, then the Landau problem # 4 (1912) has a…
During his lifetime, Ramanujan provided many formulae relating binomial sums to special values of the Gamma function. Based on numerical computations, Van Hamme recently conjectured $p$-adic analogues to such formulae. Using a combination…
Let $G(n)=\sigma (n)/(n \log \log n )$. Robin made hypothesis that $G(n)<e^\gamma$ for all integer $n>5040$. This article divides all colossally abundant numbers in to three disjoint subsets CA1, CA2 and CA3, and shows that Robin hypothesis…
Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written as the sum of a prime and a number with at most 395 prime factors. We also show, under assumption of the generalised Riemann hypothesis,…
The transformations of the sum identities for generalized harmonic and oscillatory numbers, obtained earlier in our recent report [1], enable us to derive the new identities expressed in terms of the corresponding square roots of x. At…
In this paper, by using recurrence method and new properties of beta function and Ramanujan $R$-function, we prove the absolute monotonicity result for a function related to Ramanujan asymptotic formula of zero-balanced hypergeometric…
In this paper, we study the distribution of the sequence of integers $2^{\omega(n)}$ under the assumption of the strong Riemann hypothesis, where $\omega(n)$ denotes the number of distinct prime divisors of $n$. We provide an asymptotic…
In this manuscript, various properties of the Ramanujan integral $I_R(x)$, defined as \begin{align*} I_R(x) = \int_0^\infty e^{-xt} \dfrac{dt}{t(\pi^2 + \log^2 t)}, \quad x>0, \end{align*} are investigated, including its monotonicity,…
We investigate Ramanujan congruences for the function which counts the overpartitions of n with restricted odd differences. In particular, we show that only one such congruence exists. Our method involves using the theory of modular forms…
When Mike Hirschhorn showed us his lovely gem, that gives the simplest-to-date proof of Ramanujan's famous result that p(11n+6) is divisible by 11, we realized that his amazing method can be extended, and taught to a computer, and can prove…
A well known result of Newman says that upto a limit, multiples of $3$ with even number of 1's in binary representation always exceed multiples of $3$ with odd number of 1's. The phenomenon of preponderance of even number of 1's is now…
In this paper we establish a general asymptotic formula for the sum of the first $n$ prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin. Further we prove a series of results…
The Ramanujan polynomials arise in three intertwined contexts. As remarked by BerndtEvans-Wilson, no combinatorial perspective seems to be alluded to in the original definition of Ramanujan. On a different stage, Dumont-Ramamonjisoa…
A celebrated conjecture of Hardy and Littlewood provides with an asymptotic formula for the counting function of the twin primes. We give an unconditional proof of such a formula by means of a finite Ramanujan expansion of the counting…
We prove a sharp upper bound for the resurgence of sums of ideals involving disjoint sets of variables, strengthening work of Bisui--H\`a--Jayanthan--Thomas. Complete solutions are delivered for two conjectures proposed by these authors.…
The Ramanujan sum $c_n(k)$ is defined as the sum of $k$-th powers of the primitive $n$-th roots of unity. We investigate arithmetic functions of $r$ variables defined as certain sums of the products $c_{m_1}(g_1(k))...c_{m_r}(g_r(k))$,…
We give a combinatorial proof of the first Rogers-Ramanujan identity by using two symmetries of a new generalization of Dyson's rank. These symmetries are established by direct bijections.