|
|
 |
| Результат поиска |
Поиск книг, содержащих: Pigeonhole Principle
| Книга | Страницы для поиска | | Kedlaya K.S., Poonen B., Vakil R. — The William Lowell Putnam Mathematical Competition 1985–2000: Problems, Solutions, and Commentary | 43, 50, 96, 118, 175, 193, 195, 215, 248, 267, 289, 294 | | Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 275—278, 290, 309, 311, 338, 831 | | Graham R.L., Knuth D.E., Patashnik O. — Concrete mathematics | 130 | | Baker A. — Algebra and Number Theory | 53 | | Newman D.J. — Analytic number theory | 50 | | Cameron P.J. — Combinatorics : Topics, Techniques, Algorithms | 147—149, 155, 156, 312 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 1802, 2184 | | Burton D.M. — Elementary Number Theory | 264 | | Merris R. — Combinatorics | 338 | | Velleman D.J. — How to Prove It: A Structured Approach | 313 | | Enderton H.B. — Elements of set theory | 134 | | Everest G., Ward T. — An Introduction to Number Theory | 50, 75 | | Hensley D. — Continued Fractions | 127 | | Connell E.H. — Elements of abstract and linear algebra | 8, 39 | | Lozansky E., Rousseau C. — Winning Solutions | 188—194 | | Andreescu T., Feng Z. — Path to Combinatorics for Undergraduates: Counting Strategies | 124, 214 | | Sipser M. — Introduction to the theory of computation | 78, 79, 124 | | Hein J.L. — Discrete Mathematics | 95, 139 | | Franklin J., Daoud A. — Introduction to Proofs in Mathematics | 85, 159 | | Niven I. — Mathematics of Choice: How to Count Without Counting | 120 | | Hopcroft J.E., Motwani R., Ullman J.D. — Introduction to Automata Theory, Languages, and Computation | 66 | | Knuth D.E. — The art of computer programming (vol. 2 Seminumerical Algorithms) | 286 | | Ross Sh.M. — Topics in Finite and Discrete Mathematics | 61—63, 136 | | Kolman B., Busby R.C., Cutler S.C. — Discrete Mathematical Structures | 83 | | von zur Gathen J., Gerhard J. — Modern computer algebra | 642, 661, 662 | | Krantz S.G. — Techniques of Problem Solving | 28 | | Hein J.L. — Discrete Structures, Logic, and Computability | 93, 137, 631 | | Tucker А. — Applied Combinatorics | 419 | | Herman J., Simsa J., Kucera R. — Equations and Inequalities: Elementary Problems and Theorems in Algebra and Number Theory | 268 | | D'Angelo J.P., West D.B. — Mathematical Thinking: Problem-Solving and Proofs | 189, 93, 198—9, 202, 217, 228, 231, 270, 277 | | Scott M.L. — Programming Language Pragmatics | 93 | | Hein J.L. — Theory of Computation: An Introduction | 315 | | Burger E.B. — Exploring the Number Jungle: A Journey into Diophantine Analysis | 17 | | Charalambides C.A. — Enumerative Combinatorics | 38 | | Alexanderson G.L. (ed.), Klosinski L.F. (ed.), Larson L.C. (ed.) — William Lowell Putnam Mathematical Competition: Problems and Solutions 1965-1984 | 1971, A-1, 1978, A-1, 1980, A—4 | | Bóna M. — Introduction to Enumerative Combinatorics | 35 | | Kaye R. — Models of Peano Arithmetic | 68, 274 | | Petersen K.E. — Ergodic theory | 157 | | Drmota M., Tichy R.F. — Sequences, Discrepancies and Applications | 68, 76 | | de Souza P.N., Silva J.-N. — Berkeley Problems in Mathematics | 457, 480 | | Šimša J., Kucčra R., Herman J. — Counting and Configurations: Problems in Combinatorics, Arithmetic, and Geometry | 2, 5, 107 | | Seymour L. — Schaum's Outline of Theory and Problems of Discrete Math | 139 | | Tucker A. — Applied Combinatorics | 419 | | Hayes D.F. (ed.), Shubin T. (ed.) — Mathematical Adventures for Students and Amateurs | 41, 42, 44, 47, 48 | | van Lint J.H., Wilson R.M. — Course in Combinatorics | 44, 493 | | Gries D. — A Logical Approach to Discrete Math | 355 | | Mott J.L., Kandel A., Baker T.P. — Discrete Mathematics For Computer Scientists And Mathematicians | 67—71 | | Mott J., Kandel A., Baker T. — Discrete mathematics for computer scientists and mathematicians | 67—71 | | Swinnerton-Dyer H.P.F. — A brief guide to algebraic number theory | 16, 120 | | Lipschutz S., Lipson M.L. — Schaum's outline of theory and problems of discrete mathematics | 139 | | Daepp U., Gorkin P. — Reading, writing and proving. Close look at mathematics | 261, 263 | | Herstein I.N. — Topics in algebra | 127 | | Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 273—278, 287, 288, 303—305, 327, 328, 796 | | Klee V., Wagon S. — Old and New Unsolved Problems in Plane Geometry and Number Theory (Dolciani Mathematical Expositions Series #11) | 26 | | Swinnerton-Dyer H. P. F., Swinnerton-Dyer P. — A brief guide to algebraic number threory | 16, 120 | | Sipser M. — Introduction to the Theory of Computation | 78, 79, 115 | | Gill A. — Applied Algebra for the Computer Sciences | 65 | | Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structures | 82 | | Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 273—278, 287, 288, 303—305, 327, 328, 796 | | D'Angelo J.P., West D.B. — Mathematical thinking: problem-solving and proofs | 189—193, 198—199, 202, 217, 228, 231, 270, 277 | | Neusel M.D. — Invariant Theory of Finite Groups | 207 | | Souza P., Silva J., Souza P. — Berkeley Problems in Mathematics | 351, 365 | | Souza P., Silva J., Souza P. — Berkeley Problems in Mathematics | 351, 365 |
|
|
|
|
О проекте