Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Let S = {1, 2, 3, 4}. Then the number of elements in the set { f : S $$\times$$ S $$\to$$ S : f is onto and f (a, b) = f (b, a) $$\ge$$ a $$\forall$$ (a, b) $$\in$$ S $$\times$$ S } is ______________.
Step 1: Symmetry leaves ten unordered pairs. Since f(a,b)≥max(a,b), f(1,1)=1 is forced to attain 1, and every pair involving 4 has image 4.
Step 2: For the two pairs with maximum 2 and the three with maximum 3, there are 3²·2³ assignments. Requiring at least one image 2 excludes 2²·2³ assignments.
Step 3: Among the remaining assignments, the only ones missing image 3 have the maximum-3 pairs all mapped to 4 and the maximum-2 pairs using only 2 and 4 with at least one 2: 2²−1=3 assignments. Thus the count is 3²·2³−2²·2³−3=37.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.