enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Ramanujan's_congruences

    In mathematics, Ramanujan's congruences are the congruences for the partition function p(n) discovered by Srinivasa Ramanujan: (+) (), (+) (), (+) ().In plain words, e.g., the first congruence means that If a number is 4 more than a multiple of 5, i.e. it is in the sequence

  3. Partition function (number theory) - Wikipedia

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

    Srinivasa Ramanujan first discovered that the partition function has nontrivial patterns in modular arithmetic, now known as Ramanujan's congruences. For instance, whenever the decimal representation of n ends in the digit 4 or 9, the number of partitions of n will be divisible by 5.

  4. Rank of a partition - Wikipedia

    en.wikipedia.org/wiki/Rank_of_a_partition

    It was presented in the context of a study of certain congruence properties of the partition function discovered by the Indian mathematical genius Srinivasa Ramanujan. A different concept, sharing the same name, is used in combinatorics, where the rank is taken to be the size of the Durfee square of the partition.

  5. Ramanujan–Petersson conjecture - Wikipedia

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

    The more general Ramanujan–Petersson conjecture for holomorphic cusp forms in the theory of elliptic modular forms for congruence subgroups has a similar formulation, with exponent (k − 1)/2 where k is the weight of the form.

  6. Integer partition - Wikipedia

    en.wikipedia.org/wiki/Integer_partition

    Srinivasa Ramanujan discovered that the partition function has nontrivial patterns in modular arithmetic, now known as Ramanujan's congruences. For instance, whenever the decimal representation of n {\displaystyle n} ends in the digit 4 or 9, the number of partitions of n {\displaystyle n} will be divisible by 5.

  7. Crank of a partition - Wikipedia

    en.wikipedia.org/wiki/Crank_of_a_partition

    Let n be a non-negative integer and let p(n) denote the number of partitions of n (p(0) is defined to be 1).Srinivasa Ramanujan in a paper [3] published in 1918 stated and proved the following congruences for the partition function p(n), since known as Ramanujan congruences.

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

  9. List of number theory topics - Wikipedia

    en.wikipedia.org/wiki/List_of_number_theory_topics

    Congruence subgroup; Hecke operator; Cusp form; Eisenstein series; Modular curve; Ramanujan–Petersson conjecture; Birch and Swinnerton-Dyer conjecture; Automorphic form; Selberg trace formula; Artin conjecture; Sato–Tate conjecture; Langlands program; modularity theorem