0 reads0 ratings0 helpful
If (f:A\to A), where (A={1,2,3,4}), is a permutation function, how many such functions exist?यदि (f:A\to A) जहाँ (A={1,2,3,4}), एक क्रमचय फलन है, तो ऐसे कितने फलन होंगे?
Answer and explanationउत्तर और व्याख्या
Correct answer:सही उत्तर: (24)(24)
Step 1: A permutation function means a one-one and onto function from (A) to (A). Step 2: The number of ways to arrange (4) elements in (4) positions is (4!). Step 3: Hence there are (24) such functions.चरण 1: क्रमचय फलन का अर्थ है (A) से (A) में एकैकी और आच्छादी फलन। चरण 2: (4) तत्वों को (4) अलग स्थानों पर जमाने के तरीके (4!) होते हैं। चरण 3: इसलिए ऐसे फलन (24) हैं।
Student feedback
Was this question useful?
Was this question useful?
👍 0 Helpful 👎 0 Not helpful
Difficulty
Easy0%
Medium0%
Hard0%
Was the explanation clear?
Yes 0% No 0%
0 responsesStudent Reviews
No published reviews yet.
