Springer Undergraduate Texts in Mathematics and Technology – serie

This text provides a mathematically rigorous introduction to modern methods of machine learning and data analysis at the advanced undergraduate/beginning graduate level. The book is self-contained and requires minimal mathematical prerequisites. There is a strong focus on learning how and why algorithms work, as well as developing facility with their practical applications. Apart from basic calculus, the underlying mathematics — linear algebra, optimization, elementary probability, graph theory, and statistics — is developed from scratch in a form best suited to the overall goals.  In particular, the wide-ranging linear algebra components are unique in their ordering and choice of topics, emphasizing those parts of the theory and techniques that are used in contemporary machine learning and data analysis.  The book will provide a firm foundation to the reader whose goal is to work on applications of machine learning and/or research into the further development of this highly active field of contemporary applied mathematics.To introduce the reader to a broad range of machine learning algorithms and how they are used in real world applications, the programming language Python is employed and offers a platform for many of the computational exercises. Python notebooks complementing various topics in the book are available on a companion GitHub site specified in the Preface, and can be easily accessed by scanning the QR codes or clicking on the links provided within the text. Exercises appear at the end of each section, including basic ones designed to test comprehension and computational skills, while others range over proofs not supplied in the text, practical computations, additional theoretical results, and further developments in the subject.  The Students’ Solutions Manual may be accessed from GitHub. Instructors may apply for access to the Instructors’ Solutions Manual from the link supplied on the text’s Springer website.The book can be used in a junior or senior level course for students majoring in mathematics with a focus on applications as well as students from other disciplines who desire to learn the tools of modern applied linear algebra and optimization. It may also be used as an introduction to fundamental techniques in data science and machine learning for advanced undergraduate and graduate students or researchers from other areas, including statistics, computer science, engineering, biology, economics and finance, and so on.

This textbook provides an introduction to the mathematics on which modern cryptology is based. It covers not only public key cryptography, the glamorous component of modern cryptology, but also pays considerable attention to secret key cryptography, its workhorse in practice.Modern cryptology has been described as the science of the integrity of information, covering all aspects like confidentiality, authenticity and non-repudiation and also including the protocols required for achieving these aims. In both theory and practice it requires notions and constructions from three major disciplines: computer science, electronic engineering and mathematics. Within mathematics, group theory, the theory of finite fields, and elementary number theory as well as some topics not normally covered in courses in algebra, such as the theory of Boolean functions and Shannon theory, are involved.Although essentially self-contained, a degree of mathematical maturity on the part of the reader is assumed, corresponding to his or her background in computer science or engineering. Algebra for Cryptologists is a textbook for an introductory course in cryptography or an upper undergraduate course in algebra, or for self-study in preparation for postgraduate study in cryptology.

Les auteurs présentent des concepts mathématiques de base, comme les chaînes de Markov, les fonctions itérées, la structure de corps fini, et les développent dans le contexte de problèmes réels tels que la navigation internet, la compression de données et les codes correcteurs d'erreurs. Un des leitmotivs du texte est de montrer comment la modélisation mathématique, la puissance des outils mathématiques et l'abstraction sont toutes cruciales pour l'innovation technologique. Les divers sujets sont présentés avec clarté et les mathématiques toujours discutées à partir de connaissances de base. Chaque chapitre suggère de nombreux exercices, certains élémentaires pour renforcer la compréhension, d'autres plus avancés pour explorer de nouvelles problématiques. Une mise en contexte historique de certains concepts mathématiques ou de l'évolution d'une technologique enrichit le texte.

