Counting Bijections
Difficulty: Easy · Topics: Discrete Mathematics, Counting, Functions
Biyeksiyalarni sanash
Let f:A→ B, where t∈mathbbR,
n(A)=t^2-t-3, n(B)=2t+1.
Find the number of bijective functions f.
f:A→ B bo‘lsin, bunda t∈mathbbR,
n(A)=t^2-t-3, n(B)=2t+1.
Biyektiv f funksiyalar sonini toping.