Comprehensive Study Guide for 10th Grade Mathematics: Counting, Permutations, and Combinations

Counting Principles: Addition and Multiplication Rules

Counting methods are foundational to probability and statistics. Specifically, the Addition Rule (Toplama Yoluyla Sayma) and the Multiplication Rule (Çarpma Yoluyla Sayma) are used to determine the total number of possible outcomes for a given set of operations.

The Addition Rule is applied when a choice is made between mutually exclusive events. In the example of Soner, who wants to buy a book from a library shelf containing $5$ different novels and $4$ different poetry books, the number of ways he can choose $1$ novel or $1$ poetry book is the sum of the options: $5 + 4 = 9$

The Multiplication Rule is applied when multiple choices are made in sequence. For instance, if Recep is in a shop with $4$ different t-shirts and $3$ different pairs of pants and wants to buy $1$ t-shirt and $1$ pair of pants, the total number of combinations is the product of the options: $4 \times 3 = 12$

Path Problems in Counting

When calculating routes Between cities (e.g., City A, City B, and City C), the multiplication rule is used for sequential stages. Consider a scenario where there are $3$ different paths between A and B, and $4$ different paths between B and C.

To calculate the total ways to travel from A to C, passing through B: $3 \times 4 = 12$

For a round trip (A to C and back to A): $(3 \times 4) \times (3 \times 4) = 12 \times 12 = 144$

If the condition is that the same path used to go must be used to return: $3 \times 4 \times 1 \times 1 = 12$

If the condition is that the specific path used during the outgoing trip cannot be used during the return trip (no repeating any single road segment between cities): $3 \times 4 \times (4-1) \times (3-1) = 3 \times 4 \times 3 \times 2 = 72$

Linear Permutations and Conditional Arrangements

Permutation refers to the arrangement of objects in a specific order. The general formula for arranging $n$ distinct objects is $n!$.

Case Study: Student Arrangements If $3$ girls and $2$ boys are to be arranged for a photo with girls in the front and boys in the back, the arrangements within those rows are independent. The girls can be arranged in $3!$ ways and the boys in $2!$ ways. The total combinations are: $3! \times 2! = 6 \times 2 = 12$

Case Study: Dance Team In an $8$-person dance team, specialized positions reduce flexibility. If Ali (the captain) must be on the far left and AyŘe (the assistant) must be on the far right, their positions are fixed ($1$ choice each). The remaining $6$ members can be arranged in the middle spots in $6!$ ways: $1 \times 6! \times 1 = 720$

Case Study: Book Shelf Arrangements A shelf contains $2$ Mathematics books and $3$ Physics books.

• Total unrestricted arrangements: $5! = 120$.
• Specific books fixed: If Math 1 is on the far left and Physics 2 is on the far right, the remaining $3$ books fill the middle spots in $3! = 6$ ways.
• Physics books together: Treat the $3$ physics books as a single unit or "block." This gives $3$ units to arrange (The Math books + the physics block). The total is $(2+1)! \times 3! = 6 \times 6 = 36$.
• Same genre books together: Treat Math books as one block ($2!$) and Physics books as one block ($3!$). There are $2!$ ways to arrange the blocks themselves. Total: $2! \times (2! \times 3!) = 2 \times 2 \times 6 = 24$.

Permutations with Numbers and Words

Digit Arrangements Using the set $A = \{1, 2, 3, 4\}$, the number of $4$-digit numbers that can be written without repeating digits is $4! = 24$.

Alphabetical Sorting (The "ELMA" Problem) When words of a certain length are sorted alphabetically, we count how many words come before the target. To find the position of the word "ELMA" (composed of A, E, L, M):

• Words starting with "A": $3! = 6$
• Words starting with "E":   1. E-A-L-M ($7^{th}$)   2. E-A-M-L ($8^{th}$)   3. E-L-A-M ($9^{th}$)   4. E-L-M-A ($10^{th}$) Thus, "ELMA" is the $10^{th}$ word.

Competition Outcomes In a race with $4$ athletes, the number of different outcomes for the first three places (top three) is a permutation of $4$ items taken $3$ at a time: $P(4, 3) = 4 \times 3 \times 2 = 24$

Specific Relative Positioning Among $5$ people, including Selim, H$fclya, and Emir, if Emir must be between Selim and H$fclya and the three must be together, they form a block. Within the block, there are $2$ arrangements (S-E-H or H-E-S). Including the remaining $2$ people, we arrange $3$ items: $2 \times 3! = 12$.

