Counting Injections with a Condition
Difficulty: Easy · Topics: Discrete Mathematics, Counting, Functions
Shartli in’yeksiyalarni sanash
f:A→ A, A=\0,1,2,3\. Find the number of injective (one-to-one) functions with f(1) f(0).
f:A→ A, A=\0,1,2,3\. f(1) f(0) bo‘lgan in’yektiv (o‘zaro bir qiymatli) funksiyalar sonini toping.