Question: 1. If A is a set containing n elements, how many different subsets of A can be formed? Find a formula which counts the number

1. If A is a set containing n elements, how many different subsets of A can be formed? Find a formula which counts the number of subsets of A in terms of n. Keep in mind that the empty set is counted as a subset of A. Prove that your formula is correct.

2. Show that an ordered field F is Archimedean if and only if for all x, y F with x > 0 there is an n N so that nx > y.

Step by Step Solution

3.33 Rating (150 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

1 To find the number of different subsets of a set A containing n elements we can consider the follo... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!