Question

Before leaving, he wants to test whether his friend Captain Haddock is wise enough. So he
places three boxes A,B,C contain initially 0, 0, 27 balls respectively. He tells that he wants
equality among the boxes, and at every ith move you make, you must transfer exactly i balls
from one box to another. And you cannot transfer balls between A and B. How many minimum steps( If possible) will Captain take to get to equal number of balls in each box?

Answer 1

Answer:

For Q1, Put 1 ball in A from C, 2 balls in B from C, 3 balls in A from C, 4 balls in A from C, 5 balls in C from A, 6 balls in A from C and 7 balls in B from C.

Therefore, A has 1+3+4-5+6 = 9 and B has 2+7 = 9 balls. Minimum number of moves 7.

Answer 2

Answer:

minimum moves of balls are 7