Search results
Results from the WOW.Com Content Network
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 c q ( n ) = ∑ 1 ≤ a ≤ q ( a , q ) = 1 e 2 π i a q n , {\displaystyle c_{q}(n)=\sum _{1\leq a\leq q \atop (a,q)=1}e^{2\pi i{\tfrac {a}{q}}n},}
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.
Sum of Natural Numbers (second proof and extra footage) includes demonstration of Euler's method. What do we get if we sum all the natural numbers? response to comments about video by Tony Padilla; Related article from New York Times; Why –1/12 is a gold nugget follow-up Numberphile video with Edward Frenkel
1729 is the natural number following 1728 and preceding 1730. It is the first nontrivial taxicab number, expressed as the sum of two cubic numbers in two different ways. It is known as the Ramanujan number or Hardy–Ramanujan number after G. H. Hardy and Srinivasa Ramanujan.
Srinivasa Ramanujan (picture) was bedridden when he developed the idea of taxicab numbers, according to an anecdote from G. H. Hardy.. 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 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]
Since the terms occurring in the identity are generating functions of certain partitions, the identities make statements about partitions (decompositions) of natural numbers. The number sequences resulting from the coefficients of the Maclaurin series of the Rogers–Ramanujan functions G and H are special partition number sequences of level 5:
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.