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

 Easy count (Posted on 2014-07-29)
Let S be a set of some positive integers.
We'll call S autonomous if the number of elements in S is itself an element of S. e.g. the set {2,3,5} is autonomous, as is the set {2,7}, but the sets {1, 4} or {2,4,5} are not.

Determine a general formula for the number
of autonomous subsets of {1, 2, 3, ... , n}.

 Submitted by Ady TZIDON No Rating Solution: (Hide) The subset of k numbers must consist of the number k itself + any subset of n-1 members other than k, i.e. one of C(n-1, k-1) possible combinations. Summing for all possible values of k (1 to n-1): Sum=C(n-1,0)+ C(n-1,1)+ C(n-1,2)+... C(n-1, n-1) =2^(n-1).

 Subject Author Date re(2): Solution Ady TZIDON 2014-07-30 17:00:49 re: Solution Charlie 2014-07-30 09:57:26 Solution tomarken 2014-07-30 08:48:04 re: computer assisted solution Ady TZIDON 2014-07-29 23:53:21 computer assisted solution Charlie 2014-07-29 14:38:40

 Search: Search body:
Forums (0)