number of combinations without repetition

URNurn:iso:std:iso:80000:-2:ed-2:en:item:2-11.6

Download RDF.jsonld .ttl

https://metanorma.github.io/isq-smart/math/part-2-11/t2-11.6
urn:iso:std:iso:80000:-2:ed-2:en:item:2-11.6

ISQ Identifiers

ISO

urn:iso:std:iso:80000:-2:ed-2:en:item:2-11.6

IEC

urn:iec:std:iec:80000-2:2019:::item:2-11.6

Designations

ENnumber of combinations without repetition

FRnombre de combinaisons sans répétition

Symbol

C_{n}^{k}

Notation systems

AsciiMath

"C"_n^k

LaTeX

\text{C}_{n}^{k}

Definition

number of combinations without repetition

nombre de combinaisons sans répétition

$C_{n}^{k} = (\begin{matrix} n \\ k \end{matrix}) = \frac{n!}{k! (n - k)!}$

A mathematical concept as defined in ISO/IEC 80000 Part 2.

isq:t2-11.6

Property	Value
rdf:type	isq:MathConcept smart:TermEntry
dcterms:identifier	2-11.6
skosxl:prefLabel	"number of combinations without repetition"@en
skosxl:altLabel	""C"_n^k"@en
skos:definition	number of combinations without repetition
skos:note	stem:["C"_n^k = ((n),(k)) = (n!)/(k!(n-k)!)]
smart:hasBindingnessType	bindingness-type:normative
dcterms:isPartOf	isq:part-2-11