Minimal number of buckets to hold X marbles while maintaining countability

  • Thread starter Thread starter KingNothing
  • Start date Start date
  • Tags Tags
    Countability
KingNothing
Messages
880
Reaction score
4
You are the owner of a marble warehouse where you store marbles in buckets. You can fit any number of marbles in one bucket. Your job is to store X marbles in a minimal number of buckets. But, when a customer comes and asks for Y number of marbles, you must be able to hand over some buckets and give them the exact number, without adding/removing marbles from the buckets.

Essentially, minimize the number of buckets while maintaining countability.

I was asked this question in a job interview, and would like to hear your answers.
 
Mathematics news on Phys.org
The optimal answer depends a lot on the distribution of customer demands. But part of the answer, I guess, would be to have the number of marbles in each bucket be a power of two: i.e., buckets with 1 marble, 2 marbles, 4, 8, ... That would allow you to fill any order. Off hand I can't think of another strategy that uses fewer buckets while preserving total flexibility.
 
pmsrw3 said:
1 marble, 2 marbles, 4, 8, ... That would allow you to fill any order.

That's the answer I gave: populate the buckets with powers of two and put the remainder in one "overflow" bucket.

The customer may ask for any number of marbles, but they don't care how many buckets they get. You only care how many buckets you store.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top