h Problem Solver is an insightful and essential study and solution guide chock-full of clear, concise problem-solving gems. All your questions can be found in one convenient source from one of the most trusted names in reference solution guides. More useful, more practical, and more informative, these study aids are the best review books and textbook companions available. Nothing remotely as comprehensive or as helpful exists in their subject anywhere. Perfect for undergraduate and graduate studies. Here in this highly useful reference is the finest overview of finite and discrete math currently available, with hundreds of finite and discrete math problems that cover everything from graph theory and statistics to probability and Boolean algebra. Each problem is clearly solved with step-by-step detailed solutions. DETAILS- The PROBLEM SOLVERS are unique - the ultimate in study guides. - They are ideal for helping students cope with the toughest subjects. - They greatly simplify study and learning tasks. - They enable students to come to grips with difficult problems by showing them the way, step-by-step, toward solving problems. As a result, they save hours of frustration and time spent on groping for answers and understanding. - They cover material ranging from the elementary to the advanced in each subject. - They work exceptionally well with any text in its field. - PROBLEM SOLVERS are available in 41 subjects. - Each PROBLEM SOLVER is prepared by supremely knowledgeable experts. - Most are over 1000 pages. - PROBLEM SOLVERS are not meant to be read cover to cover. They offer whatever may be needed at a given time. An excellent index helps to locate specific problems rapidly. TABLE OF CONTENTSIntroductionChapter 1: LogicStatements, Negations, Conjunctions, and DisjunctionsTruth Table and Proposition CalculusConditional and Biconditional StatementsMathematical InductionChapter 2: Set TheorySets and SubsetsSet OperationsVenn DiagramCartesian ProductApplicationsChapter 3: RelationsRelations and GraphsInverse Relations and Composition of RelationsProperties of RelationsEquivalence RelationsChapter 4: FunctionsFunctions and GraphsSurjective, Injective, and Bijective FunctionsChapter 5: Vectors and MatricesVectorsMatrix ArithmeticThe Inverse and Rank of a MatrixDeterminantsMatrices and Systems of Equations, Cramer's RuleSpecial Kinds of MatricesChapter 6: Graph TheoryGraphs and Directed GraphsMatrices and GraphsIsomorphic and Homeomorphic GraphsPlanar Graphs and ColorationsTreesShortest Path(s)Maximum FlowChapter 7: Counting and Binomial TheoremFactorial NotationCounting PrinciplesPermutationsCombinationsThe Binomial TheoremChapter 8: ProbabilityProbabilityConditional Probability and Bayes' TheoremChapter 9: StatisticsDescriptive StatisticsProbability DistributionsThe Binomial and Joint DistributionsFunctions of Random VariablesExpected ValueMoment Generating FunctionSpecial Discrete DistributionsNormal DistributionsSpecial Continuous DistributionsSampling TheoryConfidence IntervalsPoint EstimationHypothesis TestingRegression and Correlation AnalysisNon-Parametric MethodsChi-Square and Contingency TablesMiscellaneous ApplicationsChapter 10: Boolean AlgebraBoolean Algebra and Boolean FunctionsMinimizationSwitching CircuitsChapter 11: Linear Programming and the Theory of GamesSystems of Linear InequalitiesGeometric Solutions and Dual of Linear Programming ProblemsThe Simplex MethodLinear Programming - Advanced MethodsInteger ProgrammingThe Theory of GamesIndex WHAT THIS BOOK IS FOR Students have generally found finite and discrete math difficult subjects to understand and learn. Despite the publication of hundreds of textbooks in this field, each one intended to provide an improvement over previous textbooks, students of finite and discrete math continue to remain perplexed as a result of numerous subject areas that must be remembered and correlated when solving problems. Various interpretations of finite and discrete math terms also contribute to the difficulties of mastering the subject. In a study of finite and discrete math, REA found the following basic reasons underlying the inherent difficulties of finite and discrete math: No systematic rules of analysis were ever developed to follow in a step-by-step manner to solve typically encountered problems. This results from numerous different conditions and principles involved in a problem that leads to many possible different solution methods. To prescribe a set of rules for each of the possible variations would involve an enormous number of additional steps, making this task more burdensome than solving the problem directly due to the expectation of much trial and error. Current textbooks normally explain a given principle in a few pages written by a finite and discrete math professional who has insight into the subject matter not shared by others. These explanations are often written in an abstract manner that causes confusion as to the principle's use and application. Explanations then are often not sufficiently detailed or extensive enough to make the reader aware of the wide range of applications and different aspects of the principle being studied. The numerous possible variations of principles and their applications are usually not discussed, and it is left to the reader to discover this while doing exercises. Accordingly, the average student is expected to rediscover that which has long been established and practiced, but not always published or adequately explained. The examples typically following the explanation of a topic are too few in number and too simple to enab