Question

There are three bags each of which contains 3 different integral weights. Each bag has the same weight as the other two bags. If 'x' is the maximum weight that can be weighed using all the 9 weights together, what is 'x' such that all the integers from 1 to x can be weighed using one or any combination among these 9 weights?​

Answer 1

Answer:

Minimum 2 times. Well this is puzzle mostly asked in interviews

Step-by-step explanation:

You can make 3 parts like 3–3–2. You can weigh 3–3 by weighing machine. if both are same the one is heavier from two which you kept aside.

Then weigh left two as 1–1 and you will get heavier.

While weighing 3–3 if one is heavier then take that part and keep one aside from that and weigh 1–1 if both are same then the one is kept side is heavier or if both are not same then ofcourse you will get heavier. :)

This way minimum two steps needed.

I hope you have got answer.

Mark me as branliest