The ole 12 snooker ball question (and my job)

  • Thread starter Thread starter seadalton
  • Start date Start date
  • Tags Tags
    Ball Job
seadalton
Messages
4
Reaction score
0
hello,

I had a job interview today with the ole 12 snooker ball question (a similar question is hosted on this PF site: physicsforums.com/archive/t-40405_12_red_snooker_balls.html ). The interviewer started with an 8 ball scenerio, then we went to 12 balls. In each case I had to sweat out the answer on a white board b/c it wasn't all that obvious to me.

Anywho, the last question from the interviewer for this topic was to create an algorithm for any number of balls to determine the minimum number of weight measurements needed to distingush the heavier ball. My simpleton answer was x/4 because 2 is the minimum measurement for 8 balls and 3 is the minimum for 12 balls. The interviewer thought my formula was pretty funny b/c the answer should have been an algorithm and not linier function. I thought he was pretty funny b/c I'm not working in a pool hall, but that's a different matter.

If you're familiar with the problem and you know the algorithm, could you please post it or send it to me (email address is in my profile).

Gratefully yours,

seadalton
 
Mathematics news on Phys.org
Out of curiosity, what type of job did you apply for that you got that type of question on your interview?
 
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