81 = 4 82 = 9 For k starting at 3 and ending with 8: gk = (k-1) gk-1 + gk-2 What is the last term, gg, of the recursive sequence generated as a result of executing this algorithm?

Jump to level 1 Fill in the missing numbers of the sequence generated by Euclid's algorithm on inputs 58 and 10. gcd(58, 10) yields sequence: 58 10 Ex: 5 Ex: 5

Think back to the magical candy machine at your neighborhood grocery store. Suppose that the first time a quarter is put into the machine 1 Skittle comes out. The second time, 3 Skittles, the third time 9 Skittles, the fourth time, 27 Skittles, etc. a. Find both a recursive and closed formula for how many Skittles the nth customer gets. Recursive formula: an = Closed formula: an =

Discrete Math: Q# 1. How many strings of 9 letters can be created if the first and last letter must be the same? Is this 26^8 * 25?  Q#2. How many ways can a president, a vice-president, and a treasurer be chosen from a committee of 20 people? Is this 1140? I got this using the combinatorics definition using P(20,3)=20!/3!(20-3)1 Or is it 20!/(20-3)!=6840? I'm not sure which one to use. Q#3. How many numbers are there between 5 and 157 that are divisible by 3? Is this 52-3+1=50? I'm just going over some practice questions and want to make sure I'm on the right track. Thanks :)