There are 6561 balls out of them 1 is heavy. Find the min. no.of times the ball have to be weighted for finding out the heavy ball.
Yes. But your algorithm for finding the heavy ballis as likely to require 6561 weighings, which is also the worst possible number of weighings.vaishakh said:I didn't understand this. sppose i took 1 bal and weighed it and suppose that is the heavy ball, then i am done just once.
I hope that [itex]n[/itex] is a huge number and the scale is very accurate.vaishakh said:About balls I have another question. There are 1000 machines in a company that manufactures balls. The company has an huge weighing machine such that you can weigh n number of balls in it. The company once observedthat one of the machines are producing heavy balls, the standard ball is 1g and the faulty 1.1g. Find the method to find the faulty machine by using the weighing machine just once.
Further the manager found after few days that the same fault has creeped into a number of machines. Still the weighing has to be used once to find all the faulty machines. Find the method.