Identical Permutations (Tekrallı Sıralama)

When some items are identical, we divide the total factorial by the factorials of the counts of repeated items.

Number Example: "122333" Number of permutations of the digits: Total digits $n = 6$. Frequency: "1" once, "2" twice, "3" three times. $\frac{6!}{1! \times 2! \times 3!} = \frac{720}{2 \times 6} = 60$

Word Example: "KARAKALTAK" Total letters: $10$. Frequencies: K ($3$), A ($4$), R ($1$), L ($1$), T ($1$). $\frac{10!}{3! \times 4! \times 1! \times 1! \times 1!} = 12,600$

Constraint Example with Zero: "222033" Total permutations of $6$ digits (three "2", one "0", two "3"): $\frac{6!}{3! \times 1! \times 2!} = 60$ However, a natural 6-digit number cannot start with $0$. Since $1$ of the $6$ digits is zero, $\frac{5}{6}$ of the total arrangements are valid: $60 \times \frac{5}{6} = 50$

Principles of Selection and Combinations

Combinations are used when the order of selection does not matter. The formula for choosing $r$ items from $n$ is $C(n, r) = \frac{n!}{r!(n-r)!}$.

Team Selection with Conditions At a school with $10$ teachers, a group of $4$ is selected for a trip. If H$fclya teacher must be in the group, we only need to choose $3$ more teachers from the remaining $9$: $C(9, 3) = \frac{9 \times 8 \times 7}{3 \times 2 \times 1} = 84$

Professional Mix A committee of $3$ is formed from $3$ architects and $2$ engineers. If the condition is to have at least one architect, we calculate the total possible committees and subtract those with no architects (though in this case, since there are only 2 engineers, it's impossible to have a 3-person team with no architects). Alternatively, sum the valid cases:

• 1 Architect, 2 Engineers: $C(3, 1) \times C(2, 2) = 3 \times 1 = 3$
• 2 Architects, 1 Engineer: $C(3, 2) \times C(2, 1) = 3 \times 2 = 6$
• 3 Architects, 0 Engineers: $C(3, 3) \times C(2, 0) = 1 \times 1 = 1$ Total: $3 + 6 + 1 = 10$

Pascal’s Triangle and Pigeonhole Principle

Pascal's Triangle The triangle consists of binomial coefficients $C(n, r)$.

• The $8^{th}$ row represents coefficients for $n=8$.
• The largest number in any row is the middle value. For $n=8$, this is $C(8, 4)$. $C(8, 4) = \frac{8 \times 7 \times 6 \times 5}{4 \times 3 \times 2 \times 1} = 70$

Pigeonhole Principle In a scenario at a music festival where t-shirts are given in $5$ different colors (red, blue, green, yellow, purple), we want to guarantee that at least $2$ people are wearing the same color. By the Pigeonhole Principle, if there are $n$ categories, you need $n+1$ items to guarantee a duplicate. $\text{Participants required} = 5 + 1 = 6$

Factorial Simplification and Equations

Standard factorial operations allow for simplification by expanding the larger factorial down to the smaller one.

Example 1:$\frac{8!}{6!} = \frac{8 \times 7 \times 6!}{6!} = 56$

Example 2: If $\frac{n!}{(n-2)!} = 35$, then $n(n-1) = 35$. This has no integer solution for $35$. If the result were $30$, $n = 6$. If the transcript intended $\frac{(n+1)!}{(n-1)!} = 42$, then $(n+1)n = 42 \implies n=6$.

Example 3:$\frac{7! + 6!}{5!} = \frac{6!(7+1)}{5!} = \frac{8 \times 6 \times 5!}{5!} = 48$

Questions & Discussion

Question: Between A and B there are 3 paths, B and C there are 4. How many ways to go and return without using the same single road twice? Response: You multiply the outgoing options ($3 \times 4$) by the returning options minus the roads used. So, $12 \times (4-1) \times (3-1) = 12 \times 3 \times 2 = 72$.

Question: How many paths spell "H$fclYA" in the provided triangular letter grid? Response: Starting from 'H' and moving down to 'A', there are $4$ transitions. At each letter, there are $2$ possible neighbor letters to move to. The total number of ways is $2^4 = 16$.

Question: How many 3-digit natural numbers can be written with $A = \{0, 1, 2, 3, 4, 5\}$? Response: The hundreds place cannot be $0$, so there are $5$ choices. The tens and units places can be any of the $6$ digits. Total: $5 \times 6 \times 6 = 180$.