need help finding discrete math solutions - answer the first or second set of qu

Question

need help finding discrete math solutions - answer the first or second set of questions. not both

prove by induction

1. Prove by induction on n N. (a) 6|n^3-n (b) 7|2^n+2 +3^2n+1 2. Prove by induction that n can be divided by a prime number for all n N- {0,1} 3. Find the closed form of the following recurrence relations and prove that it works for all n N using induction. (a) a0 = 1 and for n> = 1,an - 8 - 3an-1. (b) b0 = b1 = 1 and for n > = 2, b = -(2bn-1 + b-2) 4. Find the closed form of the second order recurrence relation and prove that it works for all n N using induction: b0 = b1 = 2 and for n > = 2, bn = 2bn-1 - 10bn-2

Explanation / Answer

/////

Related Questions

Navigate

• Browse (All)
• Browse N
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.