|
|
Ðåçóëüòàò ïîèñêà |
Ïîèñê êíèã, ñîäåðæàùèõ: Fibonacci numbers
Êíèãà | Ñòðàíèöû äëÿ ïîèñêà | Agarwal R.P. — Difference Equations and Inequalities. Theory, Methods and Applications. | 38 | Êîðìåí Ò., Ëåéçåðñîí ×., Ðèâåñò Ð. — Àëãîðèòìû: ïîñòðîåíèå è àíàëèç | 45, 76 | Kedlaya K.S., Poonen B., Vakil R. — The William Lowell Putnam Mathematical Competition 1985–2000: Problems, Solutions, and Commentary | 40, 93, 117, 123, 124, 139, 173, 222, 223, 252 | Koepf W. — Hypergeometric Summation. An algorithmic approach to summation and special function identities. | 57, 118, 212 | Apostol T.M. — Calculus (vol 1) | 46 (Exercise 16), 379 | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 1024, 1101, 1132, 2021, 2169 | Lee J.S., Miller L.E. — CDMA systems engineering handbook | 410—11 | Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 183, 207—209, 299, 300, 456, 461, 472, 476, 481, 488, 489, 522, 526 | Nathanson M.B. — Elementary methods in number theory | 23 | Graham R.L., Knuth D.E., Patashnik O. — Concrete mathematics | 276—287, 288, 307, 317 | Korsch H.J., Jodl H.-J. — Chaos: A Program Collection for the PC | 30, 109 | Cvetkovic D., Doob M., Sachs H. — Spectra of graphs. Theory and application | 249, 250 | Ribenboim P. — My numbers, my friends: popular lectures on number theory | 2, 4, 13—15, 31—34, 42, 348, 360 | Coxeter H.S.M. — Non-Euclidean Geometry | 293 | Bender C., Orszag S. — Advanced Mathematical Methods for Scientists and Engineers | 56p | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 1024, 1101, 1132, 2021, 2169 | Abell M.L., Braselton J.P. — Mathematica by Example | 231, 232 | Maeder R.E. — Computer science with mathematica | 77, 147—156, 167, 3 | Ahlfors L.V. — Complex analysis | 182 | Bach E., Shallit J. — Algorithmic Number Theory (òîì 1) | 37, 68, 95, 122 | Artin M. — Algebra | 154 | Lorentzen L., Waadeland — Continued fractions and applications | 46, 193, 406 | Behnke H., Bachmann F., Fladt K. — Fundamentals of Mathematics, Volume III: Analysis | 352, 383 | Small Ch.G. — Functional Equations and how to Solve Them | 20 | Roman S. — The Umbral Calculus | 149 | Velleman D.J. — How to Prove It: A Structured Approach | 291—293,296, 297 | Simpson S.G. — Mathematical Logic | 57 | Bauer F.L. — Decrypted Secrets: Methods and Maxims of Cryptology | 176 | Allouche J.-P., Shallit J. — Automatic Sequences: Theory, Applications, Generalizations | 65 | Comtet L. — Advanced Combinatorics. The Art of Finite and Infinate Expansions | 45t, 86 | Smith L.A. — Chaos: A Very Short Introduction | 26—27 | Pickover C.A. — Mobius Strip: Dr. August Mobius's Marvelous Band in Mathematics, Games, Literature, Art, Technology, and Cosmology | 85 | Koblitz N. — A course in number theory and cryptography | 16—17, 77—78, 159, 211—212, 223 | Anderson I. — A first course in discrete mathematics | 21, 24, 42 | Sloane N.J.A. — Handbook of Integer Sequences | 64, 103, 217, 240, 256*, 319, 326, 397, 569, 628, 743, 779, 911, 912, 914, 1101, 1208, 1298, 1319, 1359, 1619, 1638, 1653, 1945, 2042, 2051, 2112 | Pickover C.A. — Wonders of Numbers: Adventures in Mathematics, Mind, and Meaning | 173—175, 177, 219, 335—336, 352 | Borwein J., Bailey D., Girgensohn R. — Experimentation in Mathematics: Computational Paths to Discovery | 215 | Finch S.R. — Mathematical constants | 2, 6, 25, 71, 159, 358, 426 | Mumford D., Wright D., Series C. — Indra's Pearls: The Vision of Felix Klein | 316 | Sandor J., Mitrinovic D.S., Crstici B. — Handbook of Number Theory II | 398 | Andrews G.E. — The Theory of Partitions | 63, 137 | Hein J.L. — Discrete Mathematics | 153, 173, 175, 248, 252, 286, 299, 563 | Niven I. — Mathematics of Choice: How to Count Without Counting | 50 | Polya G. — Problems and Theorems in Analysis: Theory of Functions. Zeros. Polynomials. Determinants. Number Theory. Geometry | VII 53 106, VIII 162 138 | Bolc L. — Natural language parsing systems | 302, 304, 308ff | Kingston J.H. (ed.) — An Introduction to Computer Programming with Java | 243 | Murphy J.J. — Technical Analysis of the Financial Markets: A Comprehensive Guide to Trading Methods and Applications | 212—213, 322—323, 334—335 | Turnbull H.W. — An Introduction to the Theory of Canonical Matrices | 75 | Neukrich J. — Algebraic number theory | 53 | Gonnet G.H., Baeza-Yates R. — Handbook of algorithms and data structures | 196 | Coxeter H.S.M. — Introduction to Geometry | 160, 165—172 | Hale J.K., Kocak H. — Dynamics and Bifurcations | 164 | Samet H. — The design and analysis of spatial data structures | 24, 26 | Kress R., Gehring F.W. — Numerical Analysis | 256 | Apostol T.M. — Calculus: One-Variable Calculus with an Introduction to Linear Algebra, Vol. 1 | 46, 379; (Exercise 16) | Borwein J.M., Borwein P.B. — Pi and the AGM: A Study in Analytic Number Theory and Computational Complexity | 94, 151, 287, 375 | Hilborn R.C. — Chaos and nonlinear dynamics | 235 | Bergeron F., Labelle G., Leroux P. — Combinatorial Species and Tree-like Structures | 249 | Alagić S., Arbib M.A. — The Design of Well-Structured and Correct Programs | 183 | Pap E. — Complex Analysis Through Examples And Exercises | 145 | Olds C.D. — Continued Fractions | 60, 81-82, 84, 137, 147 | Hein J.L. — Discrete Structures, Logic, and Computability | 149, 169, 171, 243, 247, 282, 295, 557 | Coxeter H.S.M. — Regular Polytopes | 23, 31 | Lawrence C. Paulson — ML for the working programmer | 49—51, 191, 222—223, 329—330 | Knuth D.E. — The art of computer programming (vol. 3 Sorting and Searching) | 93, 268, 287, 418, 426, 518, 623, 687, 746, 750 | Char B.W. — First Leaves: A Tutorial Introduction to Maple V | ix, 131 | Tucker À. — Applied Combinatorics | 276, 281, 308, 315 | Hans-Jürgen Stöckmann — Quantum Chaos: An Introduction | 179—181 | Lichtenberg A.J., Liebermen M.A. — Regular and Chaotic Dynamics | 530 | Touretzky D.S. — Common LISP: a gentle introduction to symbolic computation | 244, 246, 262, 281, 355 File i/o 294,295 | Munkres J. — Topology | 56 | Grünbaum B. — Convex Polytopes | 198c | Fenn R. — Geometry | 23 | Aldrovandi R. — Special matrices of mathematical physics (stochastic, circulant and bell matrices) | 164 | Hamming R.W. — Numerical methods for scientists and engineers | 215 | D'Angelo J.P., West D.B. — Mathematical Thinking: Problem-Solving and Proofs | xi, 233, 238, 41, 248, 9, 251, 2, 291 | Conway J.H. — The Book of Numbers | 85, 111-113, 202-203 (see also Phyllotaxis; Plants) | De Finetti B. — Theory of probability (Vol. 2) | 7, 8 | Antia H.M. — Numerical Methods for Scientists and Engineers | 109, 349 | Scott M.L. — Programming Language Pragmatics | 114, 299, 301, 344, 599 | Hein J.L. — Theory of Computation: An Introduction | 70, 97 | Young R.M. — Excursions in Calculus: An Interplay of the Continuous and the Discrete | 35, 71, 123—135, 138, 154 | Kreyszig E. — Advanced engineering mathematics | 683 | Steeb W.- H. — Problems and Solutions in Introductory and Advanced Matrix Calculus | 30 | Charalambides C.A. — Enumerative Combinatorics | 74, 100, 101, 253, 269, 401 | Steeb W.-H. — Problems and Solutions in theoretical and mathematical physics. Volume 1. Introductory level | 113 | Lemmermeyer F. — Reciprocity Laws: From Euler to Eisenstein | 70, 73, 168 | Cusick T.W. — Stream Ciphers and Number Theory | 3 | Andrews G.E. — Number Theory | 6—7, 35, 44 | Drmota M., Tichy R.F. — Sequences, Discrepancies and Applications | 293 | De Finetti B. — Theory of Probability. A critical introductory treatment(vol. 2) | 7, 8 | de Souza P.N., Silva J.-N. — Berkeley Problems in Mathematics | 12, 136, 519 | Browder A. — Mathematical Analysis: An Introduction | 54 | Bellman R.E., Dreyfus S.E. — Applied Dynamic Programming | 154 | Blom G., Holst L., Sandell D. — Problems and Snapshots from the World of Probability | 48, 222 | Tucker A. — Applied Combinatorics | 276, 281, 308, 315 | Jordan C. — Calculus of Finite Differences | 548 | Aigner M. — Graph theory | 98, 102 | N. Vilenkin, George Yankovsky (translator) — Combinatorial mathematics for recreation | 89, 91, 101 | Liu C.L. — Introduction to combinatorial mathematics | 59, 61 | B.M. Stewart — Theory of Numbers | 191 | Coxeter H. — Regular polytopes | 23, 31 | Franklin G.F., Workman M.L., Powell J.D. — Digital Control of Dynamic Systems | 75 | Hamming R.W. — Art of Probability for Scientists and Engineers | 164 | Hamming R.W. — Numerical Methods For Scientists And Engineers | 62 | Thompson S. — Haskell: the craft of functional programming | 29, 37, 386, 444 | Niederreiter H. — Random number generation and quasi-Monte Carlo methods | 122 | Cofman J. — Numbers and shapes revisited: More problems for young mathematicians | 3, 25 | Koepf W. — Hypergeometric summation. An algorithmic approach to summation and special function identities | 57, 118, 212 | Wilf H.S., Zeilbercer D., Petkovšek M. — A=B | 166, 172, 174, 176 | Gries D. — A Logical Approach to Discrete Math | 224 | Mott J.L., Kandel A., Baker T.P. — Discrete Mathematics For Computer Scientists And Mathematicians | 111, 113—114, 116 | Mott J., Kandel A., Baker T. — Discrete mathematics for computer scientists and mathematicians | 111, 113—114, 116 | Cloud M.J., Drachman B.C. — Inequalities: with applications to engineering | 15 | Greene D.H., Knuth D.E. — Mathematics for the analysis of algorithms | 34 | Greene D.H., Knuth D.E. — Mathematics for the analysis of algorithms | 30, 113—114 | Behnke H., Bachmann F., Fladt K. — Fundamentals of mathematics. Volume III. Analysis | 352, 383 | Daepp U., Gorkin P. — Reading, writing and proving. Close look at mathematics | 230, 248 | Davis M., Sigal R., Weyuker E. — Computability, complexity, and languages: Fundamentals of theoretical computer science | 62, 529 | Niven I., Zuckerman H.S. — An Introduction to the Theory of Numbers | 92 | Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 193, 215—217, 219, 246, 442, 447, 457, 458, 463, 468, 470, 477, 506, 628 | Gullberg J. — Mathematics: from the birth of numbers | 287 | Cofman J. — What to Solve? Problems and Suggestions for Young Mathematicians | 15, 38, 48, 210, 236 | Lancaster P. — Mathematics: Models of the Real World | 101 | Benjamin A.T., Quinn J. — Proofs That Really Count The Art of Combinatorial Proof | 1 | Klee V., Wagon S. — Old and New Unsolved Problems in Plane Geometry and Number Theory (Dolciani Mathematical Expositions Series #11) | 230—231, 233, 245 | Sachkov V.N. — Combinatorial methods in discrete mathematics | 77 | Anthony M. — Discrete Mathematics Of Neural Networks | 45 | Eves H.W. — Mathematical circles revisited | 16 | Ivanov O.A. — Easy as Pi?: An Introduction to Higher Mathematics | 21, 105 | Hammerlin G., Hoffmann K.-H., Schumaker L.L. — Numerical Mathematics | 342 | Brainerd W.S., Goldberg C.H., Gross J.L. — Pascal Programming : A Spiral Approach | 337—338 | Davis P.J. — Mathematics of Matrices | 290 | Horowitz E., Rajasekaran S., Sahui S. — Computer Algorithms | 26, 429 | Cohn P.M. — Free Rings and Their Relations (London Mathematical Society Monographs) | 117 | Gill A. — Applied Algebra for the Computer Sciences | 78 | McEliece R.J. — Finite Fields for Computer Scientists and Engineers | 7, 11, 123—125, 131, 138, 141, 142, 149 | Shen A. — Algorithms and Programming | 3, 116, 165 | Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 193, 215—217, 219, 246, 442, 447, 457, 458, 463, 468, 470, 477, 506, 628 | D'Angelo J.P., West D.B. — Mathematical thinking: problem-solving and proofs | xi, 233, 238—244, 248—249, 251—252, 291 | Badii R., Politi A. — Complexity: Hierarchical structures and scaling in physics | 46 | Keith Devlin — Mathematics: The New Golden Age | 145 | Nievergelt J., Farrar J.C., Reingold E.M. — Computer approaches to mathematical problems | 86, 187, 206, 219 | Alexanderson G. — The harmony of the world: 75 years of Mathematics Magazine MPop | 99—100 | Vretblad A. — Fourier Analysis and Its Applications (Graduate Texts in Mathematics) | 64 | Eves H. — Mathematical Circles Revisited: A Second Collection of Mathematical Stories and Anecdotes | 16 | A. Slomson — An Introduction to Combinatorics | 85 | R. A. Dunlap — The Golden Ratio and Fibonacci Numbers | 5, 35ff | Souza P., Silva J., Souza P. — Berkeley Problems in Mathematics | 11, 119, 392 | Souza P., Silva J., Souza P. — Berkeley Problems in Mathematics | 11, 119, 392 |
|
|