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

 No Monochrome Sums (Posted on 2009-10-14)
Color each of the numbers 1 through n either red or blue such that if a+b=c then a, b and c are not all the same color. The addends are distinct.

For example with n=6 the sequence rbrbrb does not work because 2+4=6 but are all blue. Whereas rbrbbr does work.

What is the largest value of n for which such a sequence exists?

Note: Since the colors can be swapped, make the number 1 red.

Add a third color (green.) What is the new maximum value of n?

 See The Solution Submitted by Jer No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 re(3): Sloane says | Comment 7 of 9 |
(In reply to re(2): Sloane says by Charlie)

BTW, the first n=52 found for 4 colors is

rrbrbbrggrgbrbgrygrybrbyryyrybrbyryyrybrbgrggrgbgbrb

I'll see if the program, if left running long enough, can get closer to Sloane's n=66.

 Posted by Charlie on 2009-10-15 12:24:52
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 (2)
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