About: Rule of product   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

In combinatorics, the rule of product is a basic counting principle (a.k.a. the fundamental principle of counting). Stated simply, it is the idea that if we have a ways of doing something and b ways of doing another thing, then there are a · b ways of performing both actions. In this example, the rule says: multiply 3 by 2, getting 6. The sets {A, B, C} and {X, Y} in this example are disjoint, but that is not necessary. The number of ways to choose a member of {A, B, C}, and then to do so again, in effect choosing an ordered pair each of whose components is in {A, B, C}, is 3 × 3 = 9.

AttributesValues
rdfs:label
  • Rule of product
rdfs:comment
  • In combinatorics, the rule of product is a basic counting principle (a.k.a. the fundamental principle of counting). Stated simply, it is the idea that if we have a ways of doing something and b ways of doing another thing, then there are a · b ways of performing both actions. In this example, the rule says: multiply 3 by 2, getting 6. The sets {A, B, C} and {X, Y} in this example are disjoint, but that is not necessary. The number of ways to choose a member of {A, B, C}, and then to do so again, in effect choosing an ordered pair each of whose components is in {A, B, C}, is 3 × 3 = 9.
sameAs
dcterms:subject
abstract
  • In combinatorics, the rule of product is a basic counting principle (a.k.a. the fundamental principle of counting). Stated simply, it is the idea that if we have a ways of doing something and b ways of doing another thing, then there are a · b ways of performing both actions. In this example, the rule says: multiply 3 by 2, getting 6. The sets {A, B, C} and {X, Y} in this example are disjoint, but that is not necessary. The number of ways to choose a member of {A, B, C}, and then to do so again, in effect choosing an ordered pair each of whose components is in {A, B, C}, is 3 × 3 = 9. In set theory, this multiplication principle is often taken to be the definition of the product of cardinal numbers. We have where is the Cartesian product operator. These sets need not be finite, nor is it necessary to have only finitely many factors in the product; see cardinal number.
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software