Of what use is mathematics? Hasn’t everything in mathematics already been disc- ered? Thesearenaturalquestionsoftenaskedbyundergraduates. Theanswersprovided by their professors are often quite brief. Most university courses, pressed for time and rigidly structured, o?er little opportunity to present and study actual applications and real-world examples. Evenmorehigh-schoolstudentsaskthesamequestionswithmoreinsistence. Tea- ers in these schools generally work under even tighter constraints than university prof- sors. If they are able to competently respond to these questions it is probably because they received good answers from their teachers and professors. And if they do not have the answers, then whose fault is it? The genesis of this text It is impossible to introduce this text without ?rst discussing the course in which it originated. The course “Mathematics and Technology” was created at the Universit´ e de Montr´ eal and taught for the ?rst time in the winter semester of 2001. It was created after observing that most courses in the department neglect to present real applications. Sinceitscreationthecoursehasbeenopentobothundergraduatemathematicsstudents and future high-school teachers. Since no appropriate text or manual for the course we envisioned existed, we were led to write our own course notes, from which we taught. We got so caught up in writing these notes that they quickly grew to the size of a textbook, containing much more material than could possibly be taught in one semester. Despite the two of us being career mathematicians, we must admit that we both knew little or nothing about most of the applications presented in the following chapters.

This text on geometry is devoted to various central geometrical topics including: graphs of functions, transformations, (non-)Euclidean geometries, curves and surfaces as well as their applications in a variety of disciplines. This book presents elementary methods for analytical modeling and demonstrates the potential for symbolic computational tools to support the development of analytical solutions. The author systematically examines several powerful tools of MATLAB(R) including 2D and 3D animation of geometric images with shadows and colors and transformations using matrices. With over 150 stimulating exercises and problems, this text integrates traditional differential and non-Euclidean geometries with more current computer systems in a practical and user-friendly format. This text is an excellent classroom resource or self-study reference for undergraduate students in a variety of disciplines.

The main intended audience for this book is undergraduate students in pure and applied sciences, especially those in engineering. Chapters 2 to 4 cover the probability theory they generally need in their training. Although the treatment of the subject is surely su?cient for non-mathematicians, I intentionally avoided getting too much into detail. For instance, topics such as mixed type random variables and the Dirac delta function are only brie?y mentioned. Courses on probability theory are often considered di?cult. However, after having taught this subject for many years, I have come to the conclusion that one of the biggest problems that the students face when they try to learn probability theory, particularly nowadays, is their de?ciencies in basic di?erential and integral calculus. Integration by parts, for example, is often already forgotten by the students when they take a course on probability. For this reason, I have decided to write a chapter reviewing the basic elements of di?erential calculus. Even though this chapter might not be covered in class, the students can refer to it when needed. In this chapter, an e?ort was made to give the readers a good idea of the use in probability theory of the concepts they should already know. Chapter 2 presents the main results of what is known as elementary probability, including Bayes’ rule and elements of combinatorial analysis.

Drawing examples from mathematics, physics, chemistry, biology, engineering, economics, medicine, politics, and sports, this book illustrates how nonlinear dynamics plays a vital role in our world. Examples cover a wide range from the spread and possible control of communicable diseases, to the lack of predictability in long-range weather forecasting, to competition between political groups and nations.After an introductory chapter that explores what it means to be nonlinear, the book covers the mathematical concepts such as limit cycles, fractals, chaos, bifurcations, and solitons, that will be applied throughout the book. Numerous computer simulations and exercises allow students to explore topics in greater depth using the Maple computer algebra system. The mathematical level of the text assumes prior exposure to ordinary differential equations and familiarity with the wave and diffusion equations.  No prior knowledge of Maple is assumed.Thebook may be used at the undergraduate or graduate level to prepare science and engineering students for problems in the "real world", or for self-study by practicing scientists and engineers.

Optimization is a field important in its own right but is also integral to numerous applied sciences, including operations research, management science, economics, finance and all branches of mathematics-oriented engineering. Constrained optimization models are one of the most widely used mathematical models in operations research and management science.This book gives a modern and well-balanced presentation of the subject, focusing on theory but also including algorithims and examples from various real-world applications. The text is easy to read and accessible to anyone with a knowledge of multi-dimensional calculus, linear algebra and basic numerical methods. Detailed examples and counter-examples are provided - as are exercises, solutions and helpful hints, and Matlab/Maple supplements.The intended readership is advanced undergraduates, graduates, and professionals in any of the applied fields.

