BdMO National Junior 2011/4

Discussion on Bangladesh Mathematical Olympiad (BdMO) National
User avatar
Site Admin
Posts: 751
Joined: Tue Nov 02, 2010 7:52 pm
Location: Dhaka, Bangladesh

BdMO National Junior 2011/4

Unread post by Moon » Fri Feb 11, 2011 1:10 pm

Problem 4:
Consider the numbers $1, 2, 3, \cdots 160$. What is the maximum number of numbers you can choose from this list so that no two numbers differ by $4$? Show the logic behind your answer.
"Inspiration is needed in geometry, just as much as in poetry." -- Aleksandr Pushkin

Please install LaTeX fonts in your PC for better looking equations,
learn how to write equations, and don't forget to read Forum Guide and Rules.

Posts: 188
Joined: Mon Jan 09, 2012 6:52 pm
Location: 24.4333°N 90.7833°E

Re: BdMO National Junior 2011/4

Unread post by sakibtanvir » Thu Jan 26, 2012 7:37 pm

Let me, divide the set into 40 equivalent subset such that every subset consists of 4 consecutive numbers.Now initialize from the 1st subset.The subset is {1,2,3,4}.the next one is {5,6,7,8} every number of this subset differs 4 with previous one.Like that every element of a subset must differ with the numbers of previous subset.If we should follow the condition we have to remove 1st,3rd,5th,7th............subsets.Or 2nd,4th,6th.........subsets.If we proceed with the 2nd procedure,we have to remove 20 subsets from list,So the number of existing integers is 80.Is my logic acceptable??
An amount of certain opposition is a great help to a man.Kites rise against,not with,the wind.

Posts: 5
Joined: Tue Feb 21, 2012 2:11 pm

Re: BdMO National Junior 2011/4

Unread post by Arafat » Tue Feb 21, 2012 2:19 pm

Good solution..

Post Reply