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

Home > Just Math
3 out of 5 (Posted on 2022-07-15) Difficulty: 2 of 5
Please prove the following statement:

In every set of 5 integers one can always select 3 members such that their sum is divisible by 3.

Source: Crux Mathematicorum

REM: The original puzzle specifies positive integers. Considering this word as redundant I have erased it.
Do you agree?

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

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionPossible Solutionbroll2022-07-16 07:29:06
SolutionPuzzle SolutionK Sengupta2022-07-15 15:22:22
Please log in:
Remember me:
Sign up! | Forgot password

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

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