Algorithms and Programming is primarily intended for use in a first-year undergraduate course in programming. It is structured in a problem-solution format that requires the student to think through the programming process, thus developing an understanding of the underlying theory. The book is easily readable by a student taking a basic introductory course in computer science as well as useful for a graduate-level course in the analysis of algorithms and/or compiler construction.Each self-contained chapter presents classical and well-known problems supplemented by clear and in-depth explanations. The material covered includes such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms and much more. Students and teachers will find this both an excellent text for learning programming and a source of problems for a variety of courses.

Of what use is mathematics? Hasn’t everything in mathematics already been disc- ered? Thesearenaturalquestionsoftenaskedbyundergraduates. Theanswersprovided by their professors are often quite brief. Most university courses, pressed for time and rigidly structured, o?er little opportunity to present and study actual applications and real-world examples. Evenmorehigh-schoolstudentsaskthesamequestionswithmoreinsistence. Tea- ers in these schools generally work under even tighter constraints than university prof- sors. If they are able to competently respond to these questions it is probably because they received good answers from their teachers and professors. And if they do not have the answers, then whose fault is it? The genesis of this text It is impossible to introduce this text without ?rst discussing the course in which it originated. The course “Mathematics and Technology” was created at the Universit´ e de Montr´ eal and taught for the ?rst time in the winter semester of 2001. It was created after observing that most courses in the department neglect to present real applications. Sinceitscreationthecoursehasbeenopentobothundergraduatemathematicsstudents and future high-school teachers. Since no appropriate text or manual for the course we envisioned existed, we were led to write our own course notes, from which we taught. We got so caught up in writing these notes that they quickly grew to the size of a textbook, containing much more material than could possibly be taught in one semester. Despite the two of us being career mathematicians, we must admit that we both knew little or nothing about most of the applications presented in the following chapters.

