This HTML5 document contains 28 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

PrefixNamespace IRI
n18http://dbkwik.webdatacommons.org/resource/D-Spwllk4G-B4FjWW4aYqw==
n12http://dbkwik.webdatacommons.org/ontology/
dctermshttp://purl.org/dc/terms/
n7http://dbkwik.webdatacommons.org/resource/cJ7myW7l9UzKSQOshGuQ6w==
n6http://dbkwik.webdatacommons.org/resource/FJg-ExlNBh4HSz9_YrlrJQ==
n14http://dbkwik.webdatacommons.org/resource/pcfAZaqsMFADSpeQ75V89A==
n15http://dbkwik.webdatacommons.org/resource/vplfVtkIUvTz3c0VHPLu0Q==
n16http://dbkwik.webdatacommons.org/resource/L0jaIkrl0A8t_M--VYM5KQ==
n2http://dbkwik.webdatacommons.org/resource/U8f0ZqroAOoLfb5TXcQQjw==
n24http://dbkwik.webdatacommons.org/resource/VvicFtUXoJVCD21zZZAtGA==
n20http://dbkwik.webdatacommons.org/resource/km2pqvk00BT---s633_SuQ==
n8http://dbkwik.webdatacommons.org/resource/Z3bZy8Lj6_zWkzLizB_ThA==
n23http://dbkwik.webdatacommons.org/resource/syLYU5juJvdH7a3goQ_3wQ==
rdfshttp://www.w3.org/2000/01/rdf-schema#
n17http://dbkwik.webdatacommons.org/resource/OdToo-KknLFJ2bo_xX5OAg==
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n13http://dbkwik.webdatacommons.org/resource/WihIflQddY4nIWsc9Y01_Q==
owlhttp://www.w3.org/2002/07/owl#
n10http://dbkwik.webdatacommons.org/resource/h_FljxpWDAl0VaM85-6mOA==
n5http://dbkwik.webdatacommons.org/math/property/
n22http://dbkwik.webdatacommons.org/resource/52dcnURSDc49_bNn3AIYcQ==
n4http://dbkwik.webdatacommons.org/resource/XmCyP-yBGm-Osh9LK8wL1A==
n19http://dbkwik.webdatacommons.org/resource/cU4_5GPGsL8ZnECVYIo-Zw==
xsdhhttp://www.w3.org/2001/XMLSchema#
dbrhttp://dbpedia.org/resource/
n11http://dbkwik.webdatacommons.org/resource/IJISC3Q7KQGcubu6gRsbkA==
n21http://dbkwik.webdatacommons.org/resource/tljgnp8gHssmZF_vvhX5JA==
Subject Item
n2:
rdfs:label
Binomial coefficient
rdfs:comment
In combinatorics, is interpreted as the number of -element subsets (the -combinations) of an -element set, that is the number of ways that things can be "chosen" from a set of things. Hence, is often read as " choose " and is called the choose function of and . The notation was introduced by Andreas von Ettingshausen in 1826, although the numbers were already known centuries before that (see Pascal's triangle). Alternative notations include , in all of which the stands for combinations or choices.
owl:sameAs
dbr:Binomial_coefficient
dcterms:subject
n4: n17: n18: n20: n22:
n5:wikiPageUsesTemplate
n6: n7: n8: n13: n14: n15: n16: n19: n21: n23: n24:
n10:
Bounds for binomial coefficients Proof that C is an integer Binomial Coefficient Generalized binomial coefficients
n11:
6309 273 6744 4074
n12:abstract
In combinatorics, is interpreted as the number of -element subsets (the -combinations) of an -element set, that is the number of ways that things can be "chosen" from a set of things. Hence, is often read as " choose " and is called the choose function of and . The notation was introduced by Andreas von Ettingshausen in 1826, although the numbers were already known centuries before that (see Pascal's triangle). Alternative notations include , in all of which the stands for combinations or choices.