For the list of 2n statements below, state how many are true in terms of n:

1: There is at least 1 true statement below this one.
2: There are at least 2 true statements below this one.
3: There are at least 3 true statements below this one.
...
n-1: There are at least n-1 true statements below this one.
n: There are at least n true statements below this one.

n+1: There are at least n false statements above this one.
n+2: There are at least n-1 false statements above this one.
n+3: There are at least n-2 false statements above this one.
...
2n-1: There are at least 2 false statements above this one.
2n: There is at least 1 false statement above this one.

The number of 2n statements that are true are:

for (n modulo 3) = 0, 2n/3
for (n modulo 3) = 1, undefined (paradox)
for (n modulo 3) = 2, (4n-2)/3 

Edited on December 8, 2012, 3:27 am

Posted by Dej Mar on 2012-12-08 03:23:01