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.

(In reply to re(2): A start by Hugo)

That was my mistake: I can't change the 2 to a 6 with a match: it comes out a backward 6 (partial differential symbol). The extra match would have to be used to change the 3 to a 9:

920491

Posted by Charlie on 2014-01-23 09:56:50