Midterm COMP 2804
... 9. Let A be a set of 5 elements and let B be a set of 12 elements. How many one-to-one (i.e., injective) functions f : A → B are there? Answer: 8 · 9 · 10 · 11 · 12 10. For any integer n ≥ 2, let Sn be the number of bitstrings of length n in which the first two bits are the same. Which of the follow ...
... 9. Let A be a set of 5 elements and let B be a set of 12 elements. How many one-to-one (i.e., injective) functions f : A → B are there? Answer: 8 · 9 · 10 · 11 · 12 10. For any integer n ≥ 2, let Sn be the number of bitstrings of length n in which the first two bits are the same. Which of the follow ...
![B2[∞]-sequences of square numbers](http://s1.studyres.com/store/data/014554791_1-cdd0f3de1fbdb07bf0c0f87a9c563b95-300x300.png)
Investigation 3: Common Multiples and Common Factors
... The least common multiple is the product of the two numbers when their only common factor is 1. o Example: LCM of 4 & 7 is 28 because the only common factor of 4 and 7 is 1. ...
... The least common multiple is the product of the two numbers when their only common factor is 1. o Example: LCM of 4 & 7 is 28 because the only common factor of 4 and 7 is 1. ...