6. Discover the recursive formula for Hn. Find Hn for n=1,2,3...6. Based on these values you will be able tosee the recursive pattern. proving the formula is optional for extra credit. Consider all subsets of N={1, 2, 3,..., n). How many of these subsets, SCN, satisfy the property that (i) Vx (x ES → x + 1 ¢ S) ? Denote the number of subsets satisfying this property (i) by Hn. (a) Find the first 6 values of Hn . I have calculated n=1 and n=2, so you need to do n=3, 4, 5, 6 (b) Find and prove the recursive formula for the sequence Hn . Example: Let n=1. Then N={1} and the subsets satisfying property (i) are {1} and Ø so H1=2. Let n=2. Then N={1,2} and the subsets satisfying property (i) are {1}, {2}, and Ø, i.e. H3=3. Note: {1,2} is also subset of {1,2} but since for x=1, x+1=2 and both 1 and 2 are contained in {1,2} therefore the set {1,2} fails to satisfy property (i).

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
6. Discover the recursive formula for Hn. Find Hn for n=1,2,3...6. Based on these values you will be able tosee
the recursive pattern. proving the formula is optional for extra credit.
Consider all subsets of N={1, 2, 3,..., n).
How many of these subsets, SC N, satisfy the property that
(i)
Vx (x ES → x +1 ¢ S) ?
Denote the number of subsets satisfying this property (i) by Hn.
(a) Find the first 6 values of Hn . I have calculated n=1 and n=2, so you need to do n=3, 4, 5, 6
(b) Find and prove the recursive formula for the sequence Hn .
Example: Let n=1. Then N={1} and the subsets satisfying property (i) are {1} and O so H1=2.
Let n=2. Then N={1,2} and the subsets satisfying property (i) are {1}, {2}, and Ø, i.e. H3=3.
Note: {1,2} is also subset of {1,2} but since for x=1, x+1=2 and both 1 and 2 are contained in
{1,2} therefore the set {1,2} fails to satisfy property (i).
7. Prove by induction that the number of subsets for a set with n elements is 2^n.
Transcribed Image Text:6. Discover the recursive formula for Hn. Find Hn for n=1,2,3...6. Based on these values you will be able tosee the recursive pattern. proving the formula is optional for extra credit. Consider all subsets of N={1, 2, 3,..., n). How many of these subsets, SC N, satisfy the property that (i) Vx (x ES → x +1 ¢ S) ? Denote the number of subsets satisfying this property (i) by Hn. (a) Find the first 6 values of Hn . I have calculated n=1 and n=2, so you need to do n=3, 4, 5, 6 (b) Find and prove the recursive formula for the sequence Hn . Example: Let n=1. Then N={1} and the subsets satisfying property (i) are {1} and O so H1=2. Let n=2. Then N={1,2} and the subsets satisfying property (i) are {1}, {2}, and Ø, i.e. H3=3. Note: {1,2} is also subset of {1,2} but since for x=1, x+1=2 and both 1 and 2 are contained in {1,2} therefore the set {1,2} fails to satisfy property (i). 7. Prove by induction that the number of subsets for a set with n elements is 2^n.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,