Hello, m777!
1(a) Use the Euclidean Algorithm to find
I was taught this way . . .
[1] Divide the larger by the smaller; note the remainder.
[2] Divide the remainder into the divisor; note the remainder.
[3] Repeat step 2 until the remainder is 0.
[4] The is the last divisor. Code:
5 1 1 2 3
------ ---- ---- ---- ---
34 ) 190 20 ) 34 14 ) 20 6 ) 14 2 ) 6
170 20 14 12 ↑ 6
--- --- --- --- --
20 14 6 2 0
Therefore: .
1(b) Find if:
We have: .
Divide by
The quadratic factors: .
. . and has two solutions: .
Since must be positive, the answer is: .
2. A computer access code consists of from one to three letters
. . of the English alphabet with repetition allowed.
How many different code words are possible?
Since each code letter has 26 choices,
. . there are: . possible code words.
3(a) A box contains 10 different colored light bulbs.
Find the number of ordered samples of size 3 with replacement.
The first can be any of the 10 bulbs.
The second can be any of the 10 bulbs.
The third can be any of the 10 bulbs.
There are: . possible ordered samples.
3(b) How many possible outcomes are there when a fair coin is tossed three times?
The first toss has 2 possible outcomes (Heads or Tails).
The second toss has 2 possible outcomes.
The third toss has 2 possible outcomes.
There are: . possible outcomes.
4. How many 2-permutations are there of ? .Write them all.
There are: . permutations.
They are: .