My Math Forum  

Go Back   My Math Forum > High School Math Forum > Algebra

Algebra Pre-Algebra and Basic Algebra Math Forum

LinkBack Thread Tools Display Modes
September 4th, 2008, 09:28 AM   #1
Joined: Sep 2008

Posts: 3
Thanks: 0

abstract alg

Please help me figure out how to get started with this problem..

For every positive integer n, prove that a set with exactly n elements has exactly 2^n subsets (counting the empty set and entire set).
rachelsarah88 is offline  
September 4th, 2008, 10:24 AM   #2
Senior Member
Joined: May 2008
From: York, UK

Posts: 1,300
Thanks: 0

Re: abstract alg

Try induction. The case for n=1 is simple; for n>1, let the set S have n elements and subsets, and let then for each subset both and are subsets of the set which contains n+1 elements. Moreover, these subsets are all the possible subsets of (you will need to show this); since there are two for each , and there are possible subsets , there must be possible subsets of the set
mattpi is offline  

  My Math Forum > High School Math Forum > Algebra

abstract, alg

Search tags for this page
Click on a term to search for related topics.
Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
Abstract Inequalities bilano99 Algebra 3 October 18th, 2012 07:48 AM
Abstract Algebra Need Help ustus Abstract Algebra 4 October 14th, 2012 12:00 PM
Abstract Algebra Help MastersMath12 Abstract Algebra 1 September 24th, 2012 11:07 PM
Abstract Integration rotciv Real Analysis 2 October 29th, 2011 03:17 AM
Very abstract question OriaG Calculus 1 December 31st, 1969 04:00 PM

Copyright © 2019 My Math Forum. All rights reserved.