Suppose there are a number of cars at the start line of circular racing track with a fueling station. Each car can carries enough fuel to drive exactly half a lap. The cars can either refuel at the finish line or transfer any amount of fuel from one car to another when they are next to each other. I am tasked to find the minimum number of cars required for at least one car to finish a loop.
My intuition tells me to approach this problem using a geometric series, but I don’t even know how to model the problem correctly. Please advise, and thank you!