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.
Step 1: The digits are distinct, the greatest is 7, and the first pair and last pair have equal sums. Pair the four digits into two disjoint pairs with a common sum, one pair for positions 1–2 and the other for positions 3–4.
Step 2: Enumerating the possible common sums 7,8,9,10,11 gives respectively 24,16,16,8,8 ordered codes. Sums below 7 cannot use 7 with a distinct partner and a matching disjoint pair; sums 12 or more cannot form two disjoint pairs containing 7.
Step 3: There are 24+16+16+8+8=72 possible codes, so in the worst case 72 trials suffice.
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.