| 000 | 01679nam a2200349 i 4500 | ||
|---|---|---|---|
| 999 |
_c3295 _d3295 |
||
| 001 | 13206907 | ||
| 005 | 20210824092745.0 | ||
| 008 | 030520s2004 caua f 001 0 eng d | ||
| 010 | _a 2003107333 | ||
| 020 | _a0534359450 (acidfree paper) | ||
| 020 | _a0534490964 (international student ed.) | ||
| 035 | _a(DLC) 2003107333 | ||
| 040 |
_aDLC _erda _cDLC _dDLC _beng |
||
| 082 | 0 | 0 |
_a511 _222 _bE.S.D. |
| 100 | 1 |
_aEpp, Susanna S. _913176 _eauthor |
|
| 245 | 1 | 0 |
_aDiscrete mathematics with applications / _cSusanna S. Epp. |
| 250 | _athird edition | ||
| 264 | 1 |
_aBelmont, CA : _bThomson-Brooks/Cole, _c[2004] |
|
| 264 | 4 | _cc2004 | |
| 300 |
_axix, 775, 116, 11 pages : _billustrations (some color) ; _c27 cm. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_aunmediated _bn _2rdamedia |
||
| 338 |
_avolume _bnc _2rdacarrier |
||
| 500 | _aIncludes index. | ||
| 505 | 0 | _aLogic of compound statements -- Logic of quantified statements -- Elementary number theory and methods of proof -- Sequences and mathematical induction -- Set theory -- Counting and probability -- Functions -- Recursion -- Efficiency of algorithms -- Relations -- Graphs and trees -- Regular expressions and finite-state automata -- Appendixes: Properties of the real numbers; Solutions and hints to selected exercises. | |
| 650 | 0 |
_aMathematics. _913177 |
|
| 856 |
_3Abstract _uhttp://repository.fue.edu.eg/xmlui/handle/123456789/2652 |
||
| 906 |
_a7 _bcbc _corignew _d3 _eepcn _f20 _gy-gencatlg |
||
| 942 |
_2ddc _cBK |
||