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: restrictions - no spoiler by Ady TZIDON)
So by "be creative - no restrictions," you meant "follow the logical restrictions and don't get creative at all," eh? ;)
Suppressing my creativity, my "normal" answers would be:
two matches - 920531 (taking one match each from the 8 -- which becomes a 9 -- and the 9 -- which becomes a 5 -- to create the 1 on the end)
three matches - 928971 (taking one match from the 8 -- which becomes a 9 -- to turn the 0 into an 8; and taking two matches from the 3 -- which becomes a 7 -- to create the 1 on the end)
Edited on January 24, 2014, 2:56 am
|
|
Posted by Jyqm
on 2014-01-24 02:46:36 |
re(2): restrictions - no spoiler
