home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math.symbolic
- Path: sparky!uunet!darwin.sura.net!wupost!eclnews!cec1!ppc1
- From: ppc1@cec1.wustl.edu (Peter Pui Tak Chiu)
- Subject: simplification
- Message-ID: <1992Jul25.115733.27293@wuecl.wustl.edu>
- Sender: usenet@wuecl.wustl.edu (Usenet Administrator)
- Nntp-Posting-Host: cec1
- Organization: Washington University, St. Louis Mo.
- Date: Sat, 25 Jul 1992 11:57:33 GMT
- Lines: 24
-
-
- hi everyone,
-
- i have a real naive question:
-
- how to do symbolic simplification using scheme, lisp or anything...?
-
- what i mean is symbolic simplification like MATHEMATICA.
-
- here are some examples:
-
- (* a (+ b (/ c a))) ==> (+ (* a b) c)
- (+ (* a b) (* a c)) ==> (* a (+ b c))
-
- these are just very simple cases and are intended to explain what i mean...
- i want to know a way to find the "simplest form" of any algebric expression.
- not only those which are as simple as the above.
-
- can anyone tell me how to do it or refer me to some books that talk about it?
-
- thanks in advance
-
- peter
-
-