You are working in a ball factory, where balls of weight 1U, 2U, 3U ... 8U are made in 8 sections. One day, you are given 1023 black balls , all (except one special ball) from section 1, meaning weight = 1U (1U = 100 gram, but that is not really relevant) and you have a balancing scale, which shows whether left-is-more (<) or both-are-equal (=) or right-is-more (>). You also have one green ball of weight 1U.
All balls have the same size, look the same (except your own green ball) and feel same. All balls were made here, and you have to find which section that special ball (whose weight may be 2U or 3U or ... 8U) came from.
Everytime you use the balancing scale, you lose some brownie points (1 brownie point = 4 maroonie points, but that is totally irrelevant here), hence you want to find the answer with the least number of weightings.
How will you go about this ?
Can you prove that your solution uses the least number of weightings ?