H2
... 1. For each of the following a’s and b’s, use the Euclidean algorithm to compute d = gcd(a, b), and use the extended algorithm to find numbers u and v such that d = au+bv. (a) a = 1001, b = 9471. (b) a = 99958, b = 315905. (c) a = 117, b = 325. 2. Recall from class that gcd(a, b) = 1 if and only if ...
... 1. For each of the following a’s and b’s, use the Euclidean algorithm to compute d = gcd(a, b), and use the extended algorithm to find numbers u and v such that d = au+bv. (a) a = 1001, b = 9471. (b) a = 99958, b = 315905. (c) a = 117, b = 325. 2. Recall from class that gcd(a, b) = 1 if and only if ...
Counting trains
... and another t5 possibilities for the back, for a total of t 52 trains with a join in the middle. Those with a 2car in the middle are completed by adding two trains of length 4, and there are t 42 possibilities for that. Adding these up, we get t10 = t 5 2 + t 4 2 . ...
... and another t5 possibilities for the back, for a total of t 52 trains with a join in the middle. Those with a 2car in the middle are completed by adding two trains of length 4, and there are t 42 possibilities for that. Adding these up, we get t10 = t 5 2 + t 4 2 . ...
Name
... Problem of the Week #___ Factor Groups Factors are numbers you can multiply together to get another number. For example, 2 and 3 are factors of 6 because 2 x 3 = 6. Some numbers have many factors, while others may have only two. 1.) Consider all the numbers between 1 and 100. In each case, count 1 a ...
... Problem of the Week #___ Factor Groups Factors are numbers you can multiply together to get another number. For example, 2 and 3 are factors of 6 because 2 x 3 = 6. Some numbers have many factors, while others may have only two. 1.) Consider all the numbers between 1 and 100. In each case, count 1 a ...