Puzzle 31 | (Minimum cut Puzzle)
You have got someone working for you for five days and a gold bar to pay him. You must give them a piece of gold at the end of every day. What are the fewest number of cuts to the bar of gold that will allow you to pay him 1/5th each day?
Answer :2
Explanation:
After two cut there are three pieces of 1 unit and two 2 unit.
On 1st day: Give him 1 unit.
On 2nd day: Give him 2 unit and take back 1 unit.
On 3rd day: Give him 1 unit (he already have 2 unit)
On 4th day: Give him 2 unit and take back 1 unit.(he already have 2 unit)
On 5th day: Give him 1 unit.(he already have two 2 unit)
Similar Puzzle: Pay an employee using a 7 units gold rod?
This article is contributed by Vikash Kumar. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Recommended Posts:
- Find minimum elements after considering all possible transformations
- Puzzle 1 | (How to Measure 45 minutes using two identical wires?)
- Puzzle 2 | (Find ages of daughters)
- Puzzle 3 | (Calculate total distance travelled by bee)
- Puzzle 4 | (Pay an employee using a 7 units gold rod?)
- Puzzle 13 | (100 Prisoners with Red/Black Hats)
- Puzzle 5 | (Finding the poisoned wine)
- Puzzle 6 | (Monty Hall problem)
- Puzzle 7 | (3 Bulbs and 3 Switches)
- Puzzle 8 | (Find the Jar with contaminated pills)
- Puzzle 9 | (Find the fastest 3 horses)
- Puzzle 10 | (A Man with Medical Condition and 2 Pills)
- Puzzle 11 | (1000 Coins and 10 Bags)
- Puzzle 12 | (Maximize probability of White Ball)
- Puzzle 14 | (Strategy for a 2 Player Coin Game)
- Find the winner of the Game to Win by erasing any two consecutive similar alphabets
- LINQ | Filtering Operator | OfType
- Node | URL.format(urlObject) API
- Radii of the three tangent circles of equal radius which are inscribed within a circle of given radius
- Find the integers that doesnot ends with T1 or T2 when squared and added X
