Path To College Mathematics
1st Edition
ISBN: 9780134654409
Author: Martin-Gay, K. Elayn, 1955-
Publisher: Pearson,
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter 7.3, Problem 38ES
To determine
To determine the number of parking spaces that can be numbered using the given system.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
In this exercise, we will investigate a technique to prove that a language is notregular. This tool is called the pumping lemma.The pumping lemma says that if M = (S, I, f, s0, F ) is a DFA with p states (i.e., p = |S|) and if the wordw is in L(M ) (the language generated by M ) and w has length greater than or equal to p, then w may bedivided into three pieces, w = xyz, satisfying the following conditions:1. For each i ∈ N, xy^i z ∈ L(M ).2. |y| > 0 (i.e., y contains at least one character).3. |xy| ≤ p (i.e., the string xy has at most p characters).
Use the pumping lemma to show the following language is not regular (HINT: Use proof by contradictionto assume the language is regular and apply the pumping lemma to the language):L = {0^k1^k | k ∈ N}
A prefix of length ℓ of some word w are the first ℓ characters (in order) of w.1. Construct a context-free grammar for the language: L = {w ∈ {a, b}∗ | every prefix of w has at least as many a’s as b’s}2. Explain why every word generated by your context-free grammar (in Part 1) is contained in L. Then,prove via induction that every w ∈ L is produced by your context-free grammar.
Consider a simplified version of American football where on any possession ateam can earn 0, 3 or 7 points. What is the smallest number n0 of points such that for all n ≥ n0 and n ∈ Na team could earn n points. You must prove that your answer is correct via induction (HINT: Don’t forgetto show that n0 is the smallest number above which any number of points is reachable).
Chapter 7 Solutions
Path To College Mathematics
Ch. 7.1 - Prob. 1ESCh. 7.1 - Prob. 2ESCh. 7.1 - Prob. 3ESCh. 7.1 - Prob. 4ESCh. 7.1 - Prob. 5ESCh. 7.1 - Prob. 6ESCh. 7.1 - Prob. 7ESCh. 7.1 - Prob. 8ESCh. 7.1 - Prob. 9ESCh. 7.1 - Prob. 10ES
Ch. 7.1 - Prob. 11ESCh. 7.1 - Prob. 12ESCh. 7.1 - Prob. 13ESCh. 7.1 - Prob. 14ESCh. 7.1 - Prob. 15ESCh. 7.1 - Prob. 16ESCh. 7.1 - Prob. 17ESCh. 7.1 - Prob. 18ESCh. 7.1 - Prob. 19ESCh. 7.1 - Suppose a 6-sided die is tossed twice. (This is a...Ch. 7.1 - Prob. 21ESCh. 7.1 - Prob. 22ESCh. 7.1 - Prob. 23ESCh. 7.1 - Prob. 24ESCh. 7.1 - Solve. Current license plates in California now...Ch. 7.1 - Prob. 26ESCh. 7.1 - Although there are exceptions, the call signs for...Ch. 7.1 - Prob. 28ESCh. 7.1 - Prob. 29ESCh. 7.1 - Prob. 30ESCh. 7.1 - Prob. 31ESCh. 7.1 - Prob. 32ESCh. 7.1 - Prob. 33ESCh. 7.1 - Prob. 34ESCh. 7.1 - Prob. 35ESCh. 7.1 - Prob. 36ESCh. 7.1 - Prob. 37ESCh. 7.1 - Prob. 38ESCh. 7.1 - Prob. 39ESCh. 7.1 - Prob. 40ESCh. 7.1 - Prob. 41ESCh. 7.1 - For security purpose, a company is starting to...Ch. 7.2 - Prob. 1ESCh. 7.2 - Prob. 2ESCh. 7.2 - Prob. 3ESCh. 7.2 - Prob. 4ESCh. 7.2 - Prob. 5ESCh. 7.2 - Prob. 6ESCh. 7.2 - Prob. 7ESCh. 7.2 - Prob. 8ESCh. 7.2 - Prob. 9ESCh. 7.2 - Prob. 10ESCh. 7.2 - Prob. 11ESCh. 7.2 - Prob. 12ESCh. 7.2 - Prob. 13ESCh. 7.2 - Prob. 14ESCh. 7.2 - Prob. 15ESCh. 7.2 - Prob. 16ESCh. 7.2 - Prob. 17ESCh. 7.2 - Prob. 18ESCh. 7.2 - Prob. 19ESCh. 7.2 - Prob. 20ESCh. 7.2 - Prob. 21ESCh. 7.2 - Prob. 22ESCh. 7.2 - Prob. 23ESCh. 7.2 - Prob. 24ESCh. 7.2 - Prob. 25ESCh. 7.2 - Prob. 26ESCh. 7.2 - Prob. 27ESCh. 7.2 - Prob. 28ESCh. 7.2 - Prob. 29ESCh. 7.2 - Prob. 30ESCh. 7.2 - Prob. 31ESCh. 7.2 - Prob. 32ESCh. 7.2 - Prob. 33ESCh. 7.2 - Prob. 34ESCh. 7.2 - Prob. 35ESCh. 7.2 - Prob. 36ESCh. 7.2 - Prob. 37ESCh. 7.2 - Prob. 38ESCh. 7.2 - Prob. 39ESCh. 7.2 - Prob. 40ESCh. 7.2 - Solve. Some of these exercises may be solved using...Ch. 7.2 - Prob. 42ESCh. 7.2 - Prob. 43ESCh. 7.2 - Prob. 44ESCh. 7.2 - Prob. 45ESCh. 7.2 - Prob. 46ESCh. 7.2 - Prob. 47ESCh. 7.2 - Prob. 48ESCh. 7.2 - Prob. 49ESCh. 7.2 - Prob. 50ESCh. 7.2 - Prob. 51ESCh. 7.2 - Prob. 52ESCh. 7.2 - Prob. 53ESCh. 7.2 - Prob. 54ESCh. 7.2 - Prob. 55ESCh. 7.2 - Prob. 56ESCh. 7.2 - Prob. 57ESCh. 7.2 - Prob. 58ESCh. 7.2 - Prob. 59ESCh. 7.2 - Prob. 60ESCh. 7.2 - Is it possible to evaluate P65 Explain why or why...Ch. 7.2 - Prob. 62ESCh. 7.2 - Prob. 63ESCh. 7.2 - Prob. 64ESCh. 7.2 - Explain why P55 can be calculated but is not...Ch. 7.2 - Prob. 66ESCh. 7.2 - Prob. 67ESCh. 7.2 - Prob. 68ESCh. 7.3 - Prob. 1ESCh. 7.3 - Evaluate each combination. See Examples 2 through...Ch. 7.3 - Prob. 3ESCh. 7.3 - Prob. 4ESCh. 7.3 - Prob. 5ESCh. 7.3 - Prob. 6ESCh. 7.3 - Prob. 7ESCh. 7.3 - Prob. 8ESCh. 7.3 - Prob. 9ESCh. 7.3 - Prob. 10ESCh. 7.3 - Prob. 11ESCh. 7.3 - Prob. 12ESCh. 7.3 - Prob. 13ESCh. 7.3 - Prob. 14ESCh. 7.3 - Prob. 15ESCh. 7.3 - Prob. 16ESCh. 7.3 - Prob. 17ESCh. 7.3 - Prob. 18ESCh. 7.3 - Prob. 19ESCh. 7.3 - Prob. 20ESCh. 7.3 - Prob. 21ESCh. 7.3 - Prob. 22ESCh. 7.3 - Prob. 23ESCh. 7.3 - Prob. 24ESCh. 7.3 - Prob. 25ESCh. 7.3 - Prob. 26ESCh. 7.3 - Prob. 27ESCh. 7.3 - Prob. 28ESCh. 7.3 - Prob. 29ESCh. 7.3 - Prob. 30ESCh. 7.3 - Prob. 31ESCh. 7.3 - Prob. 32ESCh. 7.3 - Prob. 33ESCh. 7.3 - Prob. 34ESCh. 7.3 - Prob. 35ESCh. 7.3 - Prob. 36ESCh. 7.3 - Prob. 37ESCh. 7.3 - Prob. 38ESCh. 7.3 - Prob. 39ESCh. 7.3 - Prob. 40ESCh. 7.3 - Prob. 41ESCh. 7.3 - Prob. 42ESCh. 7.3 - Prob. 43ESCh. 7.3 - Prob. 44ESCh. 7.3 - Prob. 45ESCh. 7.3 - Prob. 46ESCh. 7.3 - Prob. 47ESCh. 7.3 - Prob. 48ESCh. 7.3 - Prob. 49ESCh. 7.3 - Prob. 50ESCh. 7.3 - Prob. 51ESCh. 7.3 - Prob. 52ESCh. 7.3 - Prob. 53ESCh. 7.3 - Prob. 54ESCh. 7.3 - Prob. 55ESCh. 7.3 - Prob. 56ESCh. 7.3 - Prob. 57ESCh. 7.3 - Prob. 58ESCh. 7.3 - Prob. 59ESCh. 7.3 - Prob. 60ESCh. 7.3 - Prob. 61ESCh. 7.3 - Prob. 62ESCh. 7.3 - Prob. 63ESCh. 7.3 - Prob. 64ESCh. 7.3 - Prob. 65ESCh. 7.3 - Prob. 66ESCh. 7.3 - Prob. 67ESCh. 7.3 - Prob. 1IRCh. 7.3 - Prob. 2IRCh. 7.3 - Prob. 3IRCh. 7.3 - Prob. 4IRCh. 7.3 - Prob. 5IRCh. 7.3 - Prob. 6IRCh. 7.3 - Prob. 7IRCh. 7.3 - Prob. 8IRCh. 7.3 - Prob. 9IRCh. 7.3 - Prob. 10IRCh. 7.3 - Prob. 11IRCh. 7.3 - Prob. 12IRCh. 7.3 - Prob. 13IRCh. 7.3 - Prob. 14IRCh. 7.3 - Prob. 15IRCh. 7.4 - Prob. 1ESCh. 7.4 - Prob. 2ESCh. 7.4 - Prob. 3ESCh. 7.4 - Prob. 4ESCh. 7.4 - Prob. 5ESCh. 7.4 - Prob. 6ESCh. 7.4 - Prob. 7ESCh. 7.4 - Prob. 8ESCh. 7.4 - Prob. 9ESCh. 7.4 - Prob. 10ESCh. 7.4 - Prob. 11ESCh. 7.4 - Prob. 12ESCh. 7.4 - Prob. 13ESCh. 7.4 - Prob. 14ESCh. 7.4 - Prob. 15ESCh. 7.4 - Prob. 16ESCh. 7.4 - Prob. 17ESCh. 7.4 - Prob. 18ESCh. 7.4 - Prob. 19ESCh. 7.4 - Prob. 20ESCh. 7.4 - Prob. 21ESCh. 7.4 - Prob. 22ESCh. 7.4 - Prob. 23ESCh. 7.4 - Prob. 24ESCh. 7.4 - Prob. 25ESCh. 7.4 - Prob. 26ESCh. 7.4 - Prob. 27ESCh. 7.4 - Prob. 28ESCh. 7.4 - Prob. 29ESCh. 7.4 - Prob. 30ESCh. 7.4 - Prob. 31ESCh. 7.4 - Prob. 32ESCh. 7.4 - Prob. 33ESCh. 7.4 - Prob. 34ESCh. 7.4 - Prob. 35ESCh. 7.4 - Prob. 36ESCh. 7.4 - Prob. 37ESCh. 7.4 - Prob. 38ESCh. 7.4 - Prob. 39ESCh. 7.4 - Prob. 40ESCh. 7.4 - Prob. 41ESCh. 7.4 - Prob. 42ESCh. 7.4 - Prob. 43ESCh. 7.4 - Prob. 44ESCh. 7.4 - Prob. 45ESCh. 7.4 - Prob. 46ESCh. 7.4 - Prob. 47ESCh. 7.4 - Prob. 48ESCh. 7.4 - Prob. 49ESCh. 7.4 - Prob. 50ESCh. 7.4 - Prob. 51ESCh. 7.4 - Prob. 52ESCh. 7.4 - Prob. 53ESCh. 7.4 - Prob. 54ESCh. 7.4 - Prob. 55ESCh. 7.4 - Prob. 56ESCh. 7.4 - Prob. 57ESCh. 7.4 - Prob. 58ESCh. 7.4 - Prob. 59ESCh. 7.4 - Prob. 60ESCh. 7.4 - Prob. 61ESCh. 7.4 - Prob. 62ESCh. 7.4 - Prob. 63ESCh. 7.4 - Prob. 64ESCh. 7.4 - Prob. 65ESCh. 7.4 - Prob. 66ESCh. 7.4 - Prob. 67ESCh. 7.4 - Prob. 68ESCh. 7.4 - Prob. 69ESCh. 7.4 - Prob. 70ESCh. 7.4 - Prob. 71ESCh. 7.4 - Prob. 72ESCh. 7.4 - Prob. 73ESCh. 7 - Prob. 1VCCh. 7 - Prob. 2VCCh. 7 - Prob. 3VCCh. 7 - Prob. 4VCCh. 7 - Prob. 5VCCh. 7 - Prob. 6VCCh. 7 - Prob. 7VCCh. 7 - Prob. 8VCCh. 7 - Prob. 9VCCh. 7 - Prob. 10VCCh. 7 - Prob. 11VCCh. 7 - Prob. 12VCCh. 7 - Prob. 13VCCh. 7 - Prob. 14VCCh. 7 - Prob. 15VCCh. 7 - Prob. 16VCCh. 7 - Prob. 17VCCh. 7 - Prob. 18VCCh. 7 - Prob. 19VCCh. 7 - Prob. 20VCCh. 7 - Prob. 21VCCh. 7 - Prob. 1RCh. 7 - Draw a tree diagram for each experiment. Then use...Ch. 7 - Prob. 3RCh. 7 - Prob. 4RCh. 7 - Prob. 5RCh. 7 - Prob. 6RCh. 7 - Prob. 7RCh. 7 - Prob. 8RCh. 7 - Prob. 9RCh. 7 - Prob. 10RCh. 7 - Prob. 11RCh. 7 - Prob. 12RCh. 7 - Prob. 13RCh. 7 - Prob. 14RCh. 7 - Prob. 15RCh. 7 - Prob. 16RCh. 7 - Prob. 17RCh. 7 - Prob. 18RCh. 7 - Prob. 19RCh. 7 - Prob. 20RCh. 7 - Prob. 21RCh. 7 - Prob. 22RCh. 7 - Prob. 23RCh. 7 - Prob. 24RCh. 7 - Prob. 25RCh. 7 - Prob. 26RCh. 7 - Prob. 27RCh. 7 - Prob. 28RCh. 7 - Prob. 29RCh. 7 - Prob. 30RCh. 7 - Prob. 31RCh. 7 - Prob. 32RCh. 7 - Prob. 33RCh. 7 - Prob. 34RCh. 7 - Prob. 35RCh. 7 - Prob. 36RCh. 7 - Prob. 37RCh. 7 - Prob. 38RCh. 7 - Prob. 39RCh. 7 - Prob. 40RCh. 7 - Prob. 41RCh. 7 - Prob. 42RCh. 7 - Prob. 43RCh. 7 - Prob. 44RCh. 7 - Prob. 45RCh. 7 - Prob. 46RCh. 7 - Prob. 47RCh. 7 - Prob. 48RCh. 7 - Prob. 49RCh. 7 - Prob. 50RCh. 7 - Prob. 51RCh. 7 - Prob. 52RCh. 7 - Prob. 53RCh. 7 - Prob. 54RCh. 7 - Prob. 55RCh. 7 - Prob. 56RCh. 7 - Prob. 57RCh. 7 - Prob. 58RCh. 7 - Prob. 59RCh. 7 - Prob. 60RCh. 7 - Prob. 61RCh. 7 - Prob. 62RCh. 7 - Prob. 63RCh. 7 - Prob. 64RCh. 7 - Prob. 65RCh. 7 - Prob. 66RCh. 7 - Prob. 67RCh. 7 - Prob. 68RCh. 7 - Prob. 69RCh. 7 - Prob. 70RCh. 7 - Prob. 71RCh. 7 - Prob. 72RCh. 7 - Prob. 73RCh. 7 - Prob. 74RCh. 7 - Prob. 1GRFTCh. 7 - Prob. 2GRFTCh. 7 - Prob. 3GRFTCh. 7 - Prob. 4GRFTCh. 7 - Prob. 5GRFTCh. 7 - Prob. 6GRFTCh. 7 - Prob. 7GRFTCh. 7 - Prob. 8GRFTCh. 7 - Prob. 9GRFTCh. 7 - Prob. 10GRFTCh. 7 - Prob. 11GRFTCh. 7 - Prob. 12GRFTCh. 7 - Prob. 13GRFTCh. 7 - Prob. 14GRFTCh. 7 - Prob. 1TCh. 7 - Prob. 2TCh. 7 - Prob. 3TCh. 7 - Prob. 4TCh. 7 - Prob. 5TCh. 7 - Prob. 6TCh. 7 - Prob. 7TCh. 7 - Prob. 8TCh. 7 - Prob. 9TCh. 7 - Prob. 10TCh. 7 - Prob. 11TCh. 7 - Prob. 12TCh. 7 - Prob. 13TCh. 7 - Prob. 14TCh. 7 - Prob. 15TCh. 7 - Prob. 16TCh. 7 - Prob. 17TCh. 7 - Prob. 18TCh. 7 - Prob. 19TCh. 7 - Prob. 20TCh. 7 - Prob. 21TCh. 7 - Prob. 22TCh. 7 - Prob. 23TCh. 7 - Prob. 24TCh. 7 - Prob. 25TCh. 7 - Prob. 26TCh. 7 - Prob. 27TCh. 7 - Prob. 28TCh. 7 - Prob. 29TCh. 7 - Prob. 30TCh. 7 - Prob. 31TCh. 7 - Prob. 1CRCh. 7 - Prob. 2CRCh. 7 - Prob. 3CRCh. 7 - Prob. 4CRCh. 7 - Prob. 5CRCh. 7 - Prob. 6CRCh. 7 - Prob. 7CRCh. 7 - Prob. 8CRCh. 7 - Prob. 9CRCh. 7 - Prob. 10CRCh. 7 - Prob. 11CRCh. 7 - Prob. 12CRCh. 7 - Prob. 13CRCh. 7 - Prob. 14CRCh. 7 - Prob. 15CRCh. 7 - Prob. 16CRCh. 7 - Prob. 17CRCh. 7 - Prob. 18CRCh. 7 - The Swiss Re Building, in London, is a unique...Ch. 7 - Prob. 20CRCh. 7 - Prob. 21CRCh. 7 - Prob. 22CRCh. 7 - Prob. 23CRCh. 7 - Prob. 24CRCh. 7 - Prob. 25CRCh. 7 - Prob. 26CRCh. 7 - Prob. 27CRCh. 7 - Prob. 28CRCh. 7 - Prob. 29CRCh. 7 - Prob. 30CRCh. 7 - Prob. 31CRCh. 7 - Prob. 32CR
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Consider a vocabulary consisting of the nucleotide bases V = {A, T, G, C}.Construct a DFA to recognize strings which end in AAGT .(a) Draw the DFA with clear markings of all states including start and acceptance state(s).(b) Simulate the DFA to show that string T GAAGT will be accepted by the DFA.(c) Simulate the DFA to show that string T AAGT G will not be accepted by the DFA.arrow_forwardA palindrome is a string that reads the same backward as it does forward. For example, abaaaba is a palindrome. Suppose that we need to define a language that generates palindromes.(a) Define a phase structure grammar that generates the set of all palindromes over the alphabet {a, b}clearly describing the recursive rules that generates palindromes. Use the notation Symbol → rule. Theempty set is denoted by λ. Clearly identify the terminal and non-terminal symbols in your grammar.(b) Show that the palindrome abaaaba can be recognized by your grammar. To show this, show all stepsof parsing the expression abaaaba using the rules you defined above.arrow_forwardA full k-ary tree is a (rooted) tree whose nodes either have exactly k children (internal nodes) or have no children (leaves). Using structural induction, formally prove that every full k-ary tree that has x internal nodes has exactly kx + 1 nodes in total. Note that for full binary trees, i.e., when k = 2, this would imply that the total number of nodes is 2x + 1.arrow_forward
- question 10 pleasearrow_forward00 (a) Starting with the geometric series Σ X^, find the sum of the series n = 0 00 Σηχη - 1, |x| < 1. n = 1 (b) Find the sum of each of the following series. 00 Σnx", n = 1 |x| < 1 (ii) n = 1 sin (c) Find the sum of each of the following series. (i) 00 Σn(n-1)x^, |x| <1 n = 2 (ii) 00 n = 2 n² - n 4n (iii) M8 n = 1 շոarrow_forward(a) Use differentiation to find a power series representation for 1 f(x) = (4 + x)²* f(x) = 00 Σ n = 0 What is the radius of convergence, R? R = (b) Use part (a) to find a power series for f(x) = 1 (4 + x)³° f(x) = 00 Σ n = 0 What is the radius of convergence, R? R = (c) Use part (b) to find a power series for f(x) = x² (4 + x)³* 00 f(x) = Σ n = 2 What is the radius of convergence, R? R = Need Help? Read It Watch It SUBMIT ANSWERarrow_forward
- W AutoSave Off Soal Latihan Matdis (1) ▼ Search File Home Insert Draw Design Layout References Mailings Review View Help Aptos (Body) ✓ 12 A A Aa Ро Paste BI U ab x, x² A ✓ A ད Clipboard ₪ 24 23 22 21 20 19 18 17 16 15 1″ ידידיו Page 1 of 1 25°C 215 words Berawan E> M Font 四 Paragraph 3 4 1 56 ☑ 781 LI Comments Editing Find ✓ Normal No Spacing Heading Replace Add-ins Select Styles ☑ Editing Add-ins 91 10 111 12 | 13| 14 15 5. Suppose you wanted to draw a quadrilateral using the dots below as vertices (corners). The dots are spaced one unit apart horizontally and two units apart vertically. a) How many quadrilaterals are possible? b) How many are squares? How many are rectangles? c) How many are parallelograms? English (Indonesia) Accessibility: Investigate R - W ☑ Share ▾ Focus + 100% 00:17 13/04/2025arrow_forwardanswer for question 4 pleasearrow_forwardThe joint density function of two continuous random variables X and Y is: p(x, y) = {Kcos(x + y) Find (i) the constant K 0 0arrow_forwardp(x,y) = {e-x -(x+y) 0 x ≥ 0, y ≥ 0 otherwise find x,y,Exy, by Охarrow_forward2. Show that 8 xa S -dx (b² + 12) dr = 2 cos(π2) пра-1 a, b real and -1 0 Your solution should clearly explain the closed contour you are using, and state clearly any vanishing properties of integrals over contours that are being used. You are free to quote from the lectures, the appropriate results on such vanishing properties, without deriving these properties. Any residue calculations involved should be explained clearly.arrow_forwardCould you please answer this question using excel.Thanksarrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
Recommended textbooks for you
Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
Elementary AlgebraAlgebraISBN:9780998625713Author:Lynn Marecek, MaryAnne Anthony-SmithPublisher:OpenStax - Rice University
Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGAL
College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,
Algebra: Structure And Method, Book 1
Algebra
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:McDougal Littell
Elementary Algebra
Algebra
ISBN:9780998625713
Author:Lynn Marecek, MaryAnne Anthony-Smith
Publisher:OpenStax - Rice University
Holt Mcdougal Larson Pre-algebra: Student Edition...
Algebra
ISBN:9780547587776
Author:HOLT MCDOUGAL
Publisher:HOLT MCDOUGAL
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Mathematics For Machine Technology
Advanced Math
ISBN:9781337798310
Author:Peterson, John.
Publisher:Cengage Learning,
The Fundamental Counting Principle; Author: AlRichards314;https://www.youtube.com/watch?v=549eLWIu0Xk;License: Standard YouTube License, CC-BY
The Counting Principle; Author: Mathispower4u;https://www.youtube.com/watch?v=qJ7AYDmHVRE;License: Standard YouTube License, CC-BY