Mathematical Puzzle Tales from Mount Olympus uses fascinating tales from Greek Mythology as the background for introducing mathematics puzzles to the general public. A background in high school mathematics will be ample preparation for using this book, and it should appeal to anyone who enjoys puzzles and recreational mathematics. Features: Combines the arts and science, and emphasizes the fact that mathematics straddles both domains. Great resource for students preparing for mathematics competitions, and the trainers of such students.

Mathematical Recreations from the Tournament of the Towns contains the complete list of problems and solutions to the International Mathematics Tournament of the Towns from Fall 2007 to Spring 2021. The primary audience for this book is the army of recreational mathematicians united under the banner of Martin Gardner. It should also have great value to students preparing for mathematics competitions and trainers of such students. This book also provides an entry point for students in upper elementary schools. Features Huge recreational value to mathematics enthusiasts Accessible to upper-level high school students Problems classified by topics such as two-player games, weighing problems, mathematical tasks etc.

Mathematical Puzzle Tales from Mount Olympus uses fascinating tales from Greek Mythology as the background for introducing mathematics puzzles to the general public. A background in high school mathematics will be ample preparation for using this book, and it should appeal to anyone who enjoys puzzles and recreational mathematics. Features: Combines the arts and science, and emphasizes the fact that mathematics straddles both domains. Great resource for students preparing for mathematics competitions, and the trainers of such students.

This book convenes a selection of 200 mathematical puzzles with original solutions, all celebrating the inquisitive and inspiring spirit of Nobuyuki "Nob" Yoshigahara - a legend in the worldwide community of mathematical and mechanical puzzles. A graduate from the Tokyo Institute of Technology, Yoshigahara invented numerous mechanical puzzles and published over 80 puzzle books. In 2003, he was honored with the Sam Loyd Award, given by the Association for Games & Puzzles International to individuals who have been made a significant contribution to the world of mechanical puzzles. In this work, the reader will find some of the most ingenious puzzles ever created, organized in ten categories: Logic, matchstick, maze, algorithmic, combinatorial, digital, number, geometric, dissection, and others. Some of them could rivalry with those found at Mathematical Olympiads tests around the globe; others will work as powerful brain teasers for those with an interest in problem-solving. Math teachers, curious students of any age and even experienced mathematicians with a taste for the fun in science can find in this book unconventional paths to develop their problem-solving skills in a creative way.

This unique book presents mathematical competition problems primarily aimed at upper elementary school students, but are challenging for students at any age. These problems are drawn from the complete papers of the legendary Leningrad Mathematical Olympiads that were presented to the city's Grade Five students. The period covered is between 1979 - the earliest year for which relevant records could be retrieved - and 1992, when the former Soviet Union was dissolved. The respective chapters reflect the famous four-step approach to problem solving developed by the great Hungarian mathematics educator Gyorgy Polya. In Chapter One, the Grade Five Competition problems from the Leningrad Mathematical Olympiads from 1979 to 1992 are presented in chronological order. In Chapter Two, the 83 problems are loosely divided into 26 sets of three or four related problems, and an example is provided for each one. Chapter Three provides full solutions to all problems, while Chapter Four offers generalizations of the problems. This book can be used by any mathematically advanced student at the upper elementary school level. Teachers and organizers of outreach activities such as mathematical circles will also find this book useful. But the primary value of the book lies in the problems themselves, which were crafted by experts; therefore, anyone interested in problem solving will find this book a welcome addition to their library.

This unique book presents mathematical competition problems primarily aimed at upper elementary school students, but are challenging for students at any age. These problems are drawn from the complete papers of the legendary Leningrad Mathematical Olympiads that were presented to the city's Grade Five students. The period covered is between 1979 - the earliest year for which relevant records could be retrieved - and 1992, when the former Soviet Union was dissolved. The respective chapters reflect the famous four-step approach to problem solving developed by the great Hungarian mathematics educator Gyorgy Polya. In Chapter One, the Grade Five Competition problems from the Leningrad Mathematical Olympiads from 1979 to 1992 are presented in chronological order. In Chapter Two, the 83 problems are loosely divided into 26 sets of three or four related problems, and an example is provided for each one. Chapter Three provides full solutions to all problems, while Chapter Four offers generalizations of the problems. This book can be used by any mathematically advanced student at the upper elementary school level. Teachers and organizers of outreach activities such as mathematical circles will also find this book useful. But the primary value of the book lies in the problems themselves, which were crafted by experts; therefore, anyone interested in problem solving will find this book a welcome addition to their library.

