Авторизация
Поиск по указателям
Scheinerman E.A. — Mathematics: A Discrete Introduction
Обсудите книгу на научном форуме
Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: Mathematics: A Discrete Introduction
Автор: Scheinerman E.A.
Аннотация: This book has two primary objectives: It teaches students fundamental concepts in discrete mathematics (from counting to basic cryptography to graph theory), and it teaches students proof-writing skills. With a wealth of learning aids and a clear presentation, the book teaches students not only how to write proofs, but how to think clearly and present cases logically beyond this course. Overall, this book is an introduction to mathematics. In particular, it is an introduction to discrete mathematics. All of the material is directly applicable to computer science and engineering, but it is presented from a mathematician's perspective. While algorithms and analysis appear throughout, the emphasis is on mathematics. Students will learn that discrete mathematics is very useful, especially those whose interests lie in computer science and engineering, as well as those who plan to study probability, statistics, operations research, and other areas of applied mathematics.
Язык:
Рубрика: Математика /
Статус предметного указателя: Указатель в процессе заполнения
ed2k: ed2k stats
Издание: 2-nd edition
Год издания: 2005
Количество страниц: 592
Добавлена в каталог: 23.08.2014
Операции: Положить на полку |
Скопировать ссылку для форума | Скопировать ID
Предметный указатель
Graph, Platonic 445
Graph, regular 396 550
Graph, self-complementary 405
Graph, simple 394
Graph, size 396 550
Greater than 553
Greatest common divisor 299 480 547
Greatest common divisor, polynomial 309
Greatest lower bound 478
Group 547
Group, abelian 341 353 544
Group, additive 341
Group, alternating 342
Group, cyclic 350 545
Group, dihedral 342
Group, isomorphic 349 548
Group, symmetric 217 342 551
Guinea pig 15
Hamiltonian cycle 421 547
Hamiltonian graph 547
Hamiltonian path 412 547
Hanoi, Tower of 169
Hasse diagram 450 547
Hat-check problem 129
Height 453 547
Hypercube 547
Hypothesis 10 547
Hypothesis, induction 158 547
Hypothesis, strong induction 163
Identity element 31 234 311 339 341 547 552
Identity function 214 547
Identity permutation 217 547
If and only if 11
If-then 9
If-then, alternative wordings 11
IFF 12 547
Image 195 547
Implies 11
incident 393 547
Inclusion-exclusion 67 76 124 547
Incomparable 453 547
Independence number 402 547
Independent events 260 547
Independent random variables 269
Independent set 402 547
Indicator random variable 278 288 547
Indirect proof 137 547 550
Induced subgraph 401 547
Induction 155—171 547
Induction, hypothesis 158 547
Induction, hypothesis, strong 163
Induction, loading 171 424 496
Induction, machine 155—157
Induction, strong 163 551
Inductive step 158 163
Inequality, Chebyshev's 289
Inequality, Markov's 288
Inequality, triangle 238
Infinite 50
Injection 199 547
Integer linear combination 304
Integers xvii 3 547 552
Interesting 154
Intersection 64 547
Interval order 483
Inverse 234 314 339 341 547 552
Inverse function 198
Inverse permutation 220 548
Inverse relation 85 547 548
Inverse statement 548
inversion 223 548
Invertible 313 548
Irrational 329 548
Irreducible 334
Irreflexive 86 394 408 548
Isolated vertex 422 548
Isometry 235 548
Isomorphic 349 459 548
Isomorphic graphs 398
Isomorphic group 349
Isomorphic poset 459
Jeopardy 67
Join 479 548
Joined 393
Jordan curve theorem 436
k-colorable 428 545
Klein 4-group 343 347 349 359
Koenigsburg 391 421
Kuratowski's theorem 441 548
L-shaped triomino 162
Lagrange's theorem 356 548
Lattice 480 548
Lattice point 206
Leaf 416 548
Least common multiple 332 480
Least upper bound 478
Lem 548
Lemma 14 23 548
Length, list 37
Length, walk 406
Less than 553
Likewise 18 23
Linear combination, integer 304
Linear extension 462 548
Linear order 458 462 548
Linearity of expectation 278 548
LIST 37 548
List, empty 37 46
List, length 37
Logical equivalence 30 548
Loop 394
Lower bound 478
Lower bound, greatest 478
Lub 478 548
Machine, function 193 211
Machine, induction 155—157
Main diagonal 347
MAP 194 196 548
Map coloring 389
Markov's inequality 288
Mathematical induction 155—171
Mathematical induction, strong 163
Mathspeak 10
MAX 480
Maximal 402 456 548
Maximum 402 455 548
Mean 272 548
Meet 479 548
midpoint 206
MIN 480
Minimal 456 548
Minimum 455 548
Mistake 8
MOD 90 296 310 548 549
Modular addition 310
Modular arithmetic 309 549
Modular division 315
Modular multiplication 310
Modular reciprocal 313
Modular subtraction 312
MODULO 90 356
Monotone sequence 207
Monty Hall problem 262
Mouse and cheese 412
Multi-graph 394
Multichoose 118 549
Multigraph 394
Multinomial coefficient 115
Multiplication, modular 310
Multiplication, principle 39 549
Multiplicity 117 549
Multiset 117 549
Multiset, cardinality 117
Mutually exclusive 253
NAND 34 549
Natural number 6 549 552
Necessary 11 12 549
Negative 553
Neighbor 394 549
Neighborhood 395
Nonconstructive 306
Nonnegalive 553
Nonplanar 440
Nonsense 8 15
Nontransitive dice 255
Nontrivial component 422
Normal subgroup 361
NOT 13 29 549
NP-complete 434
o 237
Sub-group 353
Реклама