List of Standard Counting Problems
|
|
- Nickolas Nicholson
- 7 years ago
- Views:
Transcription
1 List of Standard Counting Problems Advanced Problem Solving This list is stolen from Daniel Marcus Combinatorics a Problem Oriented Approach (MAA, 998). This is not a mathematical standard list, just a nice orderly way to keep track of basics.. Find the number of strings of length k using n different characters (no restrictions on character use). n k. Each of k slots has n different choices, so multiplication principle says to multiply n with itself k times. 2. Find the number of strings of length k using n different character, no character used more than once. (Permutations of n objects taken k at a time.) n(n )(n 2) (n k + ) = n! (n k)!. We also called this the falling factorial, denoted n k. There are n choices for the first letter, n for the second, and so forth. Or, arrange all n letters (n! ways) but disregard the unused n k of them (so divide by (n k)!). 3. Find the number of combinations (order doesn t matter) of length k consisting of different characters from an alphabet of n characters. (Combinations of n objects taken k at a time.) n! k!(n k)! = n k. Take the permutations from #2 and divide by k! because we don t care about order in the first k elements. 4. Find the number of bit strings that contain a 0 s and b s but do not contain any two consecutive s. a + b. Take a row of a 0 s, and insert the s in the a + spaces between, before, and after them. In other words, take and replace a choice of the dots with s. 5. Find the number of combinations of length k from a set of n objects, allowing repetitions, but using all elements at least once. k n. Make a string of k blanks: and in the k spaces between them place commas in n of those spaces. The first comma separates between A and B, the
2 second between B and C, and so forth. Because the commas are between the spaces, there is at least one of each letter. 6. Find the number of combinations of length k form a set of n objects, allowing repititions, with no other requirements. n + k n. This is the stars and bars problem. Make a row of k stars, with n bars anywhere in, before, or after the row. Replace all stars before the first bar (if any!) with A, between the first and second (if any) with B and so on. There are k + n total stars and bars, of which n are bars. OR make a combination of k + n characters with at least one of each letter as in problem 5, then delete the first occurrence of each letter. 7. Find the number of 0-dominated strings of a 0 s and b s. a + b a a + b a +. (As long as b a.) How many such strings are not 0- dominated? Take a string with a + 0 s and b s. There are a + b a + of these. Find the shortest initial fragment where 0 s outnumber s (since there are a + > a b > b 0 s and only b s, there must be such a fragment). Flip each bit of this string. There must be exactly one more 0 than in this fragment, so this produces a string with a 0 s and b s, and this string is not 0-dominated (because in this initial fragment there are more s than 0 s). Because any non-0-dominated string has an initial fragment with more s than 0 s, if you find the shortest such initial fragment and flip each bit, you get a string with a + 0 s and b s, so this relationship between non-dominated strings with a 0 s and b s and arbitrary strings with one more 0 and one fewer is a one-to-one correspondence. So we know how many nondominated strings there are, we simply subtract this from the total number of strings with a 0 s a + b and b s, a. Side note: to find the total number of 0-dominated strings of total length n, we add the numbers of such strings for all possible b. The smallest possible b is n / 2 (ceiling, or least integer greater than or equal to the number). So we get: n n / 2 n n / n n / 2 + n n / n n n n + n n 0 = n n / Find the number of distributions of k distinct balls into n distinct boxes. Equivalently, find the number of functions from a set of k objects to a set of n objects. n k. This is really the same as problem. Number the balls from to k, and label the boxes with the letters of the alphabet. The box into which ball goes comes first in the string, the box into which ball 2 goes comes second, and so forth.
3 9. Find the number of distributions of k identical balls into n distinct boxes. n + k n. This is the same as problem #6. Since the balls are identical, order no longer matters, so we are taking combinations of k letters from an n letter alphabet, where there are no restrictions on how many of each letter we may take. 0. Find the number of distributions of k identical balls into n distinct boxes, if no box is allowed to be empty. k n. This is the same as problem #5. Notice that the binomial coefficient is zero if the top number is smaller than the bottom. Start by placing one ball into each box. That leaves you with k n balls to place as in problem #9, so replace k by k n in that answer.. Find the number of distinct balls into distinct boxes, where box must contain b balls, box 2 must contain b 2 balls, etc. (b + b + + b )! 2 n = b + b + + b 2 n b! b 2! b n! b, b 2,, b n. This is the multinomial coefficient. It can be found by multiplying the binomial coefficient for choosing b of the total balls to put into the first box, then choosing b 2 of the remaining balls to put into the second box, and so forth. Many of the factorials in the binomial coefficients cancel, leaving the expression above. Side note: multinomial coefficients are used to expand multinomials (like (x + y + z) n ) with any number of terms added together inside the parentheses just like binomials are used to expand binomials. 2. Find the number of rearrangements of the letters in a given word (including not changing the order at all). same multinomial coefficient as in, if there are b of the first letter, b 2 of the second, and so forth. Basically, take all possible rearrangements of all the letters, (b + + b n )!, and divide by each b i! because we can t distinguish the identical letters being rearranged. 3. Find the number of distributions of k distinct balls into n boxes with no empty boxes. 4. Find the number of words of length k from n letters, if each letter must be used at least once in each word. These two are equivalent (the numbers on the balls tell the position of the letter on the box within the word, as in comparing problems #8 and #). The answer is to add up all possibilities in problem #2 where each b i is at least one and the b s add to k. The notation we will use for this is T(k, n):
4 T(k, n) = b,b 2,,b n b +b 2 + +b n =k k b, b 2,, b n. The T numbers can be found in a triangle somewhat like Pascal s triangle, except instead of merely adding the two numbers above you also multiply the sum by the position within the row: T(k, n) = n(t(k, n ) + T(k, n)). The triangle looks like this: The explanation of this formula is to look at the first character of a string of k characters. Let s say it s an A. If it is the only A in the string the rest of the characters form a length k string with n characters each used at least once, of which there are T(k, n ). If it is not the only A, the rest of the characters form a length k string using all letters at least once, of which there are T(k, n). Adding these two gives all the possible strings of k letters using each at least once that start with A. There are, of course, n different choices to start the string, so we multiply by n to obtain the final answer. 5. Find the number of ways to arrange k distinct flags on n flagpoles. (n + k )! n(n + )(n + 2) (n + k ) =. We also called this the rising factorial n k. (n )! If there are a flags on a pole, there are a + spaces to put the next flag on this pole. So every time we place a flag on a pole we increase the total number of possible spaces to place the next flag by one. Start with n empty poles, so that each has one space. Now add flags one at a time, and we have n choices for the place to put the first flag, n + choices for the second, and so on. 6. Find the number of ways to arrange k identical flags on n flagpoles. n + k n. This is the same as problem #9. Or, take problem #5 and divide by k! because we can no longer tell the flags apart. A partition is a distribution where you can t tell groups of the same size apart. That is, it is a distribution of k distinct balls into n identical boxes. Order within a box and order of boxes with same numbers of elements doesn t matter. For examples, there are 5 partitions of ABCDEF into three groups of two: AB CD EF AC BD EF AD BC EF AE BC DF AF BC DE AB CE DF AC BE DF AD BE CF AE BD CF AF BD CE AB CF DE AC BF DE AD BF CE AE BF CD AF BE CD
5 6 Notice that 2,2,2 = 6! = 90 but that the six orders of the boxes don t matter, so we should 2!2!2! divide by 6. This exemplifies the general answer to: 7. Find the number of partitions of k distinct objects into r groups of size, r 2 groups of size 2,, r n groups of size n. k,,...,,2,2,...2,,...,n,n,...,n r r 2 r n. Note that we must have r + 2 r n r n = k of r!r 2! r n! course. This is determined by figuring out the distributions of the k objects into the given number of boxes of given sizes (which is given by the multinomial coefficient) and then dividing by the rearrangement of each number of boxes of the same size that can t be distinguished from each other. 8. Find the number of partitions of k objects into a specified number n of nonempty subsets, where we don t specify the sizes of the subsets. T (k,n) = k. Recall the T numbers tell the number of ways of placing k distinct balls n! n into n distinct boxes, with no box empty. Since we can no longer tell the boxes apart, we divide by n!. These are also called Stirling numbers of the second kind or Stirling subset numbers and are also notated S(k, n). Here is a table: The rule that generates this table is: S(k, n) = S(k, n ) + ns(k, n). This can be proven using the T numbers, but has a direct proof as follows. If object k is in a class all by itself, then the other k objects can be arranged into n classes in S(k, n ) ways. But if object k goes into an already established class, there are n choices for this class in each of the S(k, n) partitions of the other k objects into n classes. Finally, let s discuss indistinct balls in indistinct boxes. 9. How many ways are there to place k identical balls into n identical boxes with no box empty? 20. How many ways are there to write k as the sum of n nonzero numbers?
6 These questions are clearly identical. There is no nice formula for the answer, but let s see if we can find a way to figure them out. Define this number to be P(k, n), partitions of k into n parts. We start by noticing the relationship between partitions of k and of k. If you take away one ball, under what conditions do you keep the same number of boxes? Well, only if the box from which you take the ball has another ball in it. That is, let s say we take away one ball from (one of) the box(es) with the fewest balls. We could be left with k balls in n boxes if the ball we took was the only ball in that box, or else all boxes had at least two balls to start with. That means that P(k, n) = P(k, n ) + P 2 (k, n), where P 2 means partitions where each box has at least two balls in it. But it is fairly easy to see that P 2 (k, n) = P(k n, n), simply by taking one ball out of each of the n boxes. So now we have a recursion: P(k, n) = P(k, n ) + P(k n, n). Of course, P(a, b) must be zero if b > a since we have to have at least one ball in each box. That allows us to start the following table: Some things to note: P(n, ) = P(n, n) = P(n, n ) = while P(n, 2) = n / 2.
Chapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way
Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)
More information4. Binomial Expansions
4. Binomial Expansions 4.. Pascal's Triangle The expansion of (a + x) 2 is (a + x) 2 = a 2 + 2ax + x 2 Hence, (a + x) 3 = (a + x)(a + x) 2 = (a + x)(a 2 + 2ax + x 2 ) = a 3 + ( + 2)a 2 x + (2 + )ax 2 +
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationBaltic Way 1995. Västerås (Sweden), November 12, 1995. Problems and solutions
Baltic Way 995 Västerås (Sweden), November, 995 Problems and solutions. Find all triples (x, y, z) of positive integers satisfying the system of equations { x = (y + z) x 6 = y 6 + z 6 + 3(y + z ). Solution.
More informationPermutation Groups. Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003
Permutation Groups Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles April 2, 2003 Abstract This paper describes permutations (rearrangements of objects): how to combine them, and how
More informationPigeonhole Principle Solutions
Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such
More information4. How many integers between 2004 and 4002 are perfect squares?
5 is 0% of what number? What is the value of + 3 4 + 99 00? (alternating signs) 3 A frog is at the bottom of a well 0 feet deep It climbs up 3 feet every day, but slides back feet each night If it started
More informationCombinatorics. Chapter 1. 1.1 Factorials
Chapter 1 Combinatorics Copyright 2009 by David Morin, morin@physics.harvard.edu (Version 4, August 30, 2009) This file contains the first three chapters (plus some appendices) of a potential book on Probability
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationC H A P T E R Regular Expressions regular expression
7 CHAPTER Regular Expressions Most programmers and other power-users of computer systems have used tools that match text patterns. You may have used a Web search engine with a pattern like travel cancun
More information( ) FACTORING. x In this polynomial the only variable in common to all is x.
FACTORING Factoring is similar to breaking up a number into its multiples. For example, 10=5*. The multiples are 5 and. In a polynomial it is the same way, however, the procedure is somewhat more complicated
More information6.1 The Greatest Common Factor; Factoring by Grouping
386 CHAPTER 6 Factoring and Applications 6.1 The Greatest Common Factor; Factoring by Grouping OBJECTIVES 1 Find the greatest common factor of a list of terms. 2 Factor out the greatest common factor.
More informationSYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison
SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections
More informationAlgebra Cheat Sheets
Sheets Algebra Cheat Sheets provide you with a tool for teaching your students note-taking, problem-solving, and organizational skills in the context of algebra lessons. These sheets teach the concepts
More informationSECTION 10-5 Multiplication Principle, Permutations, and Combinations
10-5 Multiplication Principle, Permutations, and Combinations 761 54. Can you guess what the next two rows in Pascal s triangle, shown at right, are? Compare the numbers in the triangle with the binomial
More informationMath Workshop October 2010 Fractions and Repeating Decimals
Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationA Little Set Theory (Never Hurt Anybody)
A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013 1 Introduction The fundamental ideas of set theory and the algebra
More informationS on n elements. A good way to think about permutations is the following. Consider the A = 1,2,3, 4 whose elements we permute with the P =
Section 6. 1 Section 6. Groups of Permutations: : The Symmetric Group Purpose of Section: To introduce the idea of a permutation and show how the set of all permutations of a set of n elements, equipped
More informationSolution to Homework 2
Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if
More informationSection 4.1 Rules of Exponents
Section 4.1 Rules of Exponents THE MEANING OF THE EXPONENT The exponent is an abbreviation for repeated multiplication. The repeated number is called a factor. x n means n factors of x. The exponent tells
More informationCONTENTS 1. Peter Kahn. Spring 2007
CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................
More informationPreliminary Mathematics
Preliminary Mathematics The purpose of this document is to provide you with a refresher over some topics that will be essential for what we do in this class. We will begin with fractions, decimals, and
More informationCombinatorial Proofs
Combinatorial Proofs Two Counting Principles Some proofs concerning finite sets involve counting the number of elements of the sets, so we will look at the basics of counting. Addition Principle: If A
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationIntroduction. The Quine-McCluskey Method Handout 5 January 21, 2016. CSEE E6861y Prof. Steven Nowick
CSEE E6861y Prof. Steven Nowick The Quine-McCluskey Method Handout 5 January 21, 2016 Introduction The Quine-McCluskey method is an exact algorithm which finds a minimum-cost sum-of-products implementation
More informationFactoring and Applications
Factoring and Applications What is a factor? The Greatest Common Factor (GCF) To factor a number means to write it as a product (multiplication). Therefore, in the problem 48 3, 4 and 8 are called the
More informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
More information1(a). How many ways are there to rearrange the letters in the word COMPUTER?
CS 280 Solution Guide Homework 5 by Tze Kiat Tan 1(a). How many ways are there to rearrange the letters in the word COMPUTER? There are 8 distinct letters in the word COMPUTER. Therefore, the number of
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationGraph Theory Problems and Solutions
raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationFormulas & Functions in Microsoft Excel
Formulas & Functions in Microsoft Excel Theresa A Scott, MS Biostatistician II Department of Biostatistics Vanderbilt University theresa.scott@vanderbilt.edu Table of Contents 1 Introduction 1 1.1 Using
More informationRadicals - Multiply and Divide Radicals
8. Radicals - Multiply and Divide Radicals Objective: Multiply and divide radicals using the product and quotient rules of radicals. Multiplying radicals is very simple if the index on all the radicals
More informationCMPSCI 250: Introduction to Computation. Lecture #19: Regular Expressions and Their Languages David Mix Barrington 11 April 2013
CMPSCI 250: Introduction to Computation Lecture #19: Regular Expressions and Their Languages David Mix Barrington 11 April 2013 Regular Expressions and Their Languages Alphabets, Strings and Languages
More informationCatalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.
7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More information1.2 Solving a System of Linear Equations
1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationVisa Smart Debit/Credit Certificate Authority Public Keys
CHIP AND NEW TECHNOLOGIES Visa Smart Debit/Credit Certificate Authority Public Keys Overview The EMV standard calls for the use of Public Key technology for offline authentication, for aspects of online
More informationMath 25 Activity 6: Factoring Advanced
Instructor! Math 25 Activity 6: Factoring Advanced Last week we looked at greatest common factors and the basics of factoring out the GCF. In this second activity, we will discuss factoring more difficult
More informationCS103B Handout 17 Winter 2007 February 26, 2007 Languages and Regular Expressions
CS103B Handout 17 Winter 2007 February 26, 2007 Languages and Regular Expressions Theory of Formal Languages In the English language, we distinguish between three different identities: letter, word, sentence.
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationWe can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b
In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should
More informationTo Evaluate an Algebraic Expression
1.5 Evaluating Algebraic Expressions 1.5 OBJECTIVES 1. Evaluate algebraic expressions given any signed number value for the variables 2. Use a calculator to evaluate algebraic expressions 3. Find the sum
More informationThis unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.
Algebra I Overview View unit yearlong overview here Many of the concepts presented in Algebra I are progressions of concepts that were introduced in grades 6 through 8. The content presented in this course
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation
More informationHow To Understand And Solve A Linear Programming Problem
At the end of the lesson, you should be able to: Chapter 2: Systems of Linear Equations and Matrices: 2.1: Solutions of Linear Systems by the Echelon Method Define linear systems, unique solution, inconsistent,
More informationVISUAL ALGEBRA FOR COLLEGE STUDENTS. Laurie J. Burton Western Oregon University
VISUAL ALGEBRA FOR COLLEGE STUDENTS Laurie J. Burton Western Oregon University VISUAL ALGEBRA FOR COLLEGE STUDENTS TABLE OF CONTENTS Welcome and Introduction 1 Chapter 1: INTEGERS AND INTEGER OPERATIONS
More informationINTERSECTION MATH And more! James Tanton
INTERSECTION MATH And more! James Tanton www.jamestanton.com The following represents a sample activity based on the December 2006 newsletter of the St. Mark s Institute of Mathematics (www.stmarksschool.org/math).
More information26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
More informationReading 13 : Finite State Automata and Regular Expressions
CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More information6.3 Conditional Probability and Independence
222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted
More informationDiscrete Mathematics
Discrete Mathematics Lecture Notes, Yale University, Spring 1999 L. Lovász and K. Vesztergombi Parts of these lecture notes are based on L. Lovász J. Pelikán K. Vesztergombi: Kombinatorika (Tankönyvkiadó,
More information0.8 Rational Expressions and Equations
96 Prerequisites 0.8 Rational Expressions and Equations We now turn our attention to rational expressions - that is, algebraic fractions - and equations which contain them. The reader is encouraged to
More informationLemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.
Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a
More informationSUNY ECC. ACCUPLACER Preparation Workshop. Algebra Skills
SUNY ECC ACCUPLACER Preparation Workshop Algebra Skills Gail A. Butler Ph.D. Evaluating Algebraic Epressions Substitute the value (#) in place of the letter (variable). Follow order of operations!!! E)
More informationSPECIAL PRODUCTS AND FACTORS
CHAPTER 442 11 CHAPTER TABLE OF CONTENTS 11-1 Factors and Factoring 11-2 Common Monomial Factors 11-3 The Square of a Monomial 11-4 Multiplying the Sum and the Difference of Two Terms 11-5 Factoring the
More informationFormulas & Functions in Microsoft Excel
Formulas & Functions in Microsoft Excel Theresa A Scott, MS Biostatistician III Department of Biostatistics Vanderbilt University theresa.scott@vanderbilt.edu Table of Contents 1 Introduction 1 1.1 Using
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationBasic Excel Handbook
2 5 2 7 1 1 0 4 3 9 8 1 Basic Excel Handbook Version 3.6 May 6, 2008 Contents Contents... 1 Part I: Background Information...3 About This Handbook... 4 Excel Terminology... 5 Excel Terminology (cont.)...
More informationStanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions
Stanford Math Circle: Sunday, May 9, 00 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in
More informationHow To Solve Factoring Problems
05-W4801-AM1.qxd 8/19/08 8:45 PM Page 241 Factoring, Solving Equations, and Problem Solving 5 5.1 Factoring by Using the Distributive Property 5.2 Factoring the Difference of Two Squares 5.3 Factoring
More informationA positive exponent means repeated multiplication. A negative exponent means the opposite of repeated multiplication, which is repeated
Eponents Dealing with positive and negative eponents and simplifying epressions dealing with them is simply a matter of remembering what the definition of an eponent is. division. A positive eponent means
More informationMathematical Conventions. for the Quantitative Reasoning Measure of the GRE revised General Test
Mathematical Conventions for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview The mathematical symbols and terminology used in the Quantitative Reasoning measure
More informationMathematical Induction. Lecture 10-11
Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
More informationLecture 1. Basic Concepts of Set Theory, Functions and Relations
September 7, 2005 p. 1 Lecture 1. Basic Concepts of Set Theory, Functions and Relations 0. Preliminaries...1 1. Basic Concepts of Set Theory...1 1.1. Sets and elements...1 1.2. Specification of sets...2
More informationBasics of Counting. The product rule. Product rule example. 22C:19, Chapter 6 Hantao Zhang. Sample question. Total is 18 * 325 = 5850
Basics of Counting 22C:19, Chapter 6 Hantao Zhang 1 The product rule Also called the multiplication rule If there are n 1 ways to do task 1, and n 2 ways to do task 2 Then there are n 1 n 2 ways to do
More informationFractions to decimals
Worksheet.4 Fractions and Decimals Section Fractions to decimals The most common method of converting fractions to decimals is to use a calculator. A fraction represents a division so is another way of
More informationElements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationNetwork Flow I. Lecture 16. 16.1 Overview. 16.2 The Network Flow Problem
Lecture 6 Network Flow I 6. Overview In these next two lectures we are going to talk about an important algorithmic problem called the Network Flow Problem. Network flow is important because it can be
More informationSection 6.4: Counting Subsets of a Set: Combinations
Section 6.4: Counting Subsets of a Set: Combinations In section 6.2, we learnt how to count the number of r-permutations from an n-element set (recall that an r-permutation is an ordered selection of r
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationMATH 90 CHAPTER 1 Name:.
MATH 90 CHAPTER 1 Name:. 1.1 Introduction to Algebra Need To Know What are Algebraic Expressions? Translating Expressions Equations What is Algebra? They say the only thing that stays the same is change.
More information6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, 2010. Class 4 Nancy Lynch
6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, 2010 Class 4 Nancy Lynch Today Two more models of computation: Nondeterministic Finite Automata (NFAs)
More informationElements of Abstract Group Theory
Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for
More informationParallax Serial LCD 2 rows x 16 characters Non-backlit (#27976) 2 rows x 16 characters Backlit (#27977) 4 rows x 20 characters Backlit (#27979)
599 Menlo Drive, Suite 100 Rocklin, California 95765, USA Office: (916) 624-8333 Fax: (916) 624-8003 General: info@parallax.com Technical: support@parallax.com Web Site: www.parallax.com Educational: www.stampsinclass.com
More informationSection 6-5 Sample Spaces and Probability
492 6 SEQUENCES, SERIES, AND PROBABILITY 52. How many committees of 4 people are possible from a group of 9 people if (A) There are no restrictions? (B) Both Juan and Mary must be on the committee? (C)
More informationMaths class 11 Chapter 7. Permutations and Combinations
1 P a g e Maths class 11 Chapter 7. Permutations and Combinations Fundamental Principles of Counting 1. Multiplication Principle If first operation can be performed in m ways and then a second operation
More information6. Vectors. 1 2009-2016 Scott Surgent (surgent@asu.edu)
6. Vectors For purposes of applications in calculus and physics, a vector has both a direction and a magnitude (length), and is usually represented as an arrow. The start of the arrow is the vector s foot,
More informationSection IV.1: Recursive Algorithms and Recursion Trees
Section IV.1: Recursive Algorithms and Recursion Trees Definition IV.1.1: A recursive algorithm is an algorithm that solves a problem by (1) reducing it to an instance of the same problem with smaller
More information2014 Chapter Competition Solutions
2014 Chapter Competition Solutions Are you wondering how we could have possibly thought that a Mathlete would be able to answer a particular Sprint Round problem without a calculator? Are you wondering
More informationSolving Equations by the Multiplication Property
2.2 Solving Equations by the Multiplication Property 2.2 OBJECTIVES 1. Determine whether a given number is a solution for an equation 2. Use the multiplication property to solve equations. Find the mean
More informationMath 202-0 Quizzes Winter 2009
Quiz : Basic Probability Ten Scrabble tiles are placed in a bag Four of the tiles have the letter printed on them, and there are two tiles each with the letters B, C and D on them (a) Suppose one tile
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 7, due Wedneday, March 14 Happy Pi Day! (If any errors are spotted, please email them to morrison at math dot berkeley dot edu..5.10 A croissant
More informationLesson Plans for (9 th Grade Main Lesson) Possibility & Probability (including Permutations and Combinations)
Lesson Plans for (9 th Grade Main Lesson) Possibility & Probability (including Permutations and Combinations) Note: At my school, there is only room for one math main lesson block in ninth grade. Therefore,
More informationCryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur
Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Module No. # 01 Lecture No. # 05 Classic Cryptosystems (Refer Slide Time: 00:42)
More informationThe Deadly Sins of Algebra
The Deadly Sins of Algebra There are some algebraic misconceptions that are so damaging to your quantitative and formal reasoning ability, you might as well be said not to have any such reasoning ability.
More informationBoolean Algebra Part 1
Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems
More informationChapter 6: Episode discovery process
Chapter 6: Episode discovery process Algorithmic Methods of Data Mining, Fall 2005, Chapter 6: Episode discovery process 1 6. Episode discovery process The knowledge discovery process KDD process of analyzing
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
More informationCSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis. Linda Shapiro Winter 2015
CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis Linda Shapiro Today Registration should be done. Homework 1 due 11:59 pm next Wednesday, January 14 Review math essential
More informationDiscrete mathematics
Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/01, Winter term 2015/2016 About this file This file is meant to be a guideline for the lecturer. Many
More information1 Symmetries of regular polyhedra
1230, notes 5 1 Symmetries of regular polyhedra Symmetry groups Recall: Group axioms: Suppose that (G, ) is a group and a, b, c are elements of G. Then (i) a b G (ii) (a b) c = a (b c) (iii) There is an
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationDeterminants can be used to solve a linear system of equations using Cramer s Rule.
2.6.2 Cramer s Rule Determinants can be used to solve a linear system of equations using Cramer s Rule. Cramer s Rule for Two Equations in Two Variables Given the system This system has the unique solution
More information