There are five sets of digits - Set A, Set B, Set C, Set D and Set E as shown in given diagram. Set A contains one digit, Set B contains two digits, Set C contains three digits, Set D contains two digits and Set E contains one digit. Rearrange the digits, across the sets such that the number formed out of digits of Set C is multiple of the numbers formed from digits in the sets on either side. For example; in the given diagram, Set C is multiple of digits in Set A and Set B but not of Set D and Set E.
Table below can be scrolled horizontally
|SET A||SET B||SET C||SET D||SET E|
Common Information Question: 1/2
What is the minimum number of rearrangements required to arrive at the solution? A rearrangement is defined as an exchange of positions between digits across two sets. For example: when 1 from set C is exchanged with 5 of set E, it is counted as one rearrangement.
Error(s) Found !!!