You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This is a text that covers the standard topics in a sophomore-level course in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics, with an emphasis on motivation. It explains and clarifies the unwritten conventions in mathematics, and guides the students through a detailed discussion on how a proof is revised from its draft to a final polished form. Hands-on exercises help students understand a concept soon after learning it. The text adopts a spiral approach: many topics are revisited multiple times, sometimes from a different perspective or at a higher level of complexity. The goal is to slowly develop students' problem-solving and writing skills.
"Provides the first comprehensive treatment of theoretical, algorithmic, and application aspects of domination in graphs-discussing fundamental results and major research accomplishments in an easy-to-understand style. Includes chapters on domination algorithms and NP-completeness as well as frameworks for domination."
Thoroughly revised for a one-semester course, this well-known and highly regarded book is an outstanding text for undergraduate discrete mathematics. It has been updated with new or extended discussions of order notation, generating functions, chaos, aspects of statistics, and computational biology. Written in a lively, clear style that talks to the reader, the book is unique for its emphasis on algorithmics and the inductive and recursive paradigms as central mathematical themes. It includes a broad variety of applications, not just to mathematics and computer science, but to natural and social science as well. A manual of selected solutions is available for sale to students; see sidebar. A complete solution manual is available free to instructors who have adopted the book as a required text.
The book provides a self-contained introduction to classical Number Theory. All the proofs of the individual theorems and the solutions of the exercises are being presented step by step. Some historical remarks are also presented. The book will be directed to advanced undergraduate, beginning graduate students as well as to students who prepare for mathematical competitions (ex. Mathematical Olympiads and Putnam Mathematical competition).
A Spiral Workbook for Discrete Mathematics covers the standard topics in a sophomore-level course in discrete mathematics: logic, sets, proof techniques, basic number theory, functions,relations, and elementary combinatorics, with an emphasis on motivation. The text explains and claries the unwritten conventions in mathematics, and guides the students through a detailed discussion on how a proof is revised from its draft to a nal polished form. Hands-on exercises help students understand a concept soon after learning it. The text adopts a spiral approach: many topics are revisited multiple times, sometimes from a dierent perspective or at a higher level of complexity, in order to slowly develop the student's problem-solving and writing skills.
This is a collection of survey articles based on lectures presented at a colloquium and workshop in Geneva in 2003 to commemorate the 200th anniversary of the birth of Charles François Sturm. It aims at giving an overview of the development of Sturm-Liouville theory from its historical roots to present day research. It is the first time that such a comprehensive survey has been made available in compact form. The contributions come from internationally renowned experts and cover a wide range of developments of the theory. The book can therefore serve both as an introduction to Sturm-Liouville theory and as background for ongoing research. The volume is addressed to researchers in related areas, to advanced students and to those interested in the historical development of mathematics. The book will also be of interest to those involved in applications of the theory to diverse areas such as engineering, fluid dynamics and computational spectral analysis.
Papers on Mathematics on Non-Mathematics: A Combinatorial Contribution, Fuzzy Cosets and Normal Subgroups and Smarandache Fuzzy Algebra, Smarandache radio mean number, Smarandache friendly index number, Non-Hamiltonian Cubic Planar 3-Connected Graphs, Smarandachely odd sequential labeling, Smarandachely near m-labeling, Smarandachely near m-mean graph, Smarandachely k-dominator coloring, semi-entire equitable dominating graph, etc.
The International J. Mathematical Combinatorics is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly, which publishes original research papers and survey articles in all aspects of mathematical combinatorics, Smarandache multi-spaces, Smarandache geometries, non-Euclidean geometry, topology and their applications to other sciences..
This book contains 33 papers from among the 41 papers presented at the Eighth International Conference on Fibonacci Numbers and Their Applications which was held at the Rochester Institute of Technology, Rochester, New York, from June 22 to June 26, 1998. These papers have been selected after a careful review by well known referees in the field, and they range from elementary number theory to probability and statistics. The Fibonacci numbers and recurrence relations are their unifying bond. It is anticipated that this book, like its seven predecessors, will be useful to research workers and graduate students interested in the Fibonacci numbers and their applications. June 1, 1999 The Editor ...