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

 Colourful set (Posted on 2006-12-06)
Find the smallest integer n for which the following is possible:

Consider a set of positive integers {1,2...n}. Each number is painted with either red or blue paint, but no matter which numbers have which color, you can always find four (not necessarily different) numbers x, y, z and w that are coloured with the same paint and satisfy x+y+z=w.

 No Solution Yet Submitted by atheron Rating: 4.2500 (4 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 smallest | Comment 4 of 5 |
(In reply to Even smaller answer by Steve Herman)

n=11

assume a coloring can be found that does not allow x,y,z to be found.  wlog 1=red
3=blue (1+1+1)
9=red (3+3+3)
11=blue (9+1+1)

if 2=red then
4=blue (1+1+2)
11=red (3+4+4) -><-
if 2=blue then
6=red (2+2+2)
8=blue (6+1+1)
8=red (3+3+2) -><-

for n=10 here is a coloring that does not allow x,y,z to be found:
1=red
2=red
3=blue
4=blue
5=blue
6=blue
7=blue
8=blue
9=red
10=red

if x,y,z are blue w>=9 and so is red (or does not exist)
if x,y,z are red then either w>10 or w is > 2 and < 7 i.e. blue

 Posted by Joel on 2006-12-06 13:40:12

Please log in:
 Login: Password: Remember me: Sign up! | Forgot password

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

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