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(5): restrictions - no spoiler by Ady TZIDON)
Ha! But of course. For some reason, my brain has been short-circuiting every time I look at this puzzle, and I keep forgetting that a smaller number with a larger exponent will beat the reverse every time.
Google refuses to even attempt to calculate the value of that answer... wow!
|
|
Posted by Jyqm
on 2014-01-25 18:02:41 |
re(6): restrictions - no spoiler
