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: 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 |
re(2): A start
