Online education has become a major component of higher education worldwide. In mathematics and statistics courses, there exists a number of challenges that are unique to the teaching and learning of mathematics and statistics in an online environment. These challenges are deeply connected to already existing difficulties related to math anxiety, conceptual understanding of mathematical ideas, communicating mathematically, and the appropriate use of technology. Teaching and Learning Mathematics Online bridges these issues by presenting meaningful and practical solutions for teaching mathematics and statistics online. It focuses on the problems observed by mathematics instructors currently working in the field who strive to hone their craft and share best practices with our professional community. The book provides a set of standard practices, improving the quality of online teaching and the learning of mathematics. Instructors will benefit from learning new techniques and approaches to delivering content. Features Based on the experiences of working educators in the field Assimilates the latest technology developments for interactive distance education Focuses on mathematical education for developing early mathematics courses

* Recommended by T.Basar, SC series ed. * This text addresses a new, active area of research and fills a gap in the literature. * Bridges mathematics, engineering, and computer science; considers stochastic and optimization aspects of congestion control in Internet data transfers. * Useful as a supplementary text & reference for grad students with some background in control theory; also suitable for researchers.

"This book shares theoretical and applied pedagogical models and systems used in math e-learning including the use of computer supported collaborative learning, which is common to most e-learning practices"--Provided by publisher.

"A Course on the Web Graph provides a comprehensive introduction to state-of-the-art research on the applications of graph theory to real-world networks such as the web graph. It is the first mathematically rigorous textbook discussing both models of the web graph and algorithms for searching the web. After introducing key tools required for the study of web graph mathematics, an overview is given of the most widely studied models for the web graph. A discussion of popular web search algorithms, e.g. PageRank, is followed by additional topics, such as applications of infinite graph theory to the web graph, spectral properties of power law graphs, domination in the web graph, and the spread of viruses in networks. The book is based on a graduate course taught at the AARMS 2006 Summer School at Dalhousie University. As such it is self-contained and includes over 100 exercises. The reader of the book will gain a working knowledge of current research in graph theory and its modern applications. In addition, the reader will learn first-hand about models of the web, and the mathematics underlying modern search engines."--Publisher's description.

Mathematics teachers and school library media specialists will find this book a valuable resource for using the Web to promote critical thinking in the high school mathematics classroom. It is filled with instructional strategies and an expansive set of activities that cover a broad array of mathematics topics spanning from prealgebra through calculus. Teachers using the questions and activities in this book will help their students meet the standards set forth by the National Council for Teachers of Mathematics. Various types of mathematics related sources on the Internet are outlined within this book, including data and simulations related to real world situations such as saving funds and computing interest earned for college, purchasing a home, or decoding train and plane schedules. The author develops a framework for critical thinking in mathematics and helps teachers create a supportive classroom environment. Each activity highlights a web source, the mathematics topics involved, the appropriate grade levels of study, possible student investigations, and related web sources for continued exploration, promoting a student-centered inquiry.

From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography

This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this. Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs. The book contains over 360 exercises, including 230 with solutions and 130 more involved problems suitable for homework. There are also Investigate! activities throughout the text to support active, inquiry based learning. While there are many fine discrete math textbooks available, this text has the following advantages: It is written to be used in an inquiry rich course. It is written to be used in a course for future math teachers. It is open source, with low cost print editions and free electronic editions.