You’ve got someone working for you for seven days and a gold bar to pay him. The gold bar is segmented into seven connected pieces. You must give them a piece of gold at the end of every day. What and where are the fewest number of cuts to the bar of gold that will allow you to pay him 1/7th each day?
Solution: The gold bar is segmented into seven connected pieces
Let’s make 2 cuts(will result into three segments) such that we will have three segments of 1 piece(A) + 2 pieces(B) + 4 pieces(C) ….
Now let’s calculate …..
Day 1: Give A (+1) ….1
Day 2: Get back A, give B (-1, +2) …..2
Day 3: Give A (+1) ……3
Day 4: Get back A and B, give C (-2,-1,+4) ……….4
Day 5: Give A (+1) ……….5
Day 6: Get back A, give B (-1,+2) ……….6
Day 7: Give A (+1) ………7