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.)
Question re(2): A start | Comment 6 of 16 |
(In reply to re: A start by Charlie)

I made an error in the two matches part, ity should read 99093, which is constructed by taking the bottom left of the 8 and the bottom left of the two to change the two in a nine.


The three matches part uses the lowest three matches of the two to turn that in a seven and put a 1 at the end.

Question: In your solution, how do you turn the 2 in a 6?

  Posted by Hugo on 2014-01-23 06:56:47
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 (3)
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