All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Kool Numbers (Posted on 2004-11-15) Difficulty: 4 of 5
A collection of positive integers (not necessarily distinct) is called Kool if the sum of all its elements equals their product.

For example, {2, 2, 2, 1, 1} is a Kool set.
__________________________________

a) Show that there exists a Kool set of n numbers for all n>1

b) Find all Kool sets with sums of 100

c) Find all Kool sets with 100 members.

No Solution Yet Submitted by SilverKnight    
Rating: 3.0000 (5 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Kool sets | Comment 9 of 10 |
(In reply to Kool sets by harold reiter)

As much as I'd like to take credit for it... it's not mine.

I will direct you to:

http://www.stetson.edu/departments/mathcs/events/mathcontest/1995/index.shtml

where I found this problem.
  Posted by SilverKnight on 2004-12-21 21:43:32

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

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information