Discrete math:   Describe an algorithm for finding the smallest integer in a finite sequence of integer

Let n be a positive integer. Give a recursive algorithm for computing the sum of the first n positive integers by filling in the boxes in the procedure below with the expressions n, n – 1 or 1. Note: You have to use some expressions more than once, but each box must contain only one of those expressions. procedure sum : positive integer) if then sum 1 else sum + sum

Pls help on this question ASAP

When using Euclid's algorithm to find the GCD of 820 and 730, what are the first three remainders you find? {put one in each answerbox in order as found).

Start Fill in the missing numbers of the sequence generated by Euclid's algorithm on inputs 70 and 15. gcd(70, 15) yields sequence: 70 15 Ex: 5 Ex: 5 0 Check cative inverse mod n 1 Next 2

2. Use the Booth multiply algorithm to compute the following two pairs of numbers: (a) 39 x -45 (b) -53 x-43

Discrete Math