5. (10%) Solve the recurrence relation a_n = a_n - 1 + 2n + 3 where a_0 = 5.

6. (10%) Simplify the following compound proposition to minimize the number of "and", "or", and "not" operations. $$(p \wedge q \wedge r) \vee (\neg p \wedge \neg r \wedge \neg s) \vee (\neg p \wedge \neg q \wedge s) \vee (\neg p \wedge q \wedge s) \vee (\neg p \wedge r \wedge \neg s)$$

5. (10%) Solve the recurrence relation \( a_{n} = a_{n - 1} + 2n + 3 \) where \( a_0 = 5 \).

相關申論題

相關試卷