How many statements are true on a sheet of paper with 100 written down?

  • Thread starter Thread starter bob j
  • Start date Start date
  • Tags Tags
    Puzzle
AI Thread Summary
The discussion revolves around a sheet of paper with 100 self-referential statements about how many of them can be true. The first statement claims that at most 0 statements are true, while the last states that at most 99 are true. Analyzing these statements reveals that if n statements are true, the conditions create contradictions unless exactly 50 statements are true. Thus, the conclusion drawn is that precisely 50 of the statements on the sheet can be true. This logical puzzle highlights the complexities of self-referential statements and their implications.
bob j
Messages
22
Reaction score
0
on a sheet of paper, you have 100 statements written down. the first says, "at most 0 of these 100 statements are true." the second says, "at most 1 of these 100 statements are true." ... the nth says, "at most (n-1) of these 100 statements are true. ... the 100th says, "at most 99 of these statements are true." how many of the statements are true?

is it 99 statements?
 
Physics news on Phys.org
I think 50 statements are true...
 
I don't see that
 
bob j said:
on a sheet of paper, you have 100 statements written down. the first says, "at most 0 of these 100 statements are true." the second says, "at most 1 of these 100 statements are true." ... the nth says, "at most (n-1) of these 100 statements are true. ... the 100th says, "at most 99 of these statements are true." how many of the statements are true?

is it 99 statements?

These are self-referencing statements which creates a conceptual problem for me, but the statement "at most 99 of these (preceding ) statements are true", given the "at most" qualifier, makes the 100th statement true, but vacuous. I'm thinking the first statement must be true under any circumstances since it's not preceded by any statements.
 
If n statements are true, then "at most k statements are true" would be false for k<n and true for k between n and 99 inclusive. Thus we must have n=99-(n-1) which yields n=50.
 
It would be instructive to look at the case with 4 statements.

So
A: at most 0 statements are true
B: at most 1 statement is true
C: at most 2 statements are true
D: at most 3 statements are true

There are a few cases to consider:
1) All the statements are false
Then A would be true. So not all statements are false, which is a contradiction

2) Exactly one statement is true
Then A and B would be true. This is a contradiction

3) Exactly two statements are true
A and B would be false. C and D would be true. So no contradiction here.

4) Exactly three statements are true
Then only D would be true. So there are no three statements true. Contradiction!

5) Exactly four statements are true
Then all statements would be false. This is a contradiction.



So the correct answer here is that exactly two statements are true: C and D.
An analogous method would show you that, in your problem, exactly 50 statements are true (namely the last 50).
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Replies
1
Views
2K
Replies
19
Views
3K
Replies
4
Views
2K
Replies
4
Views
2K
Replies
99
Views
6K
Back
Top