perplexus.info :: Numbers : Maximizing Matches Model

Maximizing Matches Model (Posted on 2014-01-22)

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.

Submitted by Ady TZIDON

No Rating

Solution: (Hide)

If 2 matches were removed: 920931
If 3 matches were allowed: 7⁹²⁰⁹⁷
See other solvers' suggestions.

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
re(7): restrictions - no spoiler (spoiler added)	Charlie	2014-01-26 10:49:48
re(6): restrictions - no spoiler	Jyqm	2014-01-25 18:02:41
re(5): restrictions - no spoiler	Ady TZIDON	2014-01-25 15:20:59
re(4): restrictions - no spoiler	Jyqm	2014-01-25 13:54:40
re(3): restrictions - no spoiler	Ady TZIDON	2014-01-24 22:09:00
re(2): restrictions - no spoiler	Jyqm	2014-01-24 02:46:36
re(3): restrictions - no spoiler att: Hugo	Ady TZIDON	2014-01-23 23:49:14
re(2): restrictions - no spoiler	Hugo	2014-01-23 16:16:09
re(3): A start	Charlie	2014-01-23 09:56:50
re: restrictions - no spoiler	Ady TZIDON	2014-01-23 08:23:34
re(2): A start	Hugo	2014-01-23 06:56:47
re: A start	Charlie	2014-01-22 16:01:15
My conventional tries	Charlie	2014-01-22 16:00:00
My initial suggestions	Jer	2014-01-22 14:11:12
First attempts	Jyqm	2014-01-22 13:59:45
A start	Hugo	2014-01-22 13:50:27

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info