Thirty years ago mathematical, as opposed to applied numerical, computation was difficult to perform and so relatively little used. Three threads changed that: the emergence of the personal computer; the discovery of fiber-optics and the consequent development of the modern internet; and the building of the Three “M’s” Maple, Mathematica and Matlab. We intend to persuade that Maple and other like tools are worth knowing assuming only that one wishes to be a mathematician, a mathematics educator, a computer scientist, an engineer or scientist, or anyone else who wishes/needs to use mathematics better. We also hope to explain how to become an `experimental mathematician' while learning to be better at proving things. To accomplish this our material is divided into three main chapters followed by a postscript. These cover elementary number theory, calculus of one and several variables, introductory linear algebra, and visualization and interactive geometric computation.

The main intended audience for this book is undergraduate students in pure and applied sciences, especially those in engineering. Chapters 2 to 4 cover the probability theory they generally need in their training. Although the treatment of the subject is surely su?cient for non-mathematicians, I intentionally avoided getting too much into detail. For instance, topics such as mixed type random variables and the Dirac delta function are only brie?y mentioned. Courses on probability theory are often considered di?cult. However, after having taught this subject for many years, I have come to the conclusion that one of the biggest problems that the students face when they try to learn probability theory, particularly nowadays, is their de?ciencies in basic di?erential and integral calculus. Integration by parts, for example, is often already forgotten by the students when they take a course on probability. For this reason, I have decided to write a chapter reviewing the basic elements of di?erential calculus. Even though this chapter might not be covered in class, the students can refer to it when needed. In this chapter, an e?ort was made to give the readers a good idea of the use in probability theory of the concepts they should already know. Chapter 2 presents the main results of what is known as elementary probability, including Bayes’ rule and elements of combinatorial analysis.

Thirty years ago mathematical, as opposed to applied numerical, computation was difficult to perform and so relatively little used. Three threads changed that: the emergence of the personal computer; the discovery of fiber-optics and the consequent development of the modern internet; and the building of the Three “M’s” Maple, Mathematica and Matlab.We intend to persuade that Mathematica and other similar tools are worth knowing, assuming only that one wishes to be a mathematician, a mathematics educator, a computer scientist, an engineer or scientist, or anyone else who wishes/needs to use mathematics better. We also hope to explain how to become an "experimental mathematician" while learning to be better at proving things. To accomplish this our material is divided into three main chapters followed by a postscript. These cover elementary number theory, calculus of one and several variables, introductory linear algebra, and visualization and interactive geometric computation.

This text introduces upper division undergraduate/beginning graduate students in mathematics, finance, or economics, to the core topics of a beginning course in finance/financial engineering. Particular emphasis is placed on exploiting the power of the Monte Carlo method to illustrate and explore financial principles. Monte Carlo is the uniquely appropriate tool for modeling the random factors that drive financial markets and simulating their implications.The Monte Carlo method is introduced early and it is used in conjunction with the geometric Brownian motion model (GBM) to illustrate and analyze the topics covered in the remainder of the text. Placing focus on Monte Carlo methods allows for students to travel a short road from theory to practical applications. Coverage includes investment science, mean-variance portfolio theory, option pricing principles, exotic options, option trading strategies, jump diffusion and exponential Lévy alternative models, and the Kelly criterion for maximizing investment growth.Novel features:inclusion of both portfolio theory and contingent claim analysis in a single textpricing methodology for exotic optionsexpectation analysis of option trading strategiespricing models that transcend the Black–Scholes frameworkoptimizing investment allocationsconcepts thoroughly explored through numerous simulation exercisesnumerous worked examples and illustrationsThe mathematical background required is a year and one-half course in calculus, matrix algebra covering solutions of linear systems, and a knowledge of probability including expectation, densities and the normal distribution. A refresher for these topics is presented in the Appendices. The programming background needed is how to code branching, loops and subroutines in some mathematical or general purpose language. The mathematical background required is a year and one-half course in calculus, matrix algebra covering solutions of linear systems, and a knowledge of probability including expectation, densities and the normal distribution. A refresher for these topics is presented in the Appendices. The programming background needed is how to code branching, loops and subroutines in some mathematical or general purpose language. Also by the author: (with F. Mendivil) Explorations in Monte Carlo, ©2009, ISBN: 978-0-387-87836-2; (with J. Herod) Mathematical Biology: An Introduction with Maple and Matlab, Second edition, ©2009, ISBN: 978-0-387-70983-3.

Algorithms and Programming is primarily intended for use in a first-year undergraduate course in programming. It is structured in a problem-solution format that requires the student to think through the programming process, thus developing an understanding of the underlying theory. The book is easily readable by a student taking a basic introductory course in computer science as well as useful for a graduate-level course in the analysis of algorithms and/or compiler construction.Each self-contained chapter presents classical and well-known problems supplemented by clear and in-depth explanations. The material covered includes such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms and much more. Students and teachers will find this both an excellent text for learning programming and a source of problems for a variety of courses.

This textbook aims to fill the gap between those that offer a theoretical treatment without many applications and those that present and apply formulas without appropriately deriving them. The balance achieved will give readers a fundamental understanding of key financial ideas and tools that form the basis for building realistic models, including those that may become proprietary. Numerous carefully chosen examples and exercises reinforce the student’s conceptual understanding and facility with applications.  The exercises are divided into conceptual, application-based, and theoretical problems, which probe the material deeper.The book is aimed toward advanced undergraduates and first-year graduate students who are new to finance or want a more rigorous treatment of the mathematical models used within. While no background in finance is assumed, prerequisite math courses include multivariable calculus, probability, and linear algebra. The authors introduce additional mathematical tools as needed. The entire textbook is appropriate for a single year-long course on introductory mathematical finance. The self-contained design of the text allows for instructor flexibility in topics courses and those focusing on financial derivatives. Moreover, the text is useful for mathematicians, physicists, and engineers who want to learn finance via an approach that builds their financial intuition and is explicit about model building, as well as business school students who want a treatment of finance that is deeper but not overly theoretical.

Optimization is a field important in its own right but is also integral to numerous applied sciences, including operations research, management science, economics, finance and all branches of mathematics-oriented engineering. Constrained optimization models are one of the most widely used mathematical models in operations research and management science.This book gives a modern and well-balanced presentation of the subject, focusing on theory but also including algorithims and examples from various real-world applications. The text is easy to read and accessible to anyone with a knowledge of multi-dimensional calculus, linear algebra and basic numerical methods. Detailed examples and counter-examples are provided - as are exercises, solutions and helpful hints, and Matlab/Maple supplements.The intended readership is advanced undergraduates, graduates, and professionals in any of the applied fields.

Thirty years ago mathematical, as opposed to applied numerical, computation was difficult to perform and so relatively little used. Three threads changed that: the emergence of the personal computer; the discovery of fiber-optics and the consequent development of the modern internet; and the building of the Three “M’s” Maple, Mathematica and Matlab. We intend to persuade that Maple and other like tools are worth knowing assuming only that one wishes to be a mathematician, a mathematics educator, a computer scientist, an engineer or scientist, or anyone else who wishes/needs to use mathematics better. We also hope to explain how to become an `experimental mathematician' while learning to be better at proving things. To accomplish this our material is divided into three main chapters followed by a postscript. These cover elementary number theory, calculus of one and several variables, introductory linear algebra, and visualization and interactive geometric computation.

