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.)
Some Thoughts re: restrictions - no spoiler | Comment 7 of 16 |
"No restrictions "   cannot be taken as allowing non-compliance with all conditions of the text : moving only 2 matches, keeping size and font intact and not inserting signs that imply moving additional matches to create extra space.
IMHO the font defines the following allocation of matches/digit:
1..............2 matches
7..............3 matches
4..............4 matches
2,3,5........5 matches
0,6,9........6 matches
8..............7 matches.

My "official" solution will be based upon this allocation,
mentioning other assumptions as well.

Edited on January 23, 2014, 11:51 pm
  Posted by Ady TZIDON on 2014-01-23 08:23:34

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

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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information