This book is about algebra. This is a very old science and its gems have lost their charm for us through everyday use. We have tried in this book to refresh them for you. The main part of the book is made up of problems. The best way to deal with them is: Solve the problem by yourself - compare your solution with the solution in the book (if it exists) - go to the next problem. However, if you have difficulties solving a problem (and some of them are quite difficult), you may read the hint or start to read the solution. If there is no solution in the book for some problem, you may skip it (it is not heavily used in the sequel) and return to it later. The book is divided into sections devoted to different topics. Some of them are very short, others are rather long. Of course, you know arithmetic pretty well. However, we shall go through it once more, starting with easy things. 2 Exchange of terms in addition Let's add 3 and 5: 3]5=8. And now change the order: 5+3=8. We get the same result. Adding three apples to five apples is the same as adding five apples to three - apples do not disappear and we get eight of them in both cases. 3 Exchange of terms in multiplication Multiplication has a similar property. But let us first agree on notation.

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 text is structured in a problem-solution format that requires the student to think through the programming process. New to the second edition are additional chapters on suffix trees, games and strategies, and Huffman coding as well as an Appendix illustrating the ease of conversion from Pascal to C.

200 puzzles! Circuit Board Square is a logic-based number-placement puzzle. The objective is to fill in the 3x3 grid with all of the digits from 1 to 9. The sums from each of the paths are determined by the values in the squares connected to those paths.

Classical Euclidean geometry, with all its triangles, circles, and inscribed angles, remains an excellent playground for high-school mathematics students, even if it looks outdated from the professional mathematician's viewpoint. It provides an excellent choice of elegant and natural problems that can be used in a course based on problem solving. The book contains more than 750 (mostly) easy but nontrivial problems in all areas of plane geometry and solutions for most of them, as well as additional problems for self-study (some with hints). Each chapter also provides concise reminders of basic notions used in the chapter, so the book is almost self-contained (although a good textbook and competent teacher are always recommended). More than 450 figures illustrate the problems and their solutions. The book can be used by motivated high-school students, as well as their teachers and parents. After solving the problems in the book the student will have mastered the main notions and methods of plane geometry and, hopefully, will have had fun in the process. In the interest of fostering a greater awareness and appreciation of mathematics and its connections to other disciplines and everyday life, MSRI and the AMS are publishing books in the Mathematical Circles Library series as a service to young people, their parents and teachers, and the mathematics profession.