21 Nov 2013

MEMO 2012 Q2: Upper Secondary Mathematics Competition Question

Let N be a positive integer. A set S is a subset of {1, 2, ..., N} and is called 'allowed' if it does not contain three distinct elements a, b, c such that a divides b and b divides c.

Determine the largest possible number of elements in an allowed set S.

[MEMO 2012 Problem I-2]
[MEMO = Middle European Mathematical Olympiad]

Feel free to comment, ask questions and even check your answer in the comments box below powered by  Disqus Google+.


This space is here to avoid seeing the answers before trying the problem!


If you enjoy using this website then please consider making a donation - every little helps :-)

You can receive these questions directly to your email box or read them in an RSS reader. Subscribe using the links on the right.

Don’t forget to follow Gifted Mathematics on Google+Facebook or Twitter. You may add your own interesting questions on our Google+ Community and Facebook..

You can also subscribe to our Bookmarks on StumbleUpon and Pinterest. Many resources never make it onto the pages of Gifted Mathematics but are stored in these bookmarking websites to share with you.

No comments:

Post a Comment

Related Posts Plugin for WordPress, Blogger...