Thirty years ago mathematical, as opposed to applied numerical, computation was difficult to perform and so relatively little used. Three threads changed that: the emergence of the personal computer; the discovery of fiber-optics and the consequent development of the modern internet; and the building of the Three “M’s” Maple, Mathematica and Matlab.We intend to persuade that Mathematica and other similar tools are worth knowing, assuming only that one wishes to be a mathematician, a mathematics educator, a computer scientist, an engineer or scientist, or anyone else who wishes/needs to use mathematics better. We also hope to explain how to become an "experimental mathematician" while learning to be better at proving things. To accomplish this our material is divided into three main chapters followed by a postscript. These cover elementary number theory, calculus of one and several variables, introductory linear algebra, and visualization and interactive geometric computation.

This text introduces upper division undergraduate/beginning graduate students in mathematics, finance, or economics, to the core topics of a beginning course in finance/financial engineering. Particular emphasis is placed on exploiting the power of the Monte Carlo method to illustrate and explore financial principles. Monte Carlo is the uniquely appropriate tool for modeling the random factors that drive financial markets and simulating their implications.The Monte Carlo method is introduced early and it is used in conjunction with the geometric Brownian motion model (GBM) to illustrate and analyze the topics covered in the remainder of the text. Placing focus on Monte Carlo methods allows for students to travel a short road from theory to practical applications. Coverage includes investment science, mean-variance portfolio theory, option pricing principles, exotic options, option trading strategies, jump diffusion and exponential Lévy alternative models, and the Kelly criterion for maximizing investment growth.Novel features:inclusion of both portfolio theory and contingent claim analysis in a single textpricing methodology for exotic optionsexpectation analysis of option trading strategiespricing models that transcend the Black–Scholes frameworkoptimizing investment allocationsconcepts thoroughly explored through numerous simulation exercisesnumerous worked examples and illustrationsThe mathematical background required is a year and one-half course in calculus, matrix algebra covering solutions of linear systems, and a knowledge of probability including expectation, densities and the normal distribution. A refresher for these topics is presented in the Appendices. The programming background needed is how to code branching, loops and subroutines in some mathematical or general purpose language. The mathematical background required is a year and one-half course in calculus, matrix algebra covering solutions of linear systems, and a knowledge of probability including expectation, densities and the normal distribution. A refresher for these topics is presented in the Appendices. The programming background needed is how to code branching, loops and subroutines in some mathematical or general purpose language. Also by the author: (with F. Mendivil) Explorations in Monte Carlo, ©2009, ISBN: 978-0-387-87836-2; (with J. Herod) Mathematical Biology: An Introduction with Maple and Matlab, Second edition, ©2009, ISBN: 978-0-387-70983-3.

