Mathematics for Computer Science

INDEX 681

Double or nothing, 528
double summations, 428
drawing, 361

edge connected, 327
edge cover, 310
edges, 235 , 300
efficient solution, 49
elements, 67
Elkies, 8
empty graph, 303 , 321
empty relation, 266, 268, 273
empty sequence, 71
empty string, 63
end of chain, 254
endpoints, 300
end vertex, 235
Enigma, 203
environment, 391
equivalence class, 256
equivalence relation, 256
equivalent, 40
erasable, 179
Euclid, 10, 184, 217
Euclid’s Algorithm, 189
Euler, 8, 217
formula, 371
Euler’sfunction, 212
Euler’s constant, 425
Euler’s formula, 379
Euler’s Theorem, 212
Euler’s theorem, 224
Euler tours, 263
evaluation function, 170
event, 519 , 533
events, 573
exclusive-or, 37
existential, 51
expectation, 585
expected return, 591

expected value, 514 , 585 , 586, 617

exponential backoff, 582

exponentially, 45, 49

extendsF, 336

Extensionality, 100

face-down four-card trick, 510

factor, 184

factorial function, 402

factorials, 494

Factoring, 185

fair, 592

fair game, 661

Fast Exponentiation, 132

father, 490

Fermat’s Last Theorem, 185

Fermat’s Little Theorem, 207

Fermat’s theorem, 221

Fifteen Puzzle, 148

Floyd’s Invariant Principle, 122

Foundation, 101

Four-Color Theorem, 9

four-step method, 567

Frege, 102

Frege, Gotlob, 98

function, 71 , 75

Fundamental Theorem of Arithmetic,

195

Godel, 102 ̈

Gale, 318

Gauss, 185, 201

general binomial density function, 584

Generalized Pigeonhole Principle, 481

Generalized Product Rule, 454

geometric distribution, 591 , 591

geometric sum, 401

Goldbach’s Conjecture, 51, 52, 53

Goldbach Conjecture, 185

golden ratio, 191 , 218