enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Ramanujan's sum - Wikipedia

    en.wikipedia.org/wiki/Ramanujan's_sum

    In number theory, Ramanujan's sum, usually denoted c q (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.

  3. Ramanujan summation - Wikipedia

    en.wikipedia.org/wiki/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, for which conventional summation is undefined.

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

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

    The infinite series whose terms are the natural numbers 1 + 2 + 3 ... The nth partial sum is given by a simple formula: ... The Ramanujan sum of 1 + 2 + 3 ...

  5. Taxicab number - Wikipedia

    en.wikipedia.org/wiki/Taxicab_number

    In mathematics, the nth taxicab number, typically denoted Ta(n) or Taxicab(n), is defined as the smallest integer that can be expressed as a sum of two positive integer cubes in n distinct ways. [1] The most famous taxicab number is 1729 = Ta(2) = 1 3 + 12 3 = 9 3 + 10 3 , also known as the Hardy-Ramanujan number.

  6. Summation by parts - Wikipedia

    en.wikipedia.org/wiki/Summation_by_parts

    It is used to prove Kronecker's lemma, which in turn, is used to prove a version of the strong law of large numbers under variance constraints. It may be used to prove Nicomachus's theorem that the sum of the first n {\displaystyle n} cubes equals the square of the sum of the first n {\displaystyle n} positive integers.

  7. Partition function (number theory) - Wikipedia

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

    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 repeated parts. The number q(n) is also equal to the number of partitions of n in which only odd summands are permitted. [20]

  8. Rogers–Ramanujan identities - Wikipedia

    en.wikipedia.org/wiki/Rogers–Ramanujan_identities

    Thus () gives the number of decays of an integer n in which adjacent parts of the partition differ by at least 2, equal to the number of decays in which each part is equal to 1 or 4 mod 5 is. And the number sequence () (OEIS code: A003106 [2]) analogously represents the number of possibilities for the affected natural number n to decompose this ...

  9. Harmonic series (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Harmonic_series_(mathematics)

    The first terms of the series sum to approximately ⁡ +, where is the natural logarithm and is the Euler–Mascheroni constant. Because the logarithm has arbitrarily large values, the harmonic series does not have a finite limit: it is a divergent series .