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

Home > Numbers
Ordering Pairs (Posted on 2004-11-06) Difficulty: 3 of 5
What are the smallest positive integers A, B, C, and D such that A+A > A+B > A+C > B+B > B+C > A+D > C+C > B+D > C+D > D+D ?

Note: Of all solutions, choose the one with the smallest A, then smallest B if there are more than one with the smallest A, etc.

See The Solution Submitted by Brian Smith    
Rating: 3.7500 (4 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re(2): Spoiler | Comment 7 of 10 |
(In reply to re: Spoiler by Osi)

The proof?  Sure.

ab+bc>cd>ab>bc

Note that all three terms are positive integers.  ab+bc is at least one more than cd, which is at least one more than ab. Therefore, ab+bc-2 is greater than or equal to ab.  Simplifying, bc is greater or equal to 2.  Knowing this, bc=2, ab=3, and cd=4 is the theoretical minimum.  It satisfies the inequalities, so it is the actual minimum.


  Posted by Tristan on 2004-11-07 15:19:12
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
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

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information