|
|
 |
| Результат поиска |
Поиск книг, содержащих: Fermat’s theorem
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 756 | | Engel A. — Problem-Solving Strategies | 119—120, 128, 149 | | Sylvester J.J. — The Collected Mathematical Papers, Volume II | ii 229, 232, 234, 241, 263, iv 591 | | Anderson I. — A first course in discrete mathematics | 180 | | Nasar S. — A Beautiful Mind | 35 | | Dickson L.E. — History of the Theory of Numbers, Volume I: Divisibility and Primality | 12, 17, 18, 59—89, 179 | | Tignol J.-P. — Galois' Theory of Algebraic Equations | 171, 174, 206 | | Reid L.W. — The Elements of the Theory of Algebraic Numbers | 57 | | Penrose R., Isham C. J. — Quantum Concepts in Space and Time | 57 | | Herman J., Simsa J., Kucera R. — Equations and Inequalities: Elementary Problems and Theorems in Algebra and Number Theory | 197 | | Dickson L.E. — History of the Theory of Numbers, Volume ll: Diophantine Analysis | 55, 171, 238, 251, 281 | | Kozen D.C. — The Design And Analysis Of Algorithms | 202, 204, 226 | | Alexanderson G.L. (ed.), Klosinski L.F. (ed.), Larson L.C. (ed.) — William Lowell Putnam Mathematical Competition: Problems and Solutions 1965-1984 | 1983, A—3 | | Beaumont R.A., Pierce R.S. — The Algebraic Foundations of Mathematics | 191 | | Moritz R.E. — On Mathematics and Mathematicians | 2129 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 706 | | Stinson D.R. — Cryptography: Theory and practice | 171 | | Moskowitz M.A. — Adventures in mathematics | 58 | | Moh T.T. — Algebra | 30 | | Audichya A. — Mathematics: Marvels and milestones | 64 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 706 | | Ore O. — Invitation to Number Theory | 94, 95 | | LeVeque W.J. — Elementary theory of numbers | 64 | | Childs L. — A concrete introduction to higher algebra | 90, 116, 121, 177, 207 |
|
|
|
|
О проекте