NeuroEducation

Everyone Moves

Difficulty: Hard · Topics: Discrete Mathematics, Functions, Function Combinatorics

Hamma joyidan siljiydi

Let X=\1, 2, 3, 4, 5\. How many one-to-one functions f:X→ X satisfy f(x)≠ x for every x?

X=\1, 2, 3, 4, 5\ bo‘lsin. Nechta inyektiv f:X→ X funksiya har bir x uchun f(x)≠ x ni qanoatlantiradi?

Similar problems