Live data from Hacker News

Classic math puzzles for job interviews

scribd.com

11–20 of 21 posts

Re: Classic math puzzles for job interviews

#14
post #9

Wow, I am surprised #13 is listed as a 1-star problem. I was told a story about this problem by a professor while in class. Supposedly, Edgser Djisktra couldn't sleep one night due to jet lag. He was currently going through a phase in which was exercising the power of thought, practicing thought-exercises such as these without a pencil and paper. While in bed that night, awake due to jet lag, he solved this problem.…

I haven't solved it yet, but it seems to be solvable by sheer diligence? Is there a faster solution? I think in an interview I would ask to write a computer program that solves it. Wait - I guess now I have to try that :-(

Edit: which programming language has good support for primes? I thought I saw one recently, but can't find it now.

Re: Classic math puzzles for job interviews

#15
I don't see how the square could be partitioned, maybe I am reading it wrong? My informal counter proof by contradiction (decrypt with rot13.com):

fvapr gur cnegvgvba vf svavgr, gurer vf n fdhner Z jvgu gur fubegrfg fvqr. Abj pbafvqre gur fdhnerf nybat gur gbc fvqr bs gur havg fdhner. Gur fznyyrfg fdhner nzbat gurz unf n fvqr yratgu < 0.5, yrg'f pnyy vg F1. Abj pbafvqre ebj bs fdhnerf pbirevat gur obggbz fvqr bs F1. Gurer unf gb or n fznyyrfg fdhner nzbat gurz, jvgu yratgu < 0.5* fvqr_yratgu_bs(F1) = 0.25. Yrg gung fznyyrfg fdhner or F2. Abj pbafvqre gur ebj bs fdhnerf ng gur obggbz bs gung fdhner. Gurer unf gb or n fznyyrfg fdhner F3 nzbat gurz jvgu fvqr yratgu < 0.5*0.25 = cbjre(0.5,3). Naq fb ba - gurer vf nyjnlf n arkg ebj bs fdhnerf, nf gur fznyyrf fdhner va gur ebj pna abg gbhpu gur obggbz fvqr bs gur havg fdhner. Urapr V pna tb ba yvxr gung vasvavgryl, orpnhfr yvz cbj(0.5,a) = 0 riraghnyyl V'yy svaq n fdhner gung vf fznyyre guna Z, pbagenqvpgvba.

Re: Classic math puzzles for job interviews

#16
post #14
post #9

Wow, I am surprised #13 is listed as a 1-star problem. I was told a story about this problem by a professor while in class. Supposedly, Edgser Djisktra couldn't sleep one night due to jet lag. He was currently going through a phase in which was exercising the power of thought, practicing thought-exercises such as these without a pencil and paper. While in bed that night, awake due to jet lag, he solved this problem.…

I haven't solved it yet, but it seems to be solvable by sheer diligence? Is there a faster solution? I think in an interview I would ask to write a computer program that solves it. Wait - I guess now I have to try that :-( Edit: which programming language has good support for primes? I thought I saw one recently, but can't find it now.

Using the Goldbach Conjecture makes it easier.

Re: Classic math puzzles for job interviews

#18
post #14

Earlier quoted context omitted.

I haven't solved it yet, but it seems to be solvable by sheer diligence? Is there a faster solution? I think in an interview I would ask to write a computer program that solves it. Wait - I guess now I have to try that :-( Edit: which programming language has good support for primes? I thought I saw one recently, but can't find it now.

Using the Goldbach Conjecture makes it easier.

start small and work your way up?

lets say 1>x>y and x+y<=4...

Re: Classic math puzzles for job interviews

#20

In what kind of job interview would asking any of these help you select an employee?

Professional puzzle solver job interview!

In all seriousness, if you start getting these questions during the interview, you should realize that these people don't know how to hire and you should move away.

Post reply on HN