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.)
Solution re(4): restrictions - no spoiler | Comment 13 of 16 |
(In reply to re(3): restrictions - no spoiler by Ady TZIDON)

Hmm, perhaps you're suggesting that, even if we can't insert carats or alter matches to make small superscript numbers, we can in fact create exponents?

In that case, I would take the same three matches (one from the 8, two from the 3) and make a 7, placed somewhat above and to the right of the other numbers. Result: 92097^7 = 5.620*10^34.

  Posted by Jyqm on 2014-01-25 13:54:40
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 (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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