A seller has an n kilogram stone which he wants to break into minimum
possible number of weights using which on a bi-panel scale he can sell in whole
kilograms up to n kilogram(s) of goods in one weighing. As in tradition, he can
place weights on both the panels but goods on only one panel. Our intention is
to find out the number of all different partitions possible with the minimum
number parts
... [Show full abstract] broken from an n kilogram stone so that all integral weights from
1 to n kilograms can be weighed using them. We call such partitions a feasible
partition. By the way, we will prove some rules of feasibility which will lead
us to our main result, the recursive function to find out the number of all
feasible partitions of any positive integer n.
