enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Ramanujan summation - Wikipedia

    en.wikipedia.org/wiki/Ramanujan_summation

    Ramanujan summation. Ramanujan summation is a technique invented by the mathematician Srinivasa Ramanujan for assigning a value to divergent infinite series. Although the Ramanujan summation of a divergent series is not a sum in the traditional sense, it has properties that make it mathematically useful in the study of divergent infinite series ...

  3. Ramanujan's sum - Wikipedia

    en.wikipedia.org/wiki/Ramanujan's_sum

    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]

  4. 1 + 2 + 3 + 4 + ⋯ - ⋯ - Wikipedia

    en.wikipedia.org/wiki/1_%2B_2_%2B_3_%2B_4_%2B_%E...

    Ramanujan summation is a method to isolate the constant term in the Euler–Maclaurin formula for the partial sums of a series. For a function f, the classical Ramanujan sum of the series = is defined as

  5. Ramanujan's master theorem - Wikipedia

    en.wikipedia.org/wiki/Ramanujan's_master_theorem

    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.

  6. Ramanujan–Sato series - Wikipedia

    en.wikipedia.org/wiki/Ramanujan–Sato_series

    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.

  7. Rogers–Ramanujan identities - Wikipedia

    en.wikipedia.org/wiki/Rogers–Ramanujan_identities

    Rogers–Ramanujan identities. In mathematics, the Rogers–Ramanujan identities are two identities related to basic hypergeometric series and integer partitions. The identities were first discovered and proved by Leonard James Rogers (1894), and were subsequently rediscovered (without a proof) by Srinivasa Ramanujan some time before 1913.

  8. Partition function (number theory) - Wikipedia

    en.wikipedia.org/wiki/Partition_function_(number...

    Definition and properties. A partition in which no part occurs more than once is called strict, or is said to be a partition into distinct parts. The function q (n) gives the number of these strict partitions of the given sum n. For example, q (3) = 2 because the partitions 3 and 1 + 2 are strict, while the third partition 1 + 1 + 1 of 3 has ...

  9. Ramanujan graph - Wikipedia

    en.wikipedia.org/wiki/Ramanujan_graph

    Ramanujan graph. In the mathematical field of spectral graph theory, a Ramanujan graph is a regular graph whose spectral gap is almost as large as possible (see extremal graph theory). Such graphs are excellent spectral expanders. As Murty's survey paper [1] notes, Ramanujan graphs "fuse diverse branches of pure mathematics, namely, number ...