Related papers: Ramanujan's theorem and highest abundant numbers
The Riemann hypothesis (RH) is well known. In this paper we would show some sufficient conditions for the RH. The first condition is related with the sum of divisors function and another one is related with the Chebyshev's function.
The divisor function $\sigma(n)$ sums the divisors of $n$. We call $n$ abundant when $\sigma(n) - n > n$ and perfect when $\sigma(n) - n = n$. I recently introduced the recursive divisor function $a(n)$, the recursive analog of the divisor…
In the present paper, we introduce a multiple Ramanujan sum for arithmetic functions, which gives a multivariable extension of the generalized Ramanujan sum studied by D. R. Anderson and T. M. Apostol. We then find fundamental arithmetic…
This paper shows the equivalence of the Riemann hypothesis to an sequence of elementary inequalities involving the harmonic numbers H_n, the sum of the reciprocals of the integers from 1 to n. It is a modification of a criterion due to Guy…
Riemann conjectured that all the zeros of the Riemann $\Xi$-function are real, which is now known as the Riemann Hypothesis (RH). In this article we introduce the study of the zeros of the truncated sums $\Xi_N(z)$ in Riemann's uniformly…
The theory of Mellin transform is an incredibly useful tool in evaluating some of the well known results for the zeta function. Ramanujan in his quarterly reports \cite{1} gave a theorem for Mellin transform which is now known as…
Towards the end of his life Ramanujan wrote a manuscript on properties of the partition and tau functions, some parts of which remained unpublished until very recently. Nevertheless, this manuscript gave rise to a lot of subsequent work. In…
In 1984, G. Robin proved that the Riemann hypothesis is true if and only if the Robin inequality $\sigma(n)<e^\gamma n\log\log n$ holds for every integer $n>5040$, where $\sigma(n)$ is the sum of divisors function, and $\gamma$ is the…
This paper is a tribute to the genius of the legendary Indian mathematician Srinivasa Ramanujan (22 December 1887 - 26 April 1920) in the centenary year of his death. The life story of Ramanujan is so well known that it needs no elaboration…
The Hardy-Ramanujan formula for the number of integer partitions of $n$ is one of the most popular results in partition theory. While the unabridged final formula has been celebrated as reflecting the genius of its authors, it has become…
We investigate the analogues, in $\mathbb{F}_q[t]$, of highly composite numbers and the maximum order of the divisor function, as studied by Ramanujan. In particular, we determine a family of highly composite polynomials which is not too…
The theory of supercharacters, recently developed by Diaconis-Isaacs and Andre, can be used to derive the fundamental algebraic properties of Ramanujan sums. This machinery frequently yields one-line proofs of difficult identities and…
In this article, we consider systems of linear congruences in several variables and obtain necessary and sufficient conditions as well as explicit expressions for the number of solutions subject to certain restriction conditions. These…
S. Ramanujan introduced a technique in 1913 for providing analytic expressions for certain Mellin-type integrals which is now known as Ramanujan's Master Theorem. This technique was communicated through his "Quarterly Reports" and has a…
We give "hybrid" proofs of the $q$-binomial theorem and other identities. The proofs are "hybrid" in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the…
Let $R(n) = \sum_{a+b=n} \Lambda(a)\Lambda(b)$, where $\Lambda(\cdot)$ is the von Mangoldt function. The function $R(n)$ is often studied in connection with Goldbach's conjecture. On the Riemann hypothesis (RH) it is known that $\sum_{n\leq…
Bringmann and Lovejoy introduced a rank for overpartition pairs and investigated its role in congruence properties of $\bar{pp}(n)$, the number of overpartition pairs of n. In particular, they applied the theory of Klein forms to show that…
Let $\sigma(n)$ denotes the sum of divisors function of a positive integer $n$. Robin proved that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma}n \log \log n$ holds for every positive integer $n \geq…
In 1914, Ramanujan gave a list of 17 identities expressing $1/\pi$ as linear combinations of values of hypergeometric functions at certain rational numbers. Since then, identities of similar nature have been discovered by many authors.…
We present a new approach to showing that random graphs are nearly optimal expanders. This approach is based on recent deep results in combinatorial group theory. It applies to both regular and irregular random graphs. Let G be a random…