All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic
2n+1 Statements (Posted on 2005-06-13) Difficulty: 2 of 5
1. At least 1 statement among these 2n+1 are true.
2. At least 3 statements among these 2n+1 are false.
3. At least 5 statements among these 2n+1 are true.
2n. At least (4n-1) statments among these 2n+1 are false.
2n+1. At least (4n+1) statements among these 2n+1 are true.

How many statements are true? Which?

No Solution Yet Submitted by Dustin    
Rating: 4.0000 (7 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Got it!!! Comment 15 of 15 |
OK, a little brute force and looking for patterns. Using the square brackets [] to mean round down, the solution is:

[n/8] + 1 + [(n+[(n+9)/8])/3]

The sequence, starting with n=0 is:

I can't explain the logic, I just charted it out and noticed a pattern of 2 different sequences, one effected by yet a third sequence.

I made a couple of assumptions. One is that when a statement is undefined (as it is for n=4 and every 8 from then on; 12, 20, 28...) it is NOT true.

The second assumtion is that a statement is true unless it MUST be false.

For the second part of the question, the following statements are true:

1. Statement 1 is always true.

2. For a given n=x, if a statement is true, then it is true for all n>x.

3. Odd numbered statements become true when n is divisable by 8. ie: when n=8, statement 3 becomes true. When n=16, the next odd numbered statement, 5 becomes true.

4. Even numbered statements become true when n+z is divisable by 3. Initially z=1, then it increases by 1 for every time that (n+1) is divisable by 8.

  Posted by Basil on 2005-09-03 22:19:26
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information