Leaderboard

Three logicians enter a bar. Bartender says Do all of you want a drink? First logician says, I don't know. Second logician says, I don't know. Third logician says, Yes.

Alright, I'll add a puzzle to the bunch... You have N computers on a space station. An accident happens, and some of the computers are damaged, but you know the number of good (undamaged) computers is greater than the number of bad (damaged) ones. Your goal is to find *one* computer that's still good. Your only method of testing is the following: Use one computer (say, X) to test another (Y). If X is a good computer, it tells you correctly the status of Y. If X is bad, it may or may not give the correct status of Y; assume it will give whatever answer is least useful to your testing strategy. In worst-case, how many tests must you use to find one computer that's still good? (in terms of N) You're permitted any combination of tests, though keep in mind the bad machines may not be consistent in the results they give you.

There are three one-dimensional tracks, of length 12, 7, and 5 spaces respectively. You start with pennies in the first space of each track; your opponent starts with pennies in the last space of each track. On your turn, you may move any one of your pennies any number of spaces in either direction along a track (as a chess rook), however you are not permitted to bypass the other player's penny or occupy its space. If a player has no legal move, he loses. What should your first move be?

An antifirst number is a natural number that has more divisors than any preceding number before it. E.g. 1 has 1 divisor, 2 has 2 divisors, (skip 3 since it only has 2 divisors) 4 has 3 divisors, 6 has 4 divisors, and so on... So the first four numbers are (1,2,4, and 6). Your tasks, find the biggest antifirst number under 1,000,000. Prove or provide a counter example to the following conjecture, all antifirst numbers greater than 6 are abundant or perfect.

A while ago, about a clock with indistinguishable hour and minute hands and asked at what times of day, between the hours of noon and midnight, it was impossible to unambiguously determine the time. The hands moved continuously. This puzzle asks a related question. At what times of day, between the hours of noon and midnight, is it impossible to distinguish the hands of such a clock from those of its mirror image? Clearly noon is one of these times, but not in general thereafter -- since the clock's hands will move clockwise while the hands of its mirror image will move counterclockwise.

Given a coin with probability p of landing on heads after a flip, what is the probability that the number of heads will ever equal the number of tails assuming an infinite number of flips?

This is a variation on the "nine tails" paradox: "No cat has eight tails. Every cat has one tail more than no cat. Therefore, every cat has nine tails".

Yeah, that's along the lines of what I am saying. Bread is not better than nothing because nothing is null and things can't be compared to null.

Isn't this moreso a case of zero versus null? Null is preferable to X 0+1 is preferable to 0 ergo 0+1 is preferable to null Zero and one can be ranked because they have relative value. Null can't be ranked since it's valueless. This is a paradox because people confuse zero with null; zero is a value while null is an absence of value.

Not a problem. God creates a pebble and then declares "I shall never pick it up". He is capable of lifting it, but can not break his promise. Conditions met.