Let n be an integer such that n > 3. Suppose that we choose three numbers from the set {1, 2, ..., n}. Using each of these three numbers only once and using addition, multiplication, and parenthesis, let us form all possible combinations.

(a) Show that if we choose all three numbers greater than n=2, then the values of these combinations are all distinct.

(b) Let p be a prime number such that p ≤ √n. Show that the number of ways of choosing three numbers so that the smallest one is p and the values of the combinations are not all distinct is precisely the number of positive divisors of (p - 1).

[APMO 1992 Q3]

**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.}

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