The book "Introductory Business Statistics" by Thomas K. Tiemann explores the basic ideas behind statistics, such as populations, samples, the difference between data and information, and most importantly sampling distributions. The author covers topics including descriptive statistics and frequency distributions, normal and t-distributions, hypothesis testing, t-tests, f-tests, analysis of variance, non-parametric tests, and regression basics. Using real-world examples throughout the text, the author hopes to help students understand how statistics works, not just how to "get the right number."
Contributors: Keller and Trotter
Publisher: Mitchel T. Keller, William T. Trotter
Applied Combinatorics is an open-source textbook for a course covering the fundamental enumeration techniques (permutations, combinations, subsets, pigeon hole principle), recursion and mathematical induction, more advanced enumeration techniques (inclusion-exclusion, generating functions, recurrence relations, Polyá theory), discrete structures (graphs, digraphs, posets, interval orders), and discrete optimization (minimum weight spanning trees, shortest paths, network flows). There are also chapters introducing discrete probability, Ramsey theory, combinatorial applications of network flows, and a few other nuggets of discrete mathematics.
Publisher: OpenStax CNX
This is a "first course" in the sense that it presumes no previous course in probability. The mathematical prerequisites are ordinary calculus and the elements of matrix algebra. A few standard series and integrals are used, and double integrals are evaluated as iterated integrals. The reader who can evaluate simple integrals can learn quickly from the examples how to deal with the iterated integrals used in the theory of expectation and conditional expectation. Appendix B provides a convenient compendium of mathematical facts used frequently in this work. And the symbolic toolbox, implementing MAPLE, may be used to evaluate integrals, if desired.
Contributors: Lafferriere, Lafferriere, and Nguyen
Publisher: Portland State University Library
Our goal with this textbook is to provide students with a strong foundation in mathematical analysis. Such a foundation is crucial for future study of deeper topics of analysis. Students should be familiar with most of the concepts presented here after completing the calculus sequence. However, these concepts will be reinforced through rigorous proofs.
Contributors: Illowsky, Dean, and Chiappetta
Introductory Statistics follows the scope and sequence of a one-semester, introduction to statistics course and is geared toward students majoring in fields other than math or engineering. This text assumes students have been exposed to intermediate algebra, and it focuses on the applications of statistical knowledge rather than the theory behind it. The foundation of this textbook is Collaborative Statistics, by Barbara Illowsky and Susan Dean, which has been widely adopted. Introductory Statistics includes innovations in art, terminology, and practical applications, all with a goal of increasing relevance and accessibility for students. We strove to make the discipline meaningful and memorable, so that students can draw a working knowledge from it that will enrich their future studies and help them make sense of the world around them. The text also includes Collaborative Exercises, integration with TI-83,83+,84+ Calculators, technology integration problems, and statistics labs.
Publisher: A.T. Still University
This is a text for a two-term course in introductory real analysis for junior or senior mathematics majors and science students with a serious interest in mathematics. Prospective educators or mathematically gifted high school students can also benefit from the mathematical maturity that can be gained from an introductory real analysis course.
Publisher: Kenneth P. Bogart
This book is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as “counting.” The book consists almost entirely of problems. Some of the problems are designed to lead you to think about a concept, others are designed to help you figure out a concept and state a theorem about it, while still others ask you to prove the theorem. Other problems give you a chance to use a theorem you have proved. From time to time there is a discussion that pulls together some of the things you have learned or introduces a new idea for you to work with. Many of the problems are designed to build up your intuition for how combinatorial mathematics works. There are problems that some people will solve quickly, and there are problems that will take days of thought for everyone. Probably the best way to use this book is to work on a problem until you feel you are not making progress and then go on to the next one. Think about the problem you couldn't get as you do other things. The next chance you get, discuss the problem you are stymied on with other members of the class. Often you will all feel you've hit dead ends, but when you begin comparing notes and listening carefully to each other, you will see more than one approach to the problem and be able to make some progress. In fact, after comparing notes you may realize that there is more than one way to interpret the problem. In this case your first step should be to think together about what the problem is actually asking you to do. You may have learned in school that for every problem you are given, there is a method that has already been taught to you, and you are supposed to figure out which method applies and apply it. That is not the case here. Based on some simplified examples, you will discover the method for yourself. Later on, you may recognize a pattern that suggests you should try to use this method again.
Publisher: Cambridge University Press
All of the mathematics required beyond basic calculus is developed “from scratch.” Moreover, the book generally alternates between “theory” and “applications”: one or two chapters on a particular set of purely mathematical concepts are followed by one or two chapters on algorithms and applications; the mathematics provides the theoretical underpinnings for the applications, while the applications both motivate and illustrate the mathematics. Of course, this dichotomy between theory and applications is not perfectly maintained: the chapters that focus mainly on applications include the development of some of the mathematics that is specific to a particular application, and very occasionally, some of the chapters that focus mainly on mathematics include a discussion of related algorithmic ideas as well.
Contributors: Collingwood, Prince, and Conroy
Publisher: A.T. Still University
Prior to 1990, the performance of a student in precalculus at the University of Washington was not a predictor of success in calculus. For this reason, the mathematics department set out to create a new course with a specific set of goals in mind:
Contributors: Doerr and Levasseur
Publisher: Alan Doerr & Kenneth Levasseur
In writing this book, care was taken to use language and examples that gradually wean students from a simpleminded mechanical approach andmove them toward mathematical maturity. We also recognize that many students who hesitate to ask for help from an instructor need a readable text, and we have tried to anticipate the questions that go unasked.