Recent content by dlh

musicgold, the usual way to solve it is to write a recursive program.

I've had a look at this for a few minutes, and I'm not sure it can be done. On re-arranging, it seems to boil down to knowing in advance what irrational number x will make 2^x an approximate integer.

It looks a bit like the n-queens problem, to me. Definition of the n-queens problem: Place n queens on an n*n chessboard so that no queen is on the same diagonal or in the same row or column as any other queen. The coordinate pts (x, y) you are choosing could represent a queen at the...