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

Home > Numbers
Maximizing Matches Model (Posted on 2014-01-22) Difficulty: 3 of 5
A five digit number 82093, constructed by 29 matches looks like this:


  _    _    _    _    _ 
 |_|   _|  | |  |_|   _|
 |_|  |_   |_|   _|   _|


You are requested to make this number as big as possible by moving only two matches.

What is the maximum value and how is it achieved?

What would be your answer if 3 matches were allowed to be relocated?

Be creative - no restrictions re your answers.

See The Solution Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re(2): restrictions - no spoiler | Comment 11 of 16 |
(In reply to re: restrictions - no spoiler by Ady TZIDON)

So by "be creative - no restrictions," you meant "follow the logical restrictions and don't get creative at all," eh? ;)


Suppressing my creativity, my "normal" answers would be:

two matches - 920531 (taking one match each from the 8 -- which becomes a 9 -- and the 9 -- which becomes a 5 -- to create the 1 on the end)

three matches - 928971 (taking one match from the 8 -- which becomes a 9 -- to turn the 0 into an 8; and taking two matches from the 3 -- which becomes a 7 -- to create the 1 on the end)

Edited on January 24, 2014, 2:56 am
  Posted by Jyqm on 2014-01-24 02:46:36

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

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