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

 Kool Numbers (Posted on 2004-11-15)
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)

 Subject Author Date a Math Man 2014-05-12 17:46:00 re: Kool sets SilverKnight 2004-12-21 21:43:32 Kool sets harold reiter 2004-12-21 18:07:45 re: Part 3 Done (I think) Richard 2004-11-15 21:10:41 Part 3 Done (I think) owl 2004-11-15 20:13:35 Part 3 (partial Solution) Steve Herman 2004-11-15 17:41:24 Third part David Shin 2004-11-15 17:36:28 re: Second part SteveH 2004-11-15 14:38:21 Second part Jer 2004-11-15 14:28:22 First part Federico Kereki 2004-11-15 13:48:02

 Search: Search body:
Forums (1)