Discrete math workbook, Kurgalin, Sergei Borzunov, Sergei
Автор: David Gries; Fred B. Schneider Название: A Logical Approach to Discrete Math ISBN: 1441928359 ISBN-13(EAN): 9781441928351 Издательство: Springer Рейтинг: Цена: 50770.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This text attempts to change the way we teach logic to beginning students. Instead of teaching logic as a subject in isolation, we regard it as a basic tool and show how to use it. We strive to give students a skill in the propo- sitional and predicate calculi and then to exercise that skill thoroughly in applications that arise in computer science and discrete mathematics. We are not logicians, but programming methodologists, and this text reflects that perspective. We are among the first generation of scientists who are more interested in using logic than in studying it. With this text, we hope to empower further generations of computer scientists and math- ematicians to become serious users of logic. Logic is the glue Logic is the glue that binds together methods of reasoning, in all domains. The traditional proof methods -for example, proof by assumption, con- tradiction, mutual implication, and induction- have their basis in formal logic. Thus, whether proofs are to be presented formally or informally, a study of logic can provide understanding.
Автор: Tsutomu Sasao; Masahira Fujita Название: Representations of Discrete Functions ISBN: 1461285992 ISBN-13(EAN): 9781461285991 Издательство: Springer Рейтинг: Цена: 111790.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Mezo, Istvan Название: The lambert w function ISBN: 0367766833 ISBN-13(EAN): 9780367766832 Издательство: Taylor&Francis Рейтинг: Цена: 102070.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book is the very first one in the English language dedicated to the Lambert W function, its generalizations, and its applications. One goal is to promote future research on the topic. The book contains all the information one needs when trying to find a result. The most important formulas and results are framed
Автор: Bona, Miklos (university Of Florida, Gainesville, Usa) Название: Combinatorics of permutations ISBN: 0367222582 ISBN-13(EAN): 9780367222581 Издательство: Taylor&Francis Рейтинг: Цена: 102070.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The new edition of this award-winning, graduate textbook is upated throughout. Including mostly enumerative combinatorics,yet there are algebraic, analytic, and topological parts as well, and many applications. The author continues to reveal the usefulness of the subject for both students and researchers.
Автор: Behrends, Ehrhard Название: Math behind the magic ISBN: 1470448661 ISBN-13(EAN): 9781470448660 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 29260.00 T Наличие на складе: Нет в наличии. Описание: A magician appears able to banish chaos at will: a deck of cards arranged in order is shuffled--apparently randomly--by a member of the audience. Then, hey presto! The deck is suddenly put back in its original order! Magic tricks like this are easy to perform and have an interesting mathematical foundation. In this rich, colorfully illustrated volume, Ehrhard Behrends presents around 30 card tricks and number games that are easy to learn, with no prior knowledge required. This is math as you've never experienced it before: entertaining and fun!
Автор: Kurgalin Название: The Discrete Math Workbook ISBN: 3319926446 ISBN-13(EAN): 9783319926445 Издательство: Springer Рейтинг: Цена: 41920.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
This practically-oriented textbook presents an accessible introduction to discrete mathematics through a substantial collection of classroom-tested exercises. Each chapter opens with concise coverage of the theory underlying the topic, reviewing the basic concepts and establishing the terminology, as well as providing the key formulae and instructions on their use. This is then followed by a detailed account of the most common problems in the area, before the reader is invited to practice solving such problems for themselves through a varied series of questions and assignments.
Topics and features: provides an extensive set of exercises and examples of varying levels of complexity, suitable for both laboratory practical training and self-study; offers detailed solutions to many problems, applying commonly-used methods and computational schemes; introduces the fundamentals of mathematical logic, the theory of algorithms, Boolean algebra, graph theory, sets, relations, functions, and combinatorics; presents more advanced material on the design and analysis of algorithms, including asymptotic analysis, and parallel algorithms; includes reference lists of trigonometric and finite summation formulae in an appendix, together with basic rules for differential and integral calculus.
This hands-on study guide is designed to address the core needs of undergraduate students training in computer science, informatics, and electronic engineering, emphasizing the skills required to develop and implement an algorithm in a specific programming language.
A practical guide simplifying discrete math for curious minds and demonstrating its application in solving problems related to software development, computer algorithms, and data science
Key Features:
Apply the math of countable objects to practical problems in computer science
Explore modern Python libraries such as scikit-learn, NumPy, and SciPy for performing mathematics
Learn complex statistical and mathematical concepts with the help of hands-on examples and expert guidance
Book Description:
Discrete mathematics deals with studying countable, distinct elements, and its principles are widely used in building algorithms for computer science and data science. The knowledge of discrete math concepts will help you understand the algorithms, binary, and general mathematics that sit at the core of data-driven tasks.
Practical Discrete Mathematics is a comprehensive introduction for those who are new to the mathematics of countable objects. This book will help you get up to speed with using discrete math principles to take your computer science skills to a more advanced level.
As you learn the language of discrete mathematics, you'll also cover methods crucial to studying and describing computer science and machine learning objects and algorithms. The chapters that follow will guide you through how memory and CPUs work. In addition to this, you'll understand how to analyze data for useful patterns, before finally exploring how to apply math concepts in network routing, web searching, and data science.
By the end of this book, you'll have a deeper understanding of discrete math and its applications in computer science, and be ready to work on real-world algorithm development and machine learning.
What You Will Learn:
Understand the terminology and methods in discrete math and their usage in algorithms and data problems
Use Boolean algebra in formal logic and elementary control structures
Implement combinatorics to measure computational complexity and manage memory allocation
Use random variables, calculate descriptive statistics, and find average-case computational complexity
Solve graph problems involved in routing, pathfinding, and graph searches, such as depth-first search
Perform ML tasks such as data visualization, regression, and dimensionality reduction
Who this book is for:
This book is for computer scientists looking to expand their knowledge of discrete math, the core topic of their field. University students looking to get hands-on with computer science, mathematics, statistics, engineering, or related disciplines will also find this book useful. Basic Python programming skills and knowledge of elementary real-number algebra are required to get started with this book.
Автор: Tom Jenkyns; Ben Stephenson Название: Fundamentals of Discrete Math for Computer Science ISBN: 3319701509 ISBN-13(EAN): 9783319701509 Издательство: Springer Рейтинг: Цена: 55890.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
An understanding of discrete mathematics is essential for students of computer science wishing to improve their programming competence.
Fundamentals of Discrete Math for Computer Science provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Clearly structured and interactive in nature, the book presents detailed walkthroughs of several algorithms, stimulating a conversation with the reader through informal commentary and provocative questions.
Topics and features: highly accessible and easy to read, introducing concepts in discrete mathematics without requiring a university-level background in mathematics; ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations; describes mathematical processes in an algorithmic manner, often including a walk-through demonstrating how the algorithm performs the desired task as expected; contains examples and exercises throughout the text, and highlights the most important concepts in each section; selects examples that demonstrate a practical use for the concept in question.
This easy-to-understand and fun-to-read textbook is ideal for an introductory discrete mathematics course for computer science students at the beginning of their studies. The book assumes no prior mathematical knowledge, and discusses concepts in programming as needed, allowing it to be used in a mathematics course taken concurrently with a student's first programming course.
Название: Connections in discrete mathematics ISBN: 1316607887 ISBN-13(EAN): 9781316607886 Издательство: Cambridge Academ Рейтинг: Цена: 57030.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: For over fifty years, Ron Graham has been able to illuminate the common threads connecting different areas in discrete mathematics. Inspired by Graham, this collection of papers written by top researchers in discrete mathematics encompasses a broad range of topics from numbers and geometry to juggling and probability.
Автор: Lipson Marc, Lipschutz Seymour Название: Schaum`s Outline of Discrete Mathematics, Fourth Edition ISBN: 1264258801 ISBN-13(EAN): 9781264258802 Издательство: McGraw-Hill Рейтинг: Цена: 20580.00 T Наличие на складе: Поставка под заказ. Описание: The twenty-seven essays in this volume, edited and written by leading archaeologists and prehistorians, consider how prehistoric humans attempted to recognise, understand and conceptualise death. Together they trace the emergence of death as a concept and contributing factor to the formation of communities and social hierarchies, and sometimes the creation of divinities.
Автор: Sergei Kurgalin; Sergei Borzunov Название: The Discrete Math Workbook ISBN: 3030064794 ISBN-13(EAN): 9783030064792 Издательство: Springer Рейтинг: Цена: 41920.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This practically-oriented textbook presents an accessible introduction to discrete mathematics through a substantial collection of classroom-tested exercises. Each chapter opens with concise coverage of the theory underlying the topic, reviewing the basic concepts and establishing the terminology, as well as providing the key formulae and instructions on their use. This is then followed by a detailed account of the most common problems in the area, before the reader is invited to practice solving such problems for themselves through a varied series of questions and assignments.Topics and features: provides an extensive set of exercises and examples of varying levels of complexity, suitable for both laboratory practical training and self-study; offers detailed solutions to many problems, applying commonly-used methods and computational schemes; introduces the fundamentals of mathematical logic, the theory of algorithms, Boolean algebra, graph theory, sets, relations, functions, and combinatorics; presents more advanced material on the design and analysis of algorithms, including asymptotic analysis, and parallel algorithms; includes reference lists of trigonometric and finite summation formulae in an appendix, together with basic rules for differential and integral calculus.This hands-on study guide is designed to address the core needs of undergraduate students training in computer science, informatics, and electronic engineering, emphasizing the skills required to develop and implement an algorithm in a specific programming language.
Автор: Mollin Название: Advanced Number Theory with Applications ISBN: 1138113255 ISBN-13(EAN): 9781138113251 Издательство: Taylor&Francis Рейтинг: Цена: 78590.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
Exploring one of the most dynamic areas of mathematics, Advanced Number Theory with Applications covers a wide range of algebraic, analytic, combinatorial, cryptographic, and geometric aspects of number theory. Written by a recognized leader in algebra and number theory, the book includes a page reference for every citing in the bibliography and more than 1,500 entries in the index so that students can easily cross-reference and find the appropriate data.
With numerous examples throughout, the text begins with coverage of algebraic number theory, binary quadratic forms, Diophantine approximation, arithmetic functions, p-adic analysis, Dirichlet characters, density, and primes in arithmetic progression. It then applies these tools to Diophantine equations, before developing elliptic curves and modular forms. The text also presents an overview of Fermat's Last Theorem (FLT) and numerous consequences of the ABC conjecture, including Thue-Siegel-Roth theorem, Hall's conjecture, the Erd s-Mollin--Walsh conjecture, and the Granville-Langevin Conjecture. In the appendix, the author reviews sieve methods, such as Eratothesenes', Selberg's, Linnik's, and Bombieri's sieves. He also discusses recent results on gaps between primes and the use of sieves in factoring.
By focusing on salient techniques in number theory, this textbook provides the most up-to-date and comprehensive material for a second course in this field. It prepares students for future study at the graduate level.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
