Mathematics for Computer Science

INDEX686

string procedure, 96
Strong Induction, 134
strongly connected, 676
Structural induction, 161
structural induction, 159
subsequence, 275
subset, 68
substitution function, 171
suit, 495
summation notation, 27
Sum Rule, 452 , 534
surjection relation, 82
surjective, 75
switches, 279
symbols, 160
symmetric, 231, 258 , 299, 676

tail, 235
tails, 583
tails of the distribution, 583
terminals, 279
terms, 70
test, 391
tests, 391
theorems, 10
The Riemann Hypothesis, 210
topological sort, 250
total, 75
total expectation, 589
total function, 72
totient function, 212
tournament digraph, 260 , 261
transition, 123
transition relation, 123
transitive, 242 , 258 , 530
Traveling Salesman Problem, 263 , 355
tree diagram, 517 , 567
truth tables, 36
Turing, 197, 199, 209
Turing’s code, 199, 203, 208

Twin Prime Conjecture, 185

type-checking, 95, 97

unbiased, 661

unbiased binomial distribution, 582

undirected, 299

undirected edge, 300

uniform, 526, 535 , 579

uniform distribution, 578 , 579

union, 68

Union axiom, 100

Union Bound, 535

unique factorization, 217

Unique Factorization Theorem, 195

universal, 51

unlucky, 610

valid, 43

valid coloring, 320

value of an annuity, 404

variance, 621 , 630, 650

vertex, 235 , 300

vertex connected, 327

vertices, 235 , 300

virtual machines, 95

walk, 264 , 355

walk counting matrix, 240

walk in a digraph, 236

walk in a simple graph, 324

Weak Law of Large Numbers, 633,

654

weakly connected, 264

weakly decreasing, 153, 195, 411

weakly increasing, 410

weak partial order, 259

well founded, 111

Well Ordering, 135

Well Ordering Principle, 25 , 115, 138

while loop, 391