Spring 2007 Math 510 HW5 Solutions


 Clementine Nelson
 1 years ago
 Views:
Transcription
1 Spring 00 Math 0 HW Solutions Section 6.. Find the number of integers between and 0,000 inclusive which are not divisible by, 6,, or 0. Solution. Let S = {,,..., 0000}. Set A = the set of numbers in S that are divisible by ; A = the set of numbers in S that are divisible by 6; A = the set of numbers in S that are divisible by ; A = the set of numbers in S that are divisible by 0. The numbers we are counting are exactly those numbers that are in S but not in any one of A, A, A, and A. We will use the inclusionexclusion principle. Note that S = 0000 and A = {n n 0000}. Thus A = 0000 = 00, A = 0000 = 666, 6 A = 0000 = 8, A = = 000. Note that A A consists of those numbers in S that are both multiples of and 6. Thus those numbers that multiples of the least common multiples of and 6 i.e.,. Hence A A = 0000 = 8, A A = =, A A = = 00, A A = 0000 = 8, A A = =, A A = =, A A A = = 9, A A A = = 66, A A A = =, A A A = =, A A A A = =. Thus that total number is = 9.. Determine the number of combinations of the multiset T = { a, b, c, d}. Solution. We use inclusionexclusion principle. Set T = { a, b, c, d}. Let A be the set of all combinations of T with at least a; A be the set of all combinations of T with at least b;
2 A be the set of all combinations of T with at least c; A be the set of all combinations of T with at least 6 d. Let S be the set of all combinations of T. Then the combinations of the multiset T is exactly those combinations of T that has at most a, b, c and d, i.e., the set Ā Ā Ā Ā. + We will use the inclusionexclusion principle. Note that S = = and the combinations in A can be achieved by first choosing a and the rest of the objects can be arbitrarily taken from the four types. Thus A = = 0, A = = 6, A = = 0, A = = 8. 6 Note that the combinations in A A can be obtained by first taking a and b. Then choose the remaining objects from the four types without any restrictions. Thus + + A A = = 0, A A = = 0, + + A A = =, A A = = 0, + + A A = = 0, A A = =. Any combinations in A A A have to have at least a, b, and c. That is impossible. So we have A A A = 0, A A A = 0, A A A = 0, A A A = 0. Finally, A A A A = 0 and the number of combinations of T is =. 6. A bakery sells chocolate, cinnamon, and plain doughnuts and at a particular time has 6 chocolate, 6 cinnamon, and plain. If a box contains doughnuts, how many different boxes of doughnuts are possible? Solution. We have the multiset T = {6 a, 6 b, c} here a, b, and c are chocolate, cinnamon, and plain doughnuts respectively. Then the number of different boxes of is exactly the number of combinations of the multiset T. Set T = { a, b, c}. Let S be the set of all + combinations of the T. Then S = =. Set A = the set of all combinations in S with at least a, A = the set of all combinations in S with at least b, A = the set of all combinations in S with at least c.
3 Then Ā Ā Ā is exactly the set of all combinations of T. Note that + + A = =, A = =, 8 + A = =, A 8 A = 0, + + A A = =, A A = =. Also one sees that A A A consists those boxes with with at least a, b, and c. That is impossible. Not by inclusion exclusion principle, we have Thus there 0 different boxes. Ā Ā Ā = = Determine the number of solutions of the equation x + x + x + x = 0 which satisfy x 6, 0 x, x 8, x 6. Solution. equation and Set y = x, y = x, y = x, y = x. Then y, y, y, y satisfies the y + y + y + y = 0 = 0 y, 0 y, 0 y, 0 y. Let S be the set of all solutions of the equation y + y + y + y = which satisfy 0 y, 0 + y, 0 y, 0 y. Then S = = 60. Let A be the set of all solutions in S with y 6, A be the set of all solutions in S with y 8, A be the set of all solutions in S with y, A be the set of all solutions in S with y. Then + A = = 0, A = = 6, A = = 6, A = = 6, A A = = 0, A A = = 0, A A = = 0, A A = =, A A = =, A A = = 0.
4 Note that the intersection of any three or four sets A, A, A and A will have not elements. Thus by inclusionexclusion principle, Ā Ā Ā = = 96. Thus the equation x + x + x + x = 0 has 96 solutions satisfying which satisfy x 6, 0 x, x 8, x 6.. Determine that number of permutations of {,,..., 8} in which no even integers are in their national positions. Solution. Let S be the set of all permutations of {,,..., 8}. Let A be the set of all permutations in S which has in it natural position; A be the set of all permutations in S which has in it natural position; A be the set of all permutations in S which has 6 in it natural position and A be the set of all permutations in S which has 8 in it natural position. Then A = A = A = A = 8!, A A = A A = A A = A A = A A = A A = 8!, A A A = A A A = A A A = A A A = 8!, A A A A = 8!. Then the set of permutations of {,,..., 8} in which no even integers are in their national positions is Ā Ā Ā Ā and the number of the elements is 8!! + 6 6!! +! = 0.. Determine the number of permutations of {,,..., 9} in which at least one odd integer is in its natural position. Solution. Let S be the set of all permutations of the set {,,..., 9}. Set A = the set of permutations in S such that is in its natural position; A = the set of permutations in S such that is in its natural position; A = the set of permutations in S such that is in its natural position; A = the set of permutations in S such that is in its natural position; A = the set of permutations in S such that 9 is in its natural position. Then the set of permutations of with at least one odd number in its natural position is exactly A A A A A. Note that A = A = A = A = A = 9!, A i A j = 9!, with distinct i, j, A i A j A k = 9! with distinct i, j, k, A i A j A k A l = 9! with distinct i, j, k, l, A i A j A k A l A n = 9! with distinct i, j, k, l, n. Then by the Corollary to the inclusion exclusion principle, A A A A A = 8!! + = 8. 6!! +!
5 Another way to solve this problem to use the logic: the contrary to the fact that at least one odd number is in its natural position is that no odd number is in its natural position. Thus the answer can obtained by subtracting the number of permutations with no odd number in its natural position, which can be computed in a similar way as in Prob. from the total number of all permutations 9!.. At a party, gentlemen check their hats. In how many ways can their hats be returned so that a No gentleman receives his own hat? b at least one of the gentleman receives his own hat? c at least two gentleman receives their own hats? Solution. a. This is D = 8. b.! D =! 8 = 86. c. Let A i be the set of all permutations of the set {,,..., n} having exactly i numbers in their own natural positions. Then A i = n i D n i. Then A 0 A is the set of all permutations n D n. with at most number in its natural position. Then A 0 A = A 0 + A = D n + Thus the answer to c is! D D 6 =.
Spring 2007 Math 510 Hints for practice problems
Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an chessboard There are doors between all adjacent cells A prisoner in one
More informationMathematical Foundations of Computer Science Lecture Outline
Mathematical Foundations of Computer Science Lecture Outline September 21, 2016 Example. How many 8letter strings can be constructed by using the 26 letters of the alphabet if each string contains 3,4,
More informationChapter 9. Systems of Linear Equations
Chapter 9. Systems of Linear Equations 9.1. Solve Systems of Linear Equations by Graphing KYOTE Standards: CR 21; CA 13 In this section we discuss how to solve systems of two linear equations in two variables
More informationMaths Workshop for Parents 2. Fractions and Algebra
Maths Workshop for Parents 2 Fractions and Algebra What is a fraction? A fraction is a part of a whole. There are two numbers to every fraction: 2 7 Numerator Denominator 2 7 This is a proper (or common)
More information5.2. Systems of linear equations and their solution sets
5.2. Systems of linear equations and their solution sets Solution sets of systems of equations as intersections of sets Any collection of two or more equations is called a system of equations. The solution
More informationUse the graph to determine whether each system is consistent or inconsistent and if it is independent or dependent.
Use the graph to determine whether each system is consistent or inconsistent and if it is independent or dependent. y = 2x 1 y = 2x + 3 The lines y = 2x 1 and y = 2x + 3 intersect at exactly one point
More informationNo Solution Equations Let s look at the following equation: 2 +3=2 +7
5.4 Solving Equations with Infinite or No Solutions So far we have looked at equations where there is exactly one solution. It is possible to have more than solution in other types of equations that are
More informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More informationSOLUTIONS FOR PROBLEM SET 2
SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such
More informationMath 117 Chapter 7 Sets and Probability
Math 117 Chapter 7 and Probability Flathead Valley Community College Page 1 of 15 1. A set is a welldefined collection of specific objects. Each item in the set is called an element or a member. Curly
More informationMath 215 HW #1 Solutions
Math 25 HW # Solutions. Problem.2.3. Describe the intersection of the three planes u+v+w+z = 6 and u+w+z = 4 and u + w = 2 (all in fourdimensional space). Is it a line or a point or an empty set? What
More informationMath 140a  HW 1 Solutions
Math 140a  HW 1 Solutions Problem 1 (WR Ch 1 #1). If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Given that r is rational, we can write r = a b for some
More informationSAT Mathematics. Numbers and Operations. John L. Lehet
SAT Mathematics Review Numbers and Operations John L. Lehet jlehet@mathmaverick.com www.mathmaverick.com Properties of Integers Arithmetic Word Problems Number Lines Squares and Square Roots Fractions
More information94 Counting Solutions for Chapter 3. Section 3.2
94 Counting 3.11 Solutions for Chapter 3 Section 3.2 1. Consider lists made from the letters T, H, E, O, R, Y, with repetition allowed. (a How many length4 lists are there? Answer: 6 6 6 6 = 1296. (b
More informationMATH 433 Applied Algebra Lecture 13: Examples of groups.
MATH 433 Applied Algebra Lecture 13: Examples of groups. Abstract groups Definition. A group is a set G, together with a binary operation, that satisfies the following axioms: (G1: closure) for all elements
More informationSolving and Graphing Inequalities
Algebra I Pd Basic Inequalities 3A What is the answer to the following questions? Solving and Graphing Inequalities We know 4 is greater than 3, so is 5, so is 6, so is 7 and 3.1 works also. So does 3.01
More informationNumber of Solutions to Simultaneous Equations
Worksheet 3.5 Simultaneous Equations Section 1 Number of Solutions to Simultaneous Equations In maths we are sometimes confronted with two equations in two variables and we want to find out which values
More informationThe InclusionExclusion Principle
Physics 116C Fall 2012 The InclusionExclusion Principle 1. The probability that at least one of two events happens Consider a discrete sample space Ω. We define an event A to be any subset of Ω, which
More informationHomework #1: Solutions to select problems
Homework #: Solutions to select problems Linear Algebra Summer 20 Math S200X (3) Corrin Clarkson June 6, 20 Section Exercise (42) Find a system of linear equations with three unknowns whose solutions are
More informationMath 115 Spring 2011 Written Homework 5 Solutions
. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence
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 informationBlack GCF and Equivalent Factorization
Black GCF and Equivalent Factorization Here is a set of mysteries that will help you sharpen your thinking skills. In each exercise, use the clues to discover the identity of the mystery fraction. 1. My
More informationIntroduction to Series and Sequences Math 121 Calculus II D Joyce, Spring 2013
Introduction to Series and Sequences Math Calculus II D Joyce, Spring 03 The goal. The main purpose of our study of series and sequences is to understand power series. A power series is like a polynomial
More informationEven Number: An integer n is said to be even if it has the form n = 2k for some integer k. That is, n is even if and only if n divisible by 2.
MATH 337 Proofs Dr. Neal, WKU This entire course requires you to write proper mathematical proofs. All proofs should be written elegantly in a formal mathematical style. Complete sentences of explanation
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 6: Counting
Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Colin Stirling Informatics Slides originally by Kousha Etessami Colin Stirling (Informatics) Discrete Mathematics (Chapter 6) Today 1 /
More informationThe Mean Value Theorem
The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers
More information3.7 Complex Zeros; Fundamental Theorem of Algebra
SECTION.7 Complex Zeros; Fundamental Theorem of Algebra 2.7 Complex Zeros; Fundamental Theorem of Algebra PREPARING FOR THIS SECTION Before getting started, review the following: Complex Numbers (Appendix,
More information54 Solving Compound Inequalities. Solve each compound inequality. Then graph the solution set p 8 and p 14 2 ANSWER: {p 12 p 16}
Solve each compound inequality. Then graph the solution set. 1. 4 p 8 and p 14 2 {p 12 p 16} 7. n + 2 5 and n + 6 6 {n 12 n 7} 8. y 1 7 or y + 3 < 1 2. r + 6 < 8 or r 3 > 10 {r r < 14 or r > 7} 3. 4a +
More informationAdvanced Algebra Chapter 1. Date Assignment Extra info
Advanced Algebra Chapter 1 Date Assignment Extra info Expectations/Getting to know you sheets Pg. 9 #1634(E), 3848(E), 54, 58 Pg. 15 #1927 all, 4962all Pg. 15 #2835(E), 4048(E), 7273 Pg. 24#2034(E),
More information2.6 Exponents and Order of Operations
2.6 Exponents and Order of Operations We begin this section with exponents applied to negative numbers. The idea of applying an exponent to a negative number is identical to that of a positive number (repeated
More informationChapter 7  Roots, Radicals, and Complex Numbers
Math 233  Spring 2009 Chapter 7  Roots, Radicals, and Complex Numbers 7.1 Roots and Radicals 7.1.1 Notation and Terminology In the expression x the is called the radical sign. The expression under the
More informationFirst Degree Equations First degree equations contain variable terms to the first power and constants.
Section 4 7: Solving 2nd Degree Equations First Degree Equations First degree equations contain variable terms to the first power and constants. 2x 6 = 14 2x + 3 = 4x 15 First Degree Equations are solved
More informationMATH 111: EXAM 02 SOLUTIONS
MATH 111: EXAM 02 SOLUTIONS BLAKE FARMAN UNIVERSITY OF SOUTH CAROLINA Answer the questions in the spaces provided on the question sheets and turn them in at the end of the class period Unless otherwise
More informationSolution, Assignment #6, CSE 191 Fall, 2014
Solution, Assignment #6, CSE 191 Fall, 2014 General Guidelines: This assignment will NOT be collected, nor graded. However, you should carefully complete it as if it were to be graded. There will be a
More informationp 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)
.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other
More informationLecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett
Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.
More informationSection 2.3: Quadratic Equations
SECTION.3 Quadratic Equations Section.3: Quadratic Equations Solving by Factoring Solving by Completing the Square Solving by the Quadratic Formula The Discriminant Solving by Factoring MATH 1310 College
More informationCongruences. Robert Friedman
Congruences Robert Friedman Definition of congruence mod n Congruences are a very handy way to work with the information of divisibility and remainders, and their use permeates number theory. Definition
More informationLogic and Proof Solutions. Question 1
Logic and Proof Solutions Question 1 Which of the following are true, and which are false? For the ones which are true, give a proof. For the ones which are false, give a counterexample. (a) x is an odd
More information5.1. Systems of Linear Equations. Linear Systems Substitution Method Elimination Method Special Systems
5.1 Systems of Linear Equations Linear Systems Substitution Method Elimination Method Special Systems 5.11 Linear Systems The possible graphs of a linear system in two unknowns are as follows. 1. The
More informationDiscrete Mathematics: Homework 7 solution. Due: 2011.6.03
EE 2060 Discrete Mathematics spring 2011 Discrete Mathematics: Homework 7 solution Due: 2011.6.03 1. Let a n = 2 n + 5 3 n for n = 0, 1, 2,... (a) (2%) Find a 0, a 1, a 2, a 3 and a 4. (b) (2%) Show that
More informationNotes. Sets. Notes. Introduction II. Notes. Definition. Definition. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry.
Sets Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.6 1.7 of Rosen cse235@cse.unl.edu Introduction
More information4. PRINCIPLE OF MATHEMATICAL INDUCTION
4 PRINCIPLE OF MATHEMATICAL INDUCTION Ex Prove the following by principle of mathematical induction 1 1 + 2 + 3 + + n 2 1 2 + 2 2 + 3 2 + + n 2 3 1 3 + 2 3 + 3 3 + + n 3 + 4 (1) + (1 + 3) + (1 + 3 + 5)
More information1. De Morgan s Law. Let U be a set and consider the following logical statement depending on an integer n. We will call this statement P (n):
Math 309 Fall 0 Homework 5 Drew Armstrong. De Morgan s Law. Let U be a set and consider the following logical statement depending on an integer n. We will call this statement P (n): For any n sets A, A,...,
More informationProof: A logical argument establishing the truth of the theorem given the truth of the axioms and any previously proven theorems.
Math 232  Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the
More informationProbability Worksheet 4. Simplify the expressions. n n 10! 2!8! 1.) 2.) 3.) ) 7! 5! 5! 5.) 4.) 14 7.) 8.) 2 2 n!
M408 Probability Worksheet 4 Name Simplify the expressions. 1.) 10! 2!8! 2.) n n 1 1 3.) 5 P 2 4.) 14 C 9 5.) 14 0 6.) 3! 7! 5! 5! 7.) x 3 4 n 3! x 2 4 n 1! 8.) x 1 2 2 n! x 4 2 2n 2! 9.) Find the value
More informationMath 181 Spring 2007 HW 1 Corrected
Math 181 Spring 2007 HW 1 Corrected February 1, 2007 Sec. 1.1 # 2 The graphs of f and g are given (see the graph in the book). (a) State the values of f( 4) and g(3). Find 4 on the xaxis (horizontal axis)
More informationWe now explore a third method of proof: proof by contradiction.
CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement
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 informationProbabilistic Strategies: Solutions
Probability Victor Xu Probabilistic Strategies: Solutions Western PA ARML Practice April 3, 2016 1 Problems 1. You roll two 6sided dice. What s the probability of rolling at least one 6? There is a 1
More informationA set is a Many that allows itself to be thought of as a One. (Georg Cantor)
Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains
More informationSets, Venn Diagrams & Counting
MT 142 College Mathematics Sets, Venn Diagrams & Counting Module SC Terri Miller revised January 5, 2011 What is a set? Sets set is a collection of objects. The objects in the set are called elements of
More informationChapter Exam Review for MAT098  Prealgebra Chapters 12: Whole Numbers and Introduction to Algebra & Integers and Introduction to Solving Equations
Chapter Exam Review for MAT098  Prealgebra Chapters 12: Whole Numbers and Introduction to Algebra & Integers and Introduction to Solving Equations Chapters 12 Learning Objectives: In chapter 1 students
More informationSection 3: Counting. Elements in Disjoint Sets
Section 3: Counting 6.3.1 Elements in Disjoint Sets In the last section, we looked at counting events that branch from one state to the next. These events we modelled using possibility trees and obtained
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 informationMAT2400 Analysis I. A brief introduction to proofs, sets, and functions
MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take
More informationOCR Statistics 1 Probability. Section 2: Permutations and combinations
OCR Statistics Probability Section 2: Permutations and combinations Notes and Examples These notes contain subsections on Factorials Permutations Combinations Factorials An important aspect of life is
More informationChapter 1 Section 4: Compound Linear Inequalities
Chapter 1 Section 4: Compound Linear Inequalities Introduction Compound linear inequalities involve finding the union or intersection of solution sets of two or more linear inequalities. You ve already
More informationLinear Systems. Singular and Nonsingular Matrices. Find x 1, x 2, x 3 such that the following three equations hold:
Linear Systems Example: Find x, x, x such that the following three equations hold: x + x + x = 4x + x + x = x + x + x = 6 We can write this using matrixvector notation as 4 {{ A x x x {{ x = 6 {{ b General
More informationMath 3000 Running Glossary
Math 3000 Running Glossary Last Updated on: July 15, 2014 The definition of items marked with a must be known precisely. Chapter 1: 1. A set: A collection of objects called elements. 2. The empty set (
More informationSection Summary. The Product Rule The Sum Rule The Subtraction Rule The Division Rule Examples, Examples, and Examples Tree Diagrams
Chapter 6 Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients and Identities Generalized Permutations and Combinations Generating Permutations
More informationlecture notes February 10, Probability Theory
8.30 lecture notes February 0, 205 Probability Theory Lecturer: Michel Goemans These notes cover the basic definitions of discrete probability theory, and then present some results including Bayes rule,
More information12 Mean, Median, Mode, and Range
Learn to find the mean, median, mode, and range of a data set. mean median mode range outlier Vocabulary The mean is the sum of the data values divided by the number of data items. The median is the middle
More informationSection 2.1: Shift Ciphers and Modular Arithmetic
1 Section 2.1: Shift Ciphers and Modular Arithmetic Practice HW from Barr Textbook (not to hand in) p.66 # 1, 2, 36, 912, 13, 15 The purpose of this section is to learn about modular arithmetic, which
More information2. Perform elementary row operations to get zeros below the diagonal.
Gaussian Elimination We list the basic steps of Gaussian Elimination, a method to solve a system of linear equations. Except for certain special cases, Gaussian Elimination is still state of the art. After
More informationMath Real Analysis I
Math 431  Real Analysis I Solutions to Homework due October 1 In class, we learned of the concept of an open cover of a set S R n as a collection F of open sets such that S A. A F We used this concept
More informationINCIDENCEBETWEENNESS GEOMETRY
INCIDENCEBETWEENNESS 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 information2) Based on the information in the table which choice BEST shows the answer to 1 906? 906 899 904 909
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ) Multiplying a number by results in what type of. even. 0. even.,0. odd..,0. even ) Based on the information in the table which choice BEST shows the answer to 0? 0 0 0 )
More informationRules of Signs for Decimals
CHAPTER 6 C Rules of Signs for Decimals c GOAL Apply the rules of signs for calculating with decimals. You will need number lines a calculator with a sign change key Learn about the Math Positive and negative
More informationGroups 1. Definition 1 A Group G is a set with an operation which satisfies the following: e a = a e = e. a a 1 = a 1 a = e.
Groups 1 1 Introduction to Groups Definition 1 A Group G is a set with an operation which satisfies the following: 1. there is an identity element e G, such that for every a G e a = a e = e 2. every element
More informationMath 113 HW #2 Solutions
Math 3 HW # Solutions.3 : Graph the function by hand, not by plotting points, but by starting with the graph of one of the standard functions given in Section., and then applying the appropriate transformations:
More information54 Prime and Composite Numbers
54 Prime and Composite Numbers Prime and Composite Numbers Prime Factorization Number of Divisorss Determining if a Number is Prime More About Primes Prime and Composite Numbers Students should recognizee
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Statements. A logical statement is a mathematical statement that is either true or false. Here we denote logical
More informationGMATArithmetic1. Numbers & Decimals, Fractions, Properties of Integers
GMATArithmetic1 Numbers & Decimals, Fractions, Properties of Integers 1). d is a positive decimal. Is its thousandths digit greater than 6? I. The hundredth digit of 10d is 7 II. The thousandth digit
More informationSets and Subsets. Countable and Uncountable
Sets and Subsets Countable and Uncountable Reading Appendix A Section A.6.8 Pages 788792 BIG IDEAS Themes 1. There exist functions that cannot be computed in Java or any other computer language. 2. There
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 informationProof of Crossword Puzzle Record
Proof of rossword Puzzle Record Kevin K. Ferland kferland@bloomu.edu Bloomsburg niversity, Bloomsburg, PA 17815 Abstract We prove that the maximum number of clues possible for a 15 15 daily New York imes
More informationThe ChiSquare Distributions
MATH 183 The ChiSquare Distributions Dr. Neal, WKU The chisquare distributions can be used in statistics to analyze the standard deviation " of a normally distributed measurement and to test the goodness
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationCOMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the HigmanSims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationSections 2.1, 2.2 and 2.4
SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete
More informationModule 6: Basic Counting
Module 6: Basic Counting Theme 1: Basic Counting Principle We start with two basic counting principles, namely, the sum rule and the multiplication rule. The Sum Rule: If there are n 1 different objects
More informationSolutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014
Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the
More informationQUADRATIC EQUATIONS. 1. The equation ax 2 + bx + c = 0, a 0 is the standard form of a quadratic equation, where a, b and c are real numbers.
QUADRATIC EQUATIONS. The equation a + b + c = 0, a 0 is the standard form of a quadratic equation, where a, b and c are real numbers.. A real number is said to be a root of the quadratic equation a + b
More informationHere are some examples of combining elements and the operations used:
MATRIX OPERATIONS Summary of article: What is an operation? Addition of two matrices. Multiplication of a Matrix by a scalar. Subtraction of two matrices: two ways to do it. Combinations of Addition, Subtraction,
More informationIntroductory Problems
Introductory Problems Today we will solve problems that involve counting and probability. Below are problems which introduce some of the concepts we will discuss.. At one of George Washington s parties,
More information8.7 Mathematical Induction
8.7. MATHEMATICAL INDUCTION 8135 8.7 Mathematical Induction Objective Prove a statement by mathematical induction Many mathematical facts are established by first observing a pattern, then making a conjecture
More informationAssignment 5 Math 101 Spring 2009
Assignment 5 Math 11 Spring 9 1. Find an equation of the tangent line(s) to the given curve at the given point. (a) x 6 sin t, y t + t, (, ). (b) x cos t + cos t, y sin t + sin t, ( 1, 1). Solution. (a)
More informationProblems and Solutions, INMO2011
Problems and Solutions, INMO011 1. Let,, be points on the sides,, respectively of a triangle such that and. Prove that is equilateral. Solution 1: c ka kc b kb a Let ;. Note that +, and hence. Similarly,
More informationHomework 1 Solution Section 2.1
Homework 1 Solution Section.1. Use echelon method to solve each system of two equations in two unknowns. 4x + y = 9 x y = 5 Apply the transformation 4 R 1 + R R : 4x + y = 9 7 4 y = 7 4 And apply the transformation
More informationMathQuest: Linear Algebra. 1. What is the solution to the following system of equations? 2x+y = 3 3x y = 7
MathQuest: Linear Algebra Systems of Equations 1. What is the solution to the following system of equations? 2x+y = 3 3x y = 7 (a) x = 4 and y = 5 (b) x = 4 and y = 5 (c) x = 2 and y = 1 (d) x = 2 and
More informationIf n is odd, then 3n + 7 is even.
Proof: Proof: We suppose... that 3n + 7 is even. that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. that 3n + 7 is even. Since n is odd, there exists an integer k so that
More informationPupils analyse a numerical puzzle, solve some examples and then deduce that a further example is impossible.
Task description Pupils analyse a numerical puzzle, solve some examples and then deduce that a further example is impossible. Suitability National Curriculum levels 5 to 7 Time Resources 30 minutes to
More informationEDU10003: The World of Maths Estimates and rounding
EDU10003: The World of Maths Estimates and rounding Learning Materials Rounding is used to give an approximate answer. To round a number to the nearest ten, if the number ends with a 1, 2, 3 or 4 the number
More information6th grade: 1st (inclusion) / 2nd (inclusion) / 6th period (regular) Mixed Numbers, Improper Fractions, and simplest form
Shalon Gillespie and Ashley Rulon Monday, September 19th, 2016 6th grade: 1st (inclusion) / 2nd (inclusion) / 6th period (regular) Mixed Numbers, Improper Fractions, and simplest form Apply and extend
More informationsupplement for UND s Math 107 precalculus course
Systems of Equations supplement for UND s Math 107 precalculus course by Dave Morstad Introduction A system of equations is any group of equations. A solution to a system of equations is a solution that
More informationPolynomials can be added or subtracted simply by adding or subtracting the corresponding terms, e.g., if
1. Polynomials 1.1. Definitions A polynomial in x is an expression obtained by taking powers of x, multiplying them by constants, and adding them. It can be written in the form c 0 x n + c 1 x n 1 + c
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Lecture Notes Counting 101 Note to improve the readability of these lecture notes, we will assume that multiplication takes precedence over division, i.e. A / B*C
More informationJan 17 Homework Solutions Math 151, Winter 2012. Chapter 2 Problems (pages 5054)
Jan 17 Homework Solutions Math 11, Winter 01 Chapter Problems (pages 0 Problem In an experiment, a die is rolled continually until a 6 appears, at which point the experiment stops. What is the sample
More informationBinary Numbers. October 08, Binary Numbers Key.notebook
Binary Numbers The decimal (base ten) numeral system has ten possible values (0,1,2,3,4,5,6,7,8, or 9) for each placevalue. In contrast, the binary (base two) numeral system has two possible values represented
More information