Set Theory

05052019, 03:12 PM
(This post was last modified: 05062019 03:25 PM by Jonathan Busby.)
Post: #6




RE: Set Theory
The method I have used when manipulating sets on my HP48GX is based off of the fact that the power set of a set of size N is 2^N . One might be tempted to construct the power set by iterating through all 2^N values, bitwise, but that is very inefficient. A better method is to use a gray code counter so that to build a power set, only one element has to be altered at a time.
Regards, Jonathan EDIT : If you really want to be pedantic then the number of subsets is 2^N  1, but technically, since every set includes the empty set { } then it's 2^N Aeternitas modo est. Longa non est, paene nil. 

« Next Oldest  Next Newest »

Messages In This Thread 
Set Theory  Leviset  05032019, 04:12 PM
RE: Set Theory  John Keith  05032019, 07:00 PM
RE: Set Theory  Thomas Okken  05032019, 09:27 PM
RE: Set Theory  KarlLudwig Butte  05042019, 12:56 PM
RE: Set Theory  Leviset  05042019, 11:49 PM
RE: Set Theory  Jonathan Busby  05052019 03:12 PM

User(s) browsing this thread: 1 Guest(s)