What is the biggest number you can make by moving exactly 2 matches in the number above?
Assume that numbers must be represented in their standard “digital clock” font (for example, a “1” requires two segments).
Solution
81151 is the biggest number.
The trick is you are not limited to just 3 digits! Break the “0” into two ones, and use those two matches to create a new “1” before the 5 (which gives you 15118). Then turn the whole thing upside-down:
980
47
1509
15118
81151
1503
999
980 …..I can’t see how some of these people end up with 1500 1200 by sonly moving two matches
👍
985
51181
5118^11
1900
15118
999
9E8
985