perplexus.info :: Numbers : Round Results

Round Results (Posted on 2013-08-05)

In how many ways can you select a set of six distinct integers, each having absolute value below 51 to yield a product which is an integer power of 10?

No Solution Yet Submitted by Ady TZIDON

No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)

Biggest and smallest

| Comment 3 of 4 |

A product of 100 is not possible with 6 distinct integers. But 1000 is achievable in many different ways. See previous post for 1 way.

The largest I have come up with is 1,000,000,000. One way to get to a billion is (-50, -25, 20, 25, 32, 50)

Posted by Steve Herman on 2013-08-05 19:50:18

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 (16)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info