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

    Srinivasa Ramanujan mentioned the sums in a 1918 paper. [1] In addition to the expansions discussed in this article, Ramanujan's sums are used in the proof of Vinogradov's theorem that every sufficiently large odd number is the sum of three primes. [2]

  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...

    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 ∑ k = 1 ∞ f ( k ) {\displaystyle \textstyle \sum _{k=1}^{\infty }f(k)} is defined as

  5. Srinivasa Ramanujan - Wikipedia

    en.wikipedia.org/wiki/Srinivasa_Ramanujan

    Srinivasa Ramanujan Aiyangar [a] (22 December 1887 – 26 April 1920) was an Indian mathematician.Often regarded as one of the greatest mathematicians of all time, 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 ...

  6. Character sum - Wikipedia

    en.wikipedia.org/wiki/Character_sum

    In mathematics, a character sum is a sum () of values of a Dirichlet character χ modulo N, taken over a given range of values of n.Such sums are basic in a number of questions, for example in the distribution of quadratic residues, and in particular in the classical question of finding an upper bound for the least quadratic non-residue modulo N.

  7. Partition function (number theory) - Wikipedia

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

    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.

  8. Arithmetic function - Wikipedia

    en.wikipedia.org/wiki/Arithmetic_function

    c q (n), Ramanujan's sum, is the sum of the nth powers of the primitive qth roots of unity: = (,) =. Even though it is defined as a sum of complex numbers (irrational for most values of q ), it is an integer.

  9. Hardy–Ramanujan–Littlewood circle method - Wikipedia

    en.wikipedia.org/wiki/Hardy–Ramanujan...

    The initial idea is usually attributed to the work of Hardy with Srinivasa Ramanujan a few years earlier, in 1916 and 1917, on the asymptotics of the partition function.It was taken up by many other researchers, including Harold Davenport and I. M. Vinogradov, who modified the formulation slightly (moving from complex analysis to exponential sums), without changing the broad lines.