Drawing examples from mathematics, physics, chemistry, biology, engineering, economics, medicine, politics, and sports, this book illustrates how nonlinear dynamics plays a vital role in our world. Examples cover a wide range from the spread and possible control of communicable diseases, to the lack of predictability in long-range weather forecasting, to competition between political groups and nations.After an introductory chapter that explores what it means to be nonlinear, the book covers the mathematical concepts such as limit cycles, fractals, chaos, bifurcations, and solitons, that will be applied throughout the book. Numerous computer simulations and exercises allow students to explore topics in greater depth using the Maple computer algebra system. The mathematical level of the text assumes prior exposure to ordinary differential equations and familiarity with the wave and diffusion equations.  No prior knowledge of Maple is assumed.Thebook may be used at the undergraduate or graduate level to prepare science and engineering students for problems in the "real world", or for self-study by practicing scientists and engineers.

This textbook aims to fill the gap between those that offer a theoretical treatment without many applications and those that present and apply formulas without appropriately deriving them. The balance achieved will give readers a fundamental understanding of key financial ideas and tools that form the basis for building realistic models, including those that may become proprietary. Numerous carefully chosen examples and exercises reinforce the student’s conceptual understanding and facility with applications.  The exercises are divided into conceptual, application-based, and theoretical problems, which probe the material deeper.The book is aimed toward advanced undergraduates and first-year graduate students who are new to finance or want a more rigorous treatment of the mathematical models used within. While no background in finance is assumed, prerequisite math courses include multivariable calculus, probability, and linear algebra. The authors introduce additional mathematical tools as needed. The entire textbook is appropriate for a single year-long course on introductory mathematical finance. The self-contained design of the text allows for instructor flexibility in topics courses and those focusing on financial derivatives. Moreover, the text is useful for mathematicians, physicists, and engineers who want to learn finance via an approach that builds their financial intuition and is explicit about model building, as well as business school students who want a treatment of finance that is deeper but not overly theoretical.

This book offers a user friendly, hands-on, and systematic introduction to applied and computational harmonic analysis: to Fourier analysis, signal processing and wavelets; and to their interplay and applications. The approach is novel, and the book can be used in undergraduate courses, for example, following a first course in linear algebra, but is also suitable for use in graduate level courses. The book will benefit anyone with a basic background in linear algebra. It defines fundamental concepts in signal processing and wavelet theory, assuming only a familiarity with elementary linear algebra. No background in signal processing is needed. Additionally, the book demonstrates in detail why linear algebra is often the best way to go. Those with only a signal processing background are also introduced to the world of linear algebra, although a full course is recommended.The book comes in two versions: one based on MATLAB, and one on Python, demonstrating the feasibility and applications of both approaches. Most of the MATLAB code is available interactively. The applications mainly involve sound and images. The book also includes a rich set of exercises, many of which are of a computational nature.

This book offers a user friendly, hands-on, and systematic introduction to applied and computational harmonic analysis: to Fourier analysis, signal processing and wavelets; and to their interplay and applications. The approach is novel, and the book can be used in undergraduate courses, for example, following a first course in linear algebra, but is also suitable for use in graduate level courses. The book will benefit anyone with a basic background in linear algebra. It defines fundamental concepts in signal processing and wavelet theory, assuming only a familiarity with elementary linear algebra. No background in signal processing is needed. Additionally, the book demonstrates in detail why linear algebra is often the best way to go. Those with only a signal processing background are also introduced to the world of linear algebra, although a full course is recommended.The book comes in two versions: one based on MATLAB, and one on Python, demonstrating the feasibilityand applications of both approaches. Most of the code is available interactively. The applications mainly involve sound and images. The book also includes a rich set of exercises, many of which are of a computational nature.

