×

# Show that there is no one-to-one correspondence from the ## Problem 35E Chapter 2.5

Discrete Mathematics and Its Applications | 7th Edition

• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants Discrete Mathematics and Its Applications | 7th Edition

4 5 0 366 Reviews
21
1
Problem 35E

Show that there is no one-to-one correspondence from the set of positive integers to the power set of the set of positive integers. [Hint: Assume that there is such a one- to-one correspondence. Represent a subset of the set of positive integers as an infinite bit string with ith bit 1 if i belongs to the subset and 0 otherwise. Suppose that you can list these infinite strings in a sequence indexed by the positive integers. Construct a new bit string with its ith bit equal to the complement of the ith bit of the ith string in the list. Show that this new bit string cannot appear in the list.]

Step-by-Step Solution:

Step 1</p>

In this question we have to show that there is no one to one correspondence from the set of

positive integers to the power set of the set of positive integers.

Step 2 of 2

##### ISBN: 9780073383095

Unlock Textbook Solution

Show that there is no one-to-one correspondence from the

×
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 2.5 - Problem 35e

Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 2.5 - Problem 35e