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

Home > General
Non-arithmetic Triplets (Posted on 2013-04-08) Difficulty: 3 of 5
Find nine different integers from 1 to 20 inclusive such that no combination of any three of the nine integers form an arithmetic sequence.

(For example, if two of the integers chosen were 7 and 13, then that would preclude 1, 10 and 19 from being included.)

No Solution Yet Submitted by K Sengupta    
No Rating

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

There is something to be said for Bryan's method.  I've been trying to work it into a problem for the past week - independently of this problem.

I've not considered how Compact a set of n integers can be with no 3 in arithmetic sequence.  But I can see by scanning your list that C(9)=20.

It looks like C(7)=13 and  C(8) = 14 etc but I'm not sure enough about what your program is doing to know if the first line of solution are minimums.

EDIT:  I could have looked it up myself.

Edited on April 9, 2013, 12:49 am
  Posted by Jer on 2013-04-09 00:46:52

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 (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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