This fifth entry in the highly acclaimed Math Girls series focuses on the mathematics of Évariste Galois, the nineteenth-century wunderkind who revolutionized mathematics with work he performed while still a teenager. Mathematicians before him had discovered solutions to general second-, third-, and fourth-degree equations, but a similar quintic formula that would allow knowing the solutions to any fifth-degree equation had eluded mathematicians for centuries. Through his ingenious approach of bridging the worlds of groups and fields, young Galois not only showed that such a formula was impossible, he newly developed group theory and the branch of mathematics that today bears his name. Join Miruka and friends to see how Galois developed his theory, along with related topics such as geometric constructions and the angle trisection problem, derivation of the cubic formula, reducible and irreducible polynomials, group theory and field theory, symmetric polynomials, roots of unity, sets and cosets, cyclotomic polynomials, vector spaces, extension fields, and symmetric groups. The book concludes with a tour through Galois's first paper, in which he describes for the first time the necessary and sufficient conditions for a polynomial to be algebraically solved using radicals. Math Girls 5: Galois Theory has something for anyone interested in mathematics, from advanced high school to college students and educators.
This fourth entry in the highly acclaimed Math Girls series focuses on the mathematics of computer science and analysis of algorithms. Algorithms generally strive to take the shortest route to their goal, so how is it that adding a random element to how they work can improve their performance? Further, how can we apply mathematics to quantitatively compare the performance of different algorithms? Is it possible to predict the limits of how well an algorithm can perform, without coding and running it on an actual computer? New math girl and talented programmer Lisa will join Miruka and friends to explore these and other questions, applying what they learn to well-known algorithms such as bubble sort and quicksort. Other topics explored in this book include the Monty Hall problem, permutations and combinations, Pascal's triangle, the definition of probability, sample spaces, probability distributions, random variables, expected values, big-O notation, matrices, linear transformations, matrix diagonalization, random walks, the 3-SAT problem, and the P-versus-NP problem. Math Girls 4: Randomized Algorithms has something for anyone interested in mathematics and computer science, from advanced high school students to college students and educators.
This sixth entry in the highly acclaimed Math Girls series focuses on the Poincaré Conjecture, a fundamental problem in topology first proposed in 1904. While the problem is simply stated and easily understood, it resisted proof throughout the twentieth century. Russian mathematician Grigori Perelman finally completed that effort, publishing a series of papers in 2002 that provided missing details for an argument that includes a solution. In this book, you will join Miruka and friends as they learn about topology from its very beginnings: the Seven Bridges of Königsberg problem that Leonhard Euler investigated in 1736. After that you will learn about interesting objects like the Möbius strip and the Klein bottle, topological spaces and continuous mappings, homeomophism and homotopy, and non-Euclidean geometries. Along the way, you will also learn about differential equations, Fourier series, the heat equation, and a trigonometric training regimen. The book concludes with an introduction to Hamilton's Ricci flow, a crucial tool in Perelman's work on the Poincaré Conjecture. Math Girls 6: The Poincaré Conjecture has something for anyone interested in mathematics, from advanced high school to college students and educators.
In the early twentieth century, a massive undertaking to rid mathematics of all paradoxes and inconsistencies was underway. Known as Hilbert's program, it sought to provide an unshakable foundation for all of mathematics. Things seemed to be proceeding well until young Kurt Gödel stunned the world by proving that Hilbert's goals were unobtainable, that contradiction was part of the warp and weave of any mathematical system. Yet what at the time seemed to be a fatal blow to mathematical consistency now forms the basis of modern logic. Gödel's incompleteness theorems are often misunderstood to be a statement of the limits of mathematical reasoning, but in truth they strengthen mathematics, building it up to be more powerful than what had come before. In this third book in the Math Girls series, join Miruka and friends as they tackle the basics of modern logic, learning such topics as the Peano axioms, set theory, and diagonalization, leading up to an in-depth exploration of Gödel's famous theorems. Along the way, visit other interesting and important topics such as trigonometry and the epsilon-delta definition of limits, and of course take on challenges from the enigmatic Mr. Muraki. Math Girls 3: Gödel's Incompleteness Theorems has something for anyone interested in mathematics, from advanced high school students to college math majors and educators.
This fourth entry in the highly acclaimed Math Girls series focuses on the mathematics of computer science and analysis of algorithms. Algorithms generally strive to take the shortest route to their goal, so how is it that adding a random element to how they work can improve their performance? Further, how can we apply mathematics to quantitatively compare the performance of different algorithms? Is it possible to predict the limits of how well an algorithm can perform, without coding and running it on an actual computer? New math girl and talented programmer Lisa will join Miruka and friends to explore these and other questions, applying what they learn to well-known algorithms such as bubble sort and quicksort. Other topics explored in this book include the Monty Hall problem, permutations and combinations, Pascal's triangle, the definition of probability, sample spaces, probability distributions, random variables, expected values, big-O notation, matrices, linear transformations, matrix diagonalization, random walks, the 3-SAT problem, and the P-versus-NP problem. Math Girls 4: Randomized Algorithms has something for anyone interested in mathematics and computer science, from advanced high school students to college students and educators.
This fifth entry in the highly acclaimed Math Girls series focuses on the mathematics of Évariste Galois, the nineteenth-century wunderkind who revolutionized mathematics with work he performed while still a teenager. Mathematicians before him had discovered solutions to general second-, third-, and fourth-degree equations, but a similar quintic formula that would allow knowing the solutions to any fifth-degree equation had eluded mathematicians for centuries. Through his ingenious approach of bridging the worlds of groups and fields, young Galois not only showed that such a formula was impossible, he newly developed group theory and the branch of mathematics that today bears his name. Join Miruka and friends to see how Galois developed his theory, along with related topics such as geometric constructions and the angle trisection problem, derivation of the cubic formula, reducible and irreducible polynomials, group theory and field theory, symmetric polynomials, roots of unity, sets and cosets, cyclotomic polynomials, vector spaces, extension fields, and symmetric groups. The book concludes with a tour through Galois's first paper, in which he describes for the first time the necessary and sufficient conditions for a polynomial to be algebraically solved using radicals. Math Girls 5: Galois Theory has something for anyone interested in mathematics, from advanced high school to college students and educators.
This sixth entry in the highly acclaimed Math Girls series focuses on the Poincaré Conjecture, a fundamental problem in topology first proposed in 1904. While the problem is simply stated and easily understood, it resisted proof throughout the twentieth century. Russian mathematician Grigori Perelman finally completed that effort, publishing a series of papers in 2002 that provided missing details for an argument that includes a solution. In this book, you will join Miruka and friends as they learn about topology from its very beginnings: the Seven Bridges of Königsberg problem that Leonhard Euler investigated in 1736. After that you will learn about interesting objects like the Möbius strip and the Klein bottle, topological spaces and continuous mappings, homeomophism and homotopy, and non-Euclidean geometries. Along the way, you will also learn about differential equations, Fourier series, the heat equation, and a trigonometric training regimen. The book concludes with an introduction to Hamilton's Ricci flow, a crucial tool in Perelman's work on the Poincaré Conjecture. Math Girls 6: The Poincaré Conjecture has something for anyone interested in mathematics, from advanced high school to college students and educators.
This fourth entry in the highly acclaimed Math Girls series focuses on the mathematics of computer science and analysis of algorithms. Algorithms generally strive to take the shortest route to their goal, so how is it that adding a random element to how they work can improve their performance? Further, how can we apply mathematics to quantitatively compare the performance of different algorithms? Is it possible to predict the limits of how well an algorithm can perform, without coding and running it on an actual computer? New math girl and talented programmer Lisa will join Miruka and friends to explore these and other questions, applying what they learn to well-known algorithms such as bubble sort and quicksort. Other topics explored in this book include the Monty Hall problem, permutations and combinations, Pascal's triangle, the definition of probability, sample spaces, probability distributions, random variables, expected values, big-O notation, matrices, linear transformations, matrix diagonalization, random walks, the 3-SAT problem, and the P-versus-NP problem. Math Girls 4: Randomized Algorithms has something for anyone interested in mathematics and computer science, from advanced high school students to college students and educators.
This sixth entry in the highly acclaimed Math Girls series focuses on the Poincaré Conjecture, a fundamental problem in topology first proposed in 1904. While the problem is simply stated and easily understood, it resisted proof throughout the twentieth century. Russian mathematician Grigori Perelman finally completed that effort, publishing a series of papers in 2002 that provided missing details for an argument that includes a solution. In this book, you will join Miruka and friends as they learn about topology from its very beginnings: the Seven Bridges of Königsberg problem that Leonhard Euler investigated in 1736. After that you will learn about interesting objects like the Möbius strip and the Klein bottle, topological spaces and continuous mappings, homeomophism and homotopy, and non-Euclidean geometries. Along the way, you will also learn about differential equations, Fourier series, the heat equation, and a trigonometric training regimen. The book concludes with an introduction to Hamilton's Ricci flow, a crucial tool in Perelman's work on the Poincaré Conjecture. Math Girls 6: The Poincaré Conjecture has something for anyone interested in mathematics, from advanced high school to college students and educators.