Ова датотека се налази на Викимедијина остава и може да се користи на другим пројектима.
Њен опис је приказан испод.
Опис
This file was moved to Wikimedia Commons from en.wikipedia using a bot script. All source information is still present. It requires review. Additionally, there may be errors in any or all of the information fields; information on this file should not be considered reliable and the file should not be used until it has been reviewed and any needed corrections have been made. Once the review has been completed, this template should be removed. For details about this file, see below.Check now!
ОписInclusion-exclusion-3sets.png
English: The numbers in the diagram indicate how many times the given formula counts that particular portion of the Venn Diagram. In the first picture, for example, an element in the intersection of A, B, and C will be counted 3 times. Each term of the inclusion-exclusion formula gradually refines these numbers until each portion of the Venn Diagram is counted exactly once.
Датум
(UTC)
Извор
Сопствено дело (Original text: I (Austinmohr (talk)) created this work entirely by myself.)
Ово дело је њен носилац ауторских права Austinmohr на енглески Википедија предао у јавно власништво. Ово се односи на цео свет. У случају да ово није правно могуће: Austinmohr творац овог дела дозвољава свакоме да користи ово дело за било коју намену, без било каквих услова, осим услова које намеће закон.Public domainPublic domainfalsefalse
Оригиналан опис странице је био овде. Сва наведена корисничка имена воде на en.wikipedia.
2010-05-07 01:07 Austinmohr 1200×484× (97959 bytes) {{Information |Description = Shows how the inclusion-exclusion principle gradually refines the count so that each portion of the Venn Diagram is counted exactly once. |Source = I (~~~) created this work entirely by myself. |Date =