Question

In: Statistics and Probability

Let S(n) be the number of subsets of {1,2,...,n} having the following property: there are no...

Let S(n) be the number of subsets of {1,2,...,n} having the following property: there are no three elements in the subset that are consecutive integers. Find a recurrence for S(n) and explain in words why S(n) satisfies this recurrence

Solutions

Expert Solution

Sn is the number of subsets of {1,2,...,n} with the property that there are no three elements that are consecutive integers.

Then there are two types of subsets of Sn:

CASE 1: Sn contain n, then there are 2 cases for this:

A) : The subset contains n but not n-1. In this, the subset is subset of {1,2,...,n-2} having the property that no three elenent in the subset are consecutive integers including n.

Hence, number of sets in this case is Sn-2.

B) The subset contain n and n-1. Then in this case subset will nkt contain n-2 as it cannot contain 3 consecutive integers.

Then subset can be subset of {1,2,...,n-3} having property that no three elements are consecutive integers together with n and n-2.Therefore the number of subsets that fall into this category are Sn-3

CASE 2: thesubsetdoes not contain n. Then subset can be subset of {1,2,...,n-1} having property that no 3 elements are consecutive integers. Therefore tge number of subsets in this case is Sn-1.

Then the reccurence is,

Sn=Sn-1+Sn-2+Sn-3

We can check this recurrence as follows:

For n=0,we have one subset, a null set. S0=1

For n=1,we have {1} and null subset S1=2

For n=2,we have 3 subset, null subset+2C1+2C2=4i.e.,S2=4

For n=3,S3=null+3C1+3C2=7 as it cannot contain 3C3 by the given property.

For n=4,S4=null+4C1+4C2+4C3-2 as {1,2,3} and {2,3,4} cannot be subset with the given property. So, S4=13

So by reccurence relation,

S4=S3+S2+S1=>13=7+4+2

S3=S2+S1+S0=>7=4+2+1

So, it is clear that Sn satisfies this reccurence.


Related Solutions

Let S = {1,2,3,...,10}. a. Find the number of subsets of S that contain the number...
Let S = {1,2,3,...,10}. a. Find the number of subsets of S that contain the number 5. b. Find the number of subsets of S that contain neither 5 nor 6. c. Find the number of subsets of S that contain both 5 and 6. d. Find the number of subsets of S that contain no odd numbers. e. Find the number of subsets of S that contain exactly three elements. f. Find the number of subsets of S that...
Let S be a set of n numbers. Let X be the set of all subsets...
Let S be a set of n numbers. Let X be the set of all subsets of S of size k, and let Y be the set of all ordered k-tuples (s1, s2,   , sk) such that s1 < s2 <    < sk. That is, X = {{s1, s2,   , sk} | si  S and all si's are distinct}, and Y = {(s1, s2,   , sk) | si  S and s1 < s2 <    < sk}. (a) Define a one-to-one correspondence f : X → Y. Explain...
Let {Kn : n ∈ N} be a collection of nonempty compact subsets of R N...
Let {Kn : n ∈ N} be a collection of nonempty compact subsets of R N such that for all n, Kn+1 ⊂ Kn. Show that K = T∞ n=1 Kn is compact. Can K ever be the empty set?
A)Let S = {1,2,3,...,18,19,20} be the universal set. Let sets A and B be subsets of...
A)Let S = {1,2,3,...,18,19,20} be the universal set. Let sets A and B be subsets of S, where: Set A={3,4,9,10,11,13,18}A={3,4,9,10,11,13,18} Set B={1,2,4,6,7,10,11,12,15,16,18}B={1,2,4,6,7,10,11,12,15,16,18} LIST the elements in Set A and Set B: {  } LIST the elements in Set A or Set B: {  } B)A ball is drawn randomly from a jar that contains 4 red balls, 5 white balls, and 9 yellow balls. Find the probability of the given event. Write your answers as reduced fractions or whole numbers. (a) PP(A...
Let Q:= {1,2,...,q}. Let G be a graph with the elements of Q^n as vertices and...
Let Q:= {1,2,...,q}. Let G be a graph with the elements of Q^n as vertices and an edge between (a1,a2,...,an) and (b1,b2,...bn) if and only if ai is not equal to bi for exactly one value of i. Show that G is Hamiltonian.
By constructing a suitable bijection, show that the number of subsets of an n-set of odd...
By constructing a suitable bijection, show that the number of subsets of an n-set of odd size is equal to the number of subsets of an n-set of even size.
Let N(n) be the number of all partitions of [n] with no singleton blocks. And let...
Let N(n) be the number of all partitions of [n] with no singleton blocks. And let A(n) be the number of all partitions of [n] with at least one singleton block. Prove that for all n ≥ 1, N(n+1) = A(n). Hint: try to give (even an informal) bijective argument.
Let S be the set of all integers x ∈ {1,2,...,100} such that the decimal representation...
Let S be the set of all integers x ∈ {1,2,...,100} such that the decimal representation of x does not contain the digit 4. (The decimal representation does not have leading zeros.) • Determine the size of the set S without using the Complement Rule. • Use the Complement Rule to determine the size of the set S. (You do not get marks if you write out all numbers from 1 to 100 and mark those that belong to the...
Let R be a ring and n ∈ N. Let S = Mn(R) be the ring...
Let R be a ring and n ∈ N. Let S = Mn(R) be the ring of n × n matrices with entries in R. a) i) Let T be the subset of S consisting of the n × n diagonal matrices with entries in R (so that T consists of the matrices in S whose entries off the leading diagonal are zero). Show that T is a subring of S. We denote the ring T by Dn(R). ii). Show...
Let N be the number of requests to a web server per day and let N...
Let N be the number of requests to a web server per day and let N Poisson(). Each request comes from a human with probability p or from a spam bot with probability 1 ? p. Assume that the requests are independent of each other. Let X be the number of requests from humans per day and Y be the number of requests from spam bots per day. (a) State the conditional distribution of X given N = n, and...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT