Related papers: Ramanujan in Computing Technology
Using some properties of the gamma function and the well-known Gauss summation formula for the classical hypergeometric series, we prove a four-parameter series expansion formula, which can produce infinitely many Ramanujan type series for…
Ramanujan gave a recurrence relation for the partition function in terms of the sum of the divisor function $\sigma(n)$. In 1885, J.W. Glaisher considered seven divisor sums closely related to the sum of the divisors function. We develop a…
In their seminal paper, Lubotzky, Phillips and Sarnak (LPS) defined the notion of regular Ramanujan graphs and gave an explicit construction of infinite families of $(p+1)$-regular Ramanujan Cayley graphs, for infinitely many primes $p$. In…
Fundamental mathematical constants appear in nearly every field of science, from physics to biology. Formulas that connect different constants often bring great insight by hinting at connections between previously disparate fields.…
We revisit old conjectures of Fermat and Euler regarding representation of integers by binary quadratic form x^2+5y^2. Making use of Ramanujan's_1\psi_1 summation formula we establish a new Lambert series identity for…
The Ramanujan Machine project detects new expressions related to constants of interest, such as $\zeta$ function values, $\gamma$ and algebraic numbers (to name a few). In particular the project lists a number of conjectures concerning the…
In 2015 Cristian-Silviu Radu designed an algorithm to detect identities of a class studied by Ramanujan and Kolberg. This class includes the famous identities by Ramanujan which provide a witness to the divisibility properties of $p(5n+4),$…
Ramanujan wrote the following identity \begin{align*} \sqrt{2 \left(1 - \frac{1}{3^2}\right) \left(1 - \frac{1}{7^2}\right) \left(1 - \frac{1}{11^2}\right) \left(1 - \frac{1}{19^2}\right)} \ = \ \left(1 + \frac{1}{7}\right) \left(1 +…
We study Ramanujan's cubic continued fraction and explicit evaluations of theta-functions
In this paper, the authors present sharp approximations in terms of sine function and polynomials for the so-called Ramanujan constant (or the Ramanujan $R$-function) $R(a)$, by showing some monotonicity, concavity and convexity properties…
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…
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…
We provide an historical account of equivalent conditions for the Riemann Hypothesis arising from the work of Ramanujan and, later, Guy Robin on generalized highly composite numbers. The first part of the paper is on the mathematical…
In 1730 James Stirling, building on the work of Abraham de Moivre, published what is known as Stirling's approximation of $n!$. He gave a good formula which is asymptotic to $n!$. Since then hundreds of papers have given alternative proofs…
An identity by Ramanujan is expressed using polar coordinates, so that its proof reduces to the verification of an elementary trigonometric identity. This approach produces a few variations on Ramanujan's original identity.
We celebrate the 100th anniversary of Srinivasa Ramanujan's election as a Fellow of the Royal Society, which was largely based on his work with G. H. Hardy on the asymptotic properties of the partition function. After recalling this…
Let $\Bbb Z$ and $\Bbb Z^+$ be the set of integers and the set of positive integers, respectively. For $a,b,c,d,n\in\Bbb Z^+$ let $t(a,b,c,d;n)$ be the number of representations of $n$ by $ax(x+1)/2+by(y+1)/2+cz(z+1)/2+dw(w+1)/2$…
We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…
In this paper the ideas of Rota and Ramanujan are shown to be central to understanding problems in additive number theory. The circle and sieve methods are two different facets of the same theme of interplay between probability and Fourier…
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…