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(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 |