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

Home > Numbers > Sequences
Pigeons again (Posted on 2012-07-22) Difficulty: 3 of 5
If a n-term arithmetic progression is split into two sets, then at least one of the sets contains a 3-terms arithmetic progression .

For what minimal value of n the above statement is true?

Based upon a proof in V. K. Balakrishnan's Theory and Problems of Combinatorics, Schaum's Outline Series, McGraw-Hill, 1995, 1.110

No Solution Yet Submitted by Ady TZIDON    
Rating: 5.0000 (2 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsI agreebroll2012-07-23 00:48:23
SolutionnMath Man2012-07-22 12:55:40
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 (8)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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