PENGETAHUAN KUANTITATIF UTBK 2025

Summary

This educational video explains the fundamentals of permutations as part of preparation for the 2025 UTBK exam. The instructor introduces the concept of permutations as arrangements where order matters, contrasting it with combinations. Through clear examples and step-by-step explanations, viewers learn how to calculate permutations using factorials and the formula n!/(n−r)!. The lesson includes practical practice problems, such as selecting organization leaders or assigning roles, to reinforce understanding. The video gradually increases difficulty to build confidence and encourages students to actively solve problems. Overall, it motivates UTBK candidates to strengthen their quantitative reasoning skills and prepare effectively for upcoming exams.

Takeaways

• 😀 Permutation is the arrangement of elements in a specific order, and the order matters—AB is different from BA.
• 😀 The factorial method can be used to calculate permutations of all elements: n! (n factorial).
• 😀 When selecting r elements from n available elements with order important, the permutation formula is P(n, r) = n! / (n-r)!.
• 😀 Example: For 3 elements (A, B, C), all permutations are ABC, ACB, BAC, BCA, CAB, CBA, totaling 6 permutations (3!).
• 😀 For 4 elements taken 2 at a time, the permutations are 12, calculated by 4! / (4-2)! = 12.
• 😀 In selection problems like choosing a president and secretary from 3 people, order matters, so AB ≠ BA and total permutations = 6.
• 😀 Another example: Selecting Hokage, Reikage, and Toge from 5 shinobi, order matters, calculated as 5! / (5-3)! = 60.
• 😀 Permutations can also be applied to musical roles: choosing 3 people from 7 for vocalist, guitarist, and keyboardist gives 7! / (7-3)! = 210 permutations.
• 😀 The key difference between permutation and combination is that order matters in permutations, but not in combinations.
• 😀 Using the 'serepet seruput' method helps simplify factorial calculations by canceling terms between numerator and denominator efficiently.
• 😀 Practice and examples from UTBK-style questions help solidify understanding, from basic to higher-level (HOTs) problems.

Q & A

What is the definition of a permutation?

A permutation is the arrangement of elements in a specific order. The order is important, so changing the order creates a different permutation.

How is permutation different from combination?

In permutation, the order of elements matters, whereas in combination, the order does not matter. For example, AB and BA are different in permutation but considered the same in combination.

What is the formula for calculating permutations?

The formula is P(n, r) = n! / (n-r)!, where n is the total number of elements, and r is the number of elements taken at a time.

How many permutations are there if 3 elements are taken 2 at a time?

Using the formula P(3,2) = 3! / (3-2)! = 6 permutations.

How many permutations are there if 4 elements are taken 2 at a time?

Using the formula P(4,2) = 4! / (4-2)! = 24 / 2 = 12 permutations.

If there are 10 candidates for positions of chairman, secretary, and treasurer, how many possible arrangements are there?

Using the permutation formula P(10,3) = 10! / (10-3)! = 10 × 9 × 8 = 720 possible arrangements.

How does the 'serepet seruput' method help in solving permutation problems?

The 'serepet seruput' method simplifies factorial calculations by multiplying only the necessary sequence of numbers instead of calculating the full factorial, making the process faster and easier.

How many ways can 5 people be assigned to 3 roles if order matters?

Using P(5,3) = 5 × 4 × 3 = 60 ways.

In a permutation problem involving 7 people and 3 roles, why is the order important?

Order is important because each role is distinct. For example, being chosen as the first role (vocalist) is different from being chosen as the second role (guitarist).

Why is understanding permutations important for UTBK preparation?

Permutations frequently appear in quantitative and mathematical reasoning sections. Understanding them helps students solve problems quickly and accurately, especially under time constraints.