Re: TI-M: Discrete Math

To: ti-math@lists.ticalc.org
Subject: Re: TI-M: Discrete Math
From: Jimmy =?iso-8859-1?Q?M=E5rdell?= <yarin@acc.umu.se>
Date: Mon, 15 May 2000 21:09:30 +0200
In-Reply-To: <Pine.LNX.4.02.10005151451040.29718-100000@ticalc.ticalc.or g>
Reply-To: ti-math@lists.ticalc.org


At 14:52 2000-05-15 +0200, you wrote:
 >Discrete math, as the name implies, is the study of discrete (particular
 >or specific) problems that can be solved through mathematics.  It focuses
 >on practical applications and tailors the mathematics to them opposed to
 >the standard approach in mathematics to generalize everything and focus on
 >the theoretical...

Never seen that definition before... The book we had (Biggs, "Discrete 
Mathematics")
defines it as "Discrete mathematics deals with calculations involving a 
finite number
of steps rather than limiting processes". Topics in the books include 
integers (ordering,
induction, etc), functions & counting "the pigionhole principle", 
principles of counting ,
subsets, partition, permutations, modular arithmetic, plus my personal 
favourite
topic: Graphs and algorithms.
--
Jimmy Mårdell                 "How should I know if it works? That's
mailto:yarin@acc.umu.se        what beta testers are for. I only coded it."
http://www.acc.umu.se/~yarin/    - Linus Torvalds

References:

From:

Prev: TI-M: Discrete Math
Next: TI-M: Diminsions
Index(es):
- Main
- Thread