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

  4. Integer partition - Wikipedia

    en.wikipedia.org/wiki/Integer_partition

    By taking conjugates, the number p k (n) of partitions of n into exactly k parts is equal to the number of partitions of n in which the largest part has size k. The function p k (n) satisfies the recurrence p k (n) = p k (n − k) + p k−1 (n − 1) with initial values p 0 (0) = 1 and p k (n) = 0 if n ≤ 0 or k ≤ 0 and n and k are not both ...

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

  7. Hardy–Ramanujan–Littlewood circle method - Wikipedia

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

    Later, I. M. Vinogradov extended the technique, replacing the exponential sum formulation f(z) with a finite Fourier series, so that the relevant integral I n is a Fourier coefficient. Vinogradov applied finite sums to Waring's problem in 1926, and the general trigonometric sum method became known as "the circle method of Hardy, Littlewood and ...

  8. Taxicab number - Wikipedia

    en.wikipedia.org/wiki/Taxicab_number

    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]

  9. Bernoulli number - Wikipedia

    en.wikipedia.org/wiki/Bernoulli_number

    In mathematics, the Bernoulli numbers B n are a sequence of rational numbers which occur frequently in analysis.The Bernoulli numbers appear in (and can be defined by) the Taylor series expansions of the tangent and hyperbolic tangent functions, in Faulhaber's formula for the sum of m-th powers of the first n positive integers, in the Euler–Maclaurin formula, and in expressions for certain ...