Matlab

8. Use loops to find the smallest odd integer that is also divisible by 3 and whose cube is greater than 4,000. The loop should start at 5 and stop once the number is found. Display the message: "The required number is_" 9. An approximation for pi is given by: 2n 1 n-0 In this series, notice that n goes from zero to infinity. Since we can't sit here and plug in an infinite amount of numbers, instead we will only calculate up to some finite upper n value. By stopping early, we are calculating a "partial sum" (rather than the total sum). Use loops to continue adding terms to your partial sum until you reach a satisfactory approximation of pi. The series reaches a satisfactory approximation when the absolute error between your sum and the true value of pi is sufficiently small, given by: pi - partialSum