An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In mathematics, Ramanujan's congruences are some remarkable congruences for the partition function p(n). The mathematician Srinivasa Ramanujan discovered the congruences This means that: * If a number is 4 more than a multiple of 5, i.e. it is in the sequence4, 9, 14, 19, 24, 29, . . .then the number of its partitions is a multiple of 5. * If a number is 5 more than a multiple of 7, i.e. it is in the sequence5, 12, 19, 26, 33, 40, . . .then the number of its partitions is a multiple of 7. * If a number is 6 more than a multiple of 11, i.e. it is in the sequence6, 17, 28, 39, 50, 61, . . .then the number of its partitions is a multiple of 11.

Property Value
dbo:abstract
  • En mathématiques, les congruences de Ramanujan sont des congruences remarquables à propos de la fonction de partition p(n). Le mathématicien Srinivasa Ramanujan a découvert les congruences: Cela signifie que * Si un nombre est congru à 4 modulo 5, c'est-à-dire qu'il est compris dans la suite4, 9, 14, 19, 24, 29, . . .alors le nombre de ses partitions est un multiple de 5. * Si un nombre est congru à 5 modulo 7, c'est-à-dire qu'il est compris dans la suite5, 12, 19, 26, 33, 40, . . .alors le nombre de ses partitions est un multiple de 7. * Si un nombre est congru à 6 modulo 11, c'est-à-dire qu'il est compris dans la suite6, 17, 28, 39, 50, 61, . . .alors le nombre de ses partitions est un multiple de 11. (fr)
  • In mathematics, Ramanujan's congruences are some remarkable congruences for the partition function p(n). The mathematician Srinivasa Ramanujan discovered the congruences This means that: * If a number is 4 more than a multiple of 5, i.e. it is in the sequence4, 9, 14, 19, 24, 29, . . .then the number of its partitions is a multiple of 5. * If a number is 5 more than a multiple of 7, i.e. it is in the sequence5, 12, 19, 26, 33, 40, . . .then the number of its partitions is a multiple of 7. * If a number is 6 more than a multiple of 11, i.e. it is in the sequence6, 17, 28, 39, 50, 61, . . .then the number of its partitions is a multiple of 11. (en)
  • 整数分割において、ラマヌジャンの合同式(ラマヌジャンのごうどうしき、英: Ramanujan's congruences)は、分割数が満たす整除の関係式。インドの数学者シュリニヴァーサ・ラマヌジャンに因む。ラマヌジャンはイギリスの数学者ゴッドフレイ・ハロルド・ハーディの勧めで渡英し、ハーディとの共同研究の中で分割数を研究した。 (ja)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 6703729 (xsd:integer)
dbo:wikiPageLength
  • 7227 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1044622775 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In mathematics, Ramanujan's congruences are some remarkable congruences for the partition function p(n). The mathematician Srinivasa Ramanujan discovered the congruences This means that: * If a number is 4 more than a multiple of 5, i.e. it is in the sequence4, 9, 14, 19, 24, 29, . . .then the number of its partitions is a multiple of 5. * If a number is 5 more than a multiple of 7, i.e. it is in the sequence5, 12, 19, 26, 33, 40, . . .then the number of its partitions is a multiple of 7. * If a number is 6 more than a multiple of 11, i.e. it is in the sequence6, 17, 28, 39, 50, 61, . . .then the number of its partitions is a multiple of 11. (en)
  • 整数分割において、ラマヌジャンの合同式(ラマヌジャンのごうどうしき、英: Ramanujan's congruences)は、分割数が満たす整除の関係式。インドの数学者シュリニヴァーサ・ラマヌジャンに因む。ラマヌジャンはイギリスの数学者ゴッドフレイ・ハロルド・ハーディの勧めで渡英し、ハーディとの共同研究の中で分割数を研究した。 (ja)
  • En mathématiques, les congruences de Ramanujan sont des congruences remarquables à propos de la fonction de partition p(n). Le mathématicien Srinivasa Ramanujan a découvert les congruences: Cela signifie que (fr)
rdfs:label
  • Congruences de Ramanujan (fr)
  • ラマヌジャンの合同式 (ja)
  • Ramanujan's congruences (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License