In Exercises 1521, prove that the program segment is correct by finding and proving the appropriate loop invariant Q and evaluating Q at loop termination.

9/19: Chapter 4: 1. Existential statements can be proven by example 2. Universal statements cannot be proven by example 3. An integer n > 1 is prime if its only divisors are 1 and itself (known as trivial factors) 4. An integer n > 1 is composite if it is not prime a. Working definition – Integer n > 1 if there exists...