[A83] simplifying boolean functions (non-programming)

To: assembly-83@lists.ticalc.org
Subject: [A83] simplifying boolean functions (non-programming)
From: "TypeR unknown" <typerfuture@hotmail.com>
Date: Wed, 12 Sep 2001 20:43:39 +0200
Reply-To: assembly-83@lists.ticalc.org


Can somebody help me with my homework, it's about boolean logic and stuff 
and there is this question about simplyfying boolean functions

The function which must be simplified is, for example, like this,
        ___     __
  abc + abcde + ab + d

Easy ?? Wait a second !!!  There is one catch (well 2 actually:))
                           1- You may not use a truthtable
                           2- You may not use a Karnough diagram


Thus you have to use rules like a+a=a and that sort of rules. It's all new 
to me, and I'm having quite a bit of problems with it.
I'd be very very greatfull if somebody can explain this to me simply !!!



_________________________________________________________________
Get your FREE download of MSN Explorer at http://explorer.msn.com/intl.asp

Follow-Ups:

[A83] Re: simplifying boolean functions (non-programming)

From: Peter-Martijn Kuipers <hyper@hysoft-automation.com>