HW$3$ Practice Problem $3$

Problem Description

Consider the following sequence:

$2^k,k=1,2,3,$dots

How many sequential terms in this sequence can be added together without the total exceeding a specified value?

Resources

If you have not watched the Week $3$ Topic $1$ videos on this page $($specifically$,$ segments $4-1$ and $4-2),$ you should watch them

before attempting this problem!

Strategy

Use a while loop to determine how many sequential terms in the sequence can be added together without the total exceeding a specified

value $($e$.$g$.,500$ or $5000).$

Start by answering the following questions $($we did this in the videos!$)$:

What will the loop expression be$?$

What variables need to be initialized before the loop?

What variables need to be updated$/$incremented inside the loop?

Instructions

Following the pseudocode from the videos, write your code in the "Script" box below.

After the while loop:

Assign the appropriate value$/$expression to the variable numTerms.

Call fprintf to display the number of sequential terms in the sequence that can be added together without the total exceeding the

specified value.

Note that the autograder will be checking the following variables: $k,$ total, and numTerms $.$

Test your code using a small specified value $($e$.$g$.,35)$ so that you can check your answer on paper $($e$.$g$.,$ by completing the table below,

as we did in the videos$).$