This book provides an overview of how to run a Mathematical "Circle," i.e., an organization that discovers and nurtures young mathematical talents through meaningful extra-curricular activities. This is the first volume in a trilogy describing in particular the S.M.A.R.T. Circle project, which was founded in Edmonton, Canada in 1981. The acronym S.M.A.R.T. stands for Saturday Mathematical Activities, Recreations & Tutorials. This book, Volume I, offers a sampling of many aspects, including projects and mini-courses. Volume II, which consists of student projects, addresses the purpose of the Circle, and Volume III, consisting of mini-courses, explains what actually takes place in the Circle. All three volumes provide a wealth of resources (mathematical problems, quizzes and games, together with their solutions). The books will be of interest to self-motivated students who want to conduct independent research, teachers who work with these students, and teachers who are currently running or planning to run Mathematical Circles of their own.

This book describes projects in a Mathematical "Circle," i.e., an organization that discovers and nurtures young mathematical talents through meaningful extra-curricular activities. This is the second volume in a trilogy describing in particular the S.M.A.R.T. Circle project, which was founded in Edmonton, Canada in 1981. The acronym S.M.A.R.T. stands for Saturday Mathematical Activities, Recreations & Tutorials. This book, Volume II, is based on the papers published in scientific and education journals by the Circle members while they were still in junior high school (some still in elementary school). In essence, it explains the purpose of the Circle. Volume I describes how to run a Circle, and Volume III explains what actually takes place in the Circle. All three volumes provide a wealth of resources (mathematical problems, quizzes and games, together with their solutions). The books will be of interest to self-motivated students who want to conduct independent research, teachers who work with these students, and teachers who are currently running or planning to run Mathematical Circles of their own.

This textbook offers an accessible introduction to combinatorics, infused with Solomon Golomb's insights and illustrative examples. Core concepts in combinatorics are presented with an engaging narrative that suits undergraduate study at any level. Featuring early coverage of the Principle of Inclusion-Exclusion and a unified treatment of permutations later on, the structure emphasizes the cohesive development of ideas. Combined with the conversational style, this approach is especially well suited to independent study. Falling naturally into three parts, the book begins with a flexible Chapter Zero that can be used to cover essential background topics, or as a standalone problem-solving course. The following three chapters cover core topics in combinatorics, such as combinations, generating functions, and permutations. The final three chapters present additional topics, such as Fibonacci numbers, finite groups, and combinatorial structures. Numerous illuminating examples are included throughout, along with exercises of all levels. Three appendices include additional exercises, examples, and solutions to a selection of problems. Solomon Golomb's Course on Undergraduate Combinatorics is ideal for introducing mathematics students to combinatorics at any stage in their program. There are no formal prerequisites, but readers will benefit from mathematical curiosity and a willingness to engage in the book's many entertaining challenges.

This textbook offers an accessible introduction to combinatorics, infused with Solomon Golomb's insights and illustrative examples. Core concepts in combinatorics are presented with an engaging narrative that suits undergraduate study at any level. Featuring early coverage of the Principle of Inclusion-Exclusion and a unified treatment of permutations later on, the structure emphasizes the cohesive development of ideas. Combined with the conversational style, this approach is especially well suited to independent study. Falling naturally into three parts, the book begins with a flexible Chapter Zero that can be used to cover essential background topics, or as a standalone problem-solving course. The following three chapters cover core topics in combinatorics, such as combinations, generating functions, and permutations. The final three chapters present additional topics, such as Fibonacci numbers, finite groups, and combinatorial structures. Numerous illuminating examples are included throughout, along with exercises of all levels. Three appendices include additional exercises, examples, and solutions to a selection of problems. Solomon Golomb's Course on Undergraduate Combinatorics is ideal for introducing mathematics students to combinatorics at any stage in their program. There are no formal prerequisites, but readers will benefit from mathematical curiosity and a willingness to engage in the book's many entertaining challenges.

The Kurschak Mathematics Competition is the oldest high school mathematics competition in the world, dating back to 1894. This book is a continuation of Hungarian Problem Book III and takes the contest through 1963. Forty-eight problems in all are presented in this volume. Problems are classified under combinatorics, graph theory, number theory, divisibility, sums and differences, algebra, geometry, tangent lines and circles, geometric inequalities, combinatorial geometry, trigonometry and solid geometry. Multiple solutions to the problems are presented along with background material. There is a substantial section entitled 'Looking Back', which provides additional insights into the problems. Hungarian Problem Book IV is intended for beginners, although the experienced student will find much here. Beginners are encouraged to work the problems in each section and then to compare their results against the solutions presented in the book. They will find ample material in each section to help them improve their problem-solving techniques.

When one thinks of mathematical problems posed over the past 30 years, one name automatically leaps to the fore - Murray Klamkin. In this book Andy Liu and Bruce Shawyer present problems that he proposed over his career. It contains the 'quickies' (problems with quick and neat solutions) he proposed in 'Crux Mathematicorum, ' his longer problems, and also problems which were posed in tribute to him after he died. Solutions are provided in the second half of the book