I've been thinking about this for a while, and I do believe I finally came up with a solution. A point to whoever comes up with one next.
The challenge: Come up with an algorithm to divide a square into n smaller squares (not necessarily of the same size) for all n > 5. (4 is simple; 2, 3 and 5 are impossible.)
oh so lovingly written by
Matthew |
i sincerely do not know what you are doing here. are you lost? were you
looking for your delicate calico cat, and did you follow her up two flights of stairs
to this room? she is not here. she was here, yes. we gave her a warm bowl of milk, we talked with her about campaign finance reform for a time, and then she bid us good day. i believe she was
going to the post office two blocks down, but i don't quite recall.
for surely you did
not find your way from prinsiana, the least traveled site on
the internet. if you did, though, perhaps you are looking for humor. perhaps you are looking for profundity. perhaps you are looking for answers.
i'm sorry, but you shall go naught-for-three.
