Consider the following while loop:
while n<b, do
a.) Write the first three numbers printed;
b.) Find all values of b for which the last number printed will be 342.
I am at a complete loss as to how to figure this out. I feel like just plugging in 1 for n is far too easy, and if that is the case, it will take far too long to get to 342.