Search results
Results From The WOW.Com Content Network
Ramanujan's sum. In number theory, Ramanujan's sum, usually denoted cq ( n ), is a function of two positive integer variables q and n defined by the formula. where ( a, q) = 1 means that a only takes on values coprime to q . Srinivasa Ramanujan mentioned the sums in a 1918 paper. [ 1]
Ramanujan–Sato series. In mathematics, a Ramanujan–Sato series[ 1][ 2] generalizes Ramanujan ’s pi formulas such as, to the form. by using other well-defined sequences of integers obeying a certain recurrence relation, sequences which may be expressed in terms of binomial coefficients , and employing modular forms of higher levels.
The multiplicative inverse of its generating function is the Euler function; by Euler's pentagonal number theorem this function is an alternating sum of pentagonal number powers of its argument. Srinivasa Ramanujan first discovered that the partition function has nontrivial patterns in modular arithmetic, now known as Ramanujan's congruences.
Srinivasa Ramanujan[ a] (22 December 1887 – 26 April 1920) was an Indian mathematician. Though he had almost no formal training in pure mathematics, he made substantial contributions to mathematical analysis, number theory, infinite series, and continued fractions, including solutions to mathematical problems then considered unsolvable.
Ramanujan's master theorem. In mathematics, Ramanujan's master theorem, named after Srinivasa Ramanujan, [ 1] is a technique that provides an analytic expression for the Mellin transform of an analytic function . Page from Ramanujan's notebook stating his Master theorem. The result is stated as follows:
In number theory and combinatorics, a partition of a non-negative integer n, also called an integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. (If order matters, the sum becomes a composition .)
In mathematics, the Ramanujan conjecture, due to Srinivasa Ramanujan ( 1916 , p. 176), states that Ramanujan's tau function given by the Fourier coefficients τ(n) of the cusp form Δ (z) of weight 12. where , satisfies. when p is a prime number.
Chudnovsky algorithm. The Chudnovsky algorithm is a fast method for calculating the digits of π, based on Ramanujan 's π formulae. Published by the Chudnovsky brothers in 1988, [ 1] it was used to calculate π to a billion decimal places. [ 2]