This textbook on nonlinear optimization focuses on model building, real world problems, and applications of optimization models to natural and social sciences. Organized into two parts, this book may be used as a primary text for courses on convex optimization and non-convex optimization. Definitions, proofs, and numerical methods are well illustrated and all chapters contain compelling exercises. The exercises emphasize fundamental theoretical results on optimality and duality theorems, numerical methods with or without constraints, and derivative-free optimization. Selected solutions are given. Applications to theoretical results and numerical methods are highlighted to help students comprehend methods and techniques.

This text presents a careful introduction to methods of cryptology and error correction in wide use throughout the world and the concepts of abstract algebra and number theory that are essential for  understanding these methods.  The objective is to provide a thorough understanding of RSA, Diffie–Hellman, and Blum–Goldwasser cryptosystems and Hamming and Reed–Solomon error correction: how they are constructed, how they are made to work efficiently, and also how they can be attacked.   To reach that level of understanding requires and motivates many ideas found in a first course in abstract algebra—rings, fields, finite abelian groups, basic theory of numbers, computational number theory, homomorphisms, ideals, and cosets.  Those who complete this book will have gained a solid mathematical foundation for more specialized applied courses on cryptology or error correction, and should also be well prepared, both in concepts and in motivation, to pursue more advanced study in algebra and number theory.This text is suitable for classroom or online use or for independent study. Aimed at students in mathematics, computer science, and engineering, the prerequisite includes one or two years of a standard calculus sequence. Ideally the reader will also take a concurrent course in linear algebra or elementary matrix theory. A solutions manual for the 400 exercises in the book is available to instructors who adopt the text for their course.

This undergraduate textbook presents an inquiry-based learning course in stochastic models and computing designed to serve as a first course in probability. Its modular structure complements a traditional lecture format, introducing new topics chapter by chapter with accompanying projects for group collaboration. The text addresses probability axioms leading to Bayes’ theorem, discrete and continuous random variables, Markov chains, and Brownian motion, as well as applications including randomized algorithms, randomized surveys, Benford’s law, and Monte Carlo methods. Adopting a unique application-driven approach to better study probability in action, the book emphasizes data, simulation, and games to strengthen reader insight and intuition while proving theorems. Additionally, the text incorporates codes and exercises in the Julia programming language to further promote a hands-on focus in modelling. Students should have prior knowledge of single variable calculus.Giray Ökten received his PhD from Claremont Graduate University. He has held academic positions at University of Alaska Fairbanks, Ball State University, and Florida State University. He received a Fulbright U.S. Scholar award in 2015. He is the author of an open access textbook in numerical analysis, First Semester in Numerical Analysis with Julia, published by Florida State University Libraries, and a co-author of a children’s math book, The Mathematical Investigations of Dr. O and Arya, published by Tumblehome. His research interests include Monte Carlo methods and computational finance.

This textbook offers an algorithmic introduction to the field of computer algebra. A leading expert in the field, the author guides readers through numerous hands-on tutorials designed to build practical skills and algorithmic thinking. This implementation-oriented approach equips readers with versatile tools that can be used to enhance studies in mathematical theory, applications, or teaching. Presented using Mathematica code, the book is fully supported by downloadable sessions in Mathematica, Maple, and Maxima.Opening with an introduction to computer algebra systems and the basics of programming mathematical algorithms, the book goes on to explore integer arithmetic. A chapter on modular arithmetic completes the number-theoretic foundations, which are then applied to coding theory and cryptography. From here, the focus shifts to polynomial arithmetic and algebraic numbers, with modern algorithms allowing the efficient factorization of polynomials. The final chapters offer extensions into more advanced topics: simplification and normal forms, power series, summation formulas, and integration.Computer Algebra is an indispensable resource for mathematics and computer science students new to the field. Numerous examples illustrate algorithms and their implementation throughout, with online support materials to encourage hands-on exploration. Prerequisites are minimal, with only a knowledge of calculus and linear algebra assumed. In addition to classroom use, the elementary approach and detailed index make this book an ideal reference for algorithms in computer algebra.