--- title: The Fundamental Counting Principle - Explained with Examples description: Learn the fundamental counting principle, the core rule of combinatorics for calculating outcomes in sequential tasks. See simple examples. url: https://astra-ai.co/videos/combinatorics/fundamental-counting-principle/ locale: en type: video-chapter keywords: - fundamental counting principle - counting outcomes - multiplication principle - combinatorics published: 2026-10-01T09:50:07.239Z updated: 2026-10-04T21:58:35.872Z alternates: bg: https://astra-ai.co/bg/videos/kombinatorika/osnovniyat-printsip-na-broeneto/ br: https://astra-ai.co/br/videos/combinatoria/capitulo-matematica-003/ cs: https://astra-ai.co/cs/videos/kombinatorika/zakladni-princip-pocitani/ da: https://astra-ai.co/da/videos/kombinatorik/det-fundamentale-taelleprincip/ de: https://astra-ai.co/de/videos/kombinatorik/grundlegendes-zaehlprinzip-kombinatorik/ el: https://astra-ai.co/el/videos/syndyastiki/themeliodis-archi-katametrisis/ en: https://astra-ai.co/videos/combinatorics/fundamental-counting-principle/ en-IN: https://astra-ai.co/en-IN/videos/combinatorics/chapter-8a145e57/ en-PH: https://astra-ai.co/en-PH/videos/combinatorics/chapter-8a145e57/ es: https://astra-ai.co/es/videos/combinatoria/principio-fundamental-del-conteo/ es-AR: https://astra-ai.co/es-AR/videos/combinatoria/capitulo-49/ es-CL: https://astra-ai.co/es-CL/videos/combinatoria/capitulo-49/ es-PE: https://astra-ai.co/es-PE/videos/combinatoria/capitulo-video-8a145e57/ et: https://astra-ai.co/et/videos/kombinatoorika/loendamise-pohieeskiri/ fi: https://astra-ai.co/fi/videos/kombinatorikka/tulosaanto/ fr: https://astra-ai.co/fr/videos/combinatoire/principe-fondamental-de-comptage/ hr: https://astra-ai.co/hr/videos/kombinatorika/osnovno-pravilo-brojanja/ hu: https://astra-ai.co/hu/videos/kombinatorika/az-alapveto-szamlalasi-elv/ id: https://astra-ai.co/id/videos/kombinatorika/prinsip-dasar-pencacahan/ it: https://astra-ai.co/it/videos/combinatoria/principio-fondamentale-conteggio/ ja: https://astra-ai.co/ja/videos/combinatorics-ja/49/ km: https://astra-ai.co/km/videos/combinatorics/chapter-8a145e57/ ko: https://astra-ai.co/ko/videos/combinatorics-ko/49/ lo: https://astra-ai.co/lo/videos/lo-dd33883f/lo-8a145e57/ lt: https://astra-ai.co/lt/videos/kombinatorika/pagrindinis-skaiciavimo-principas/ lv: https://astra-ai.co/lv/videos/kombinatorika/pamata-skaitisanas-princips/ ms: https://astra-ai.co/ms/videos/combinatorics/bab-03-matematik-asas/ ms-BN: https://astra-ai.co/ms-BN/videos/kombinatorik/bab-8a145e57/ mx: https://astra-ai.co/mx/videos/combinatoria/capitulo-49/ my: https://astra-ai.co/my/videos/my-dd33883f/my-8a145e57/ nl: https://astra-ai.co/nl/videos/combinatoriek/fundamenteel-telprincipe/ no: https://astra-ai.co/no/videos/kombinatorikk/det-grunnleggende-telleprinsippet/ pl: https://astra-ai.co/pl/videos/kombinatoryka/fundamentalna-zasada-zliczania/ pt: https://astra-ai.co/pt/videos/combinatoria/principio-fundamental-da-contagem/ pt-TL: https://astra-ai.co/pt-TL/videos/combinatoria/capitulo-de-video-049/ ro: https://astra-ai.co/ro/videos/combinatorica/principiul-fundamental-al-numararii/ sk: https://astra-ai.co/sk/videos/kombinatorika/kapitola-049/ sl: https://astra-ai.co/sl/videos/kombinatorika/osnovno-pravilo-stetja/ sr: https://astra-ai.co/sr/videos/kombinatorika/poglavlje-049/ sv: https://astra-ai.co/sv/videos/kombinatorik/den-grundlaggande-rakneregeln/ th: https://astra-ai.co/th/videos/combinatorics/bot-03-lak-kan-nap/ tr: https://astra-ai.co/tr/videos/kombinatorik/bolum-049/ uk: https://astra-ai.co/uk/videos/uk-topic-05/uk-chapter-03/ vi: https://astra-ai.co/vi/videos/vi-topic-05/vi-chapter-03/ zh-HK: https://astra-ai.co/zh-HK/videos/shuxue-kecheng-005/shuxue-zhang-003/ zh-TW: https://astra-ai.co/zh-TW/videos/combinatorics/chapter-8a145e57/ --- # The Fundamental Counting Principle > The fundamental counting principle multiplies the number of choices at each step. This chapter shows how to count outcomes that way. ## INTRODUCTION TO COUNTING METHODS Combinatorics is the branch of mathematics that deals with counting possible arrangements, selections, or distributions of elements within a given set of rules. One of the core concepts in this discipline is the **fundamental counting principle**, which allows for fast and systematic counting without needing to list every single possibility. ## THE PRINCIPLE AND ITS DEFINITION The fundamental counting principle states: If a task consists of a sequence of phases, where: - the first phase can be done in **n₁** ways, - the second phase can be done in **n₂** ways, - the third phase can be done in **n₃** ways, - ... and so on, then the entire task can be completed in: **n₁ \* n₂ \* n₃ \* … \* nₖ** ways. This principle applies on the condition that the choices in each phase do not exclude one another and are dependent on their order. ## EXAMPLE 1: CHOOSING A CODE If we want to create a three-digit numerical code where each position can contain any digit from 0 to 9 (10 possibilities), then the number of all possible codes is: 10 \* 10 \* 10 = **1,000** different codes. ## EXAMPLE 2: OUTFIT COMBINATIONS If you have 3 shirts, 4 pairs of pants, and 2 pairs of shoes, then the number of possible outfit combinations is: 3 \* 4 \* 2 = **24** combinations. ## EXTENSION: RESTRICTIONS AND REPETITION If repetition is not allowed in the individual phases, the number of options decreases accordingly. For example, if we are creating a code from three different letters (without repetition) from 5 available letters, then: - First choice: 5 options - Second choice: 4 options - Third choice: 3 options → Total: 5 \* 4 \* 3 = **60** options ## CONNECTION TO PERMUTATIONS AND VARIATIONS The fundamental counting principle is the foundation for more complex combinatorial formulas, such as: - **Permutations** (arrangements of all elements) - **Variations** (arrangements of subsets) - **Combinations** (selections without regard to order) Each of these concepts uses the fundamental principle as a basis for constructing its own formulas. ## CONCLUSION The fundamental counting principle is the simplest yet an incredibly effective tool for counting possible arrangements in sequential choices. It tells us that the total number of possibilities in sequential, independent phases is found by multiplying the options, which allows for a quick analysis of even very complex situations.