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: ( You must be logged in to post comments.)
  Subject Author Date
SolutionaMath Man2014-05-12 17:46:00
re: Kool setsSilverKnight2004-12-21 21:43:32
Kool setsharold reiter2004-12-21 18:07:45
re: Part 3 Done (I think)Richard2004-11-15 21:10:41
Part 3 Done (I think)owl2004-11-15 20:13:35
Part 3 (partial Solution)Steve Herman2004-11-15 17:41:24
Hints/TipsThird partDavid Shin2004-11-15 17:36:28
re: Second partSteveH2004-11-15 14:38:21
Some ThoughtsSecond partJer2004-11-15 14:28:22
Some ThoughtsFirst partFederico Kereki2004-11-15 13:48:02
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information