Pigeonhole Principle
Prijzen vanaf
VERGELIJK ALLE AANBIEDERS
(3)
Bol
High Quality Content by WIKIPEDIA articles! In mathematics and computer science, the pigeonhole principle, also known as Dirichlet's box (or drawer) principle, states that if n items are put into m pigeonholes with n > m, then at least one pigeonhole must contain more than one item. More formally, it states that there does not exist an injective function on finite sets whose codomain is smaller than its domain. The theorem is exemplified in real-life by such truisms as that there must be at least two males or two females in a group of three people.
Lees meer
30,73
Uitgelicht
|
30,73 |
Naar shop
|
|
30,73 |
Naar shop
|
|
136,00 |
Naar shop
|
Beschrijving
Bol
High Quality Content by WIKIPEDIA articles! In mathematics and computer science, the pigeonhole principle, also known as Dirichlet's box (or drawer) principle, states that if n items are put into m pigeonholes with n > m, then at least one pigeonhole must contain more than one item. More formally, it states that there does not exist an injective function on finite sets whose codomain is smaller than its domain. The theorem is exemplified in real-life by such truisms as that there must be at least two males or two females in a group of three people.
Beschrijving
(2)
Bol
High Quality Content by WIKIPEDIA articles! In mathematics and computer science, the pigeonhole principle, also known as Dirichlet's box (or drawer) principle, states that if n items are put into m pigeonholes with n > m, then at least one pigeonhole must contain more than one item. More formally, it states that there does not exist an injective function on finite sets whose codomain is smaller than its domain. The theorem is exemplified in real-life by such truisms as that there must be at least two males or two females in a group of three people.
AmazonPagina's: 80, Paperback, Betascript Publishers
ProductspecificatiesPrijzen voor het laatst bijgewerkt op:
Gerelateerde producten
Uitgelichte Keuze
30,73
