Question

9.) Prove by using the method of Mathematical Induction II A.) Prove that $5^{2n+1} + 2^{2n+1}$ is divisible by 7 for all $n \ge 0$. B.) Prove that $a^2 - 1$ is divisible by 8 for all odd integers $a$. C.) Prove that $a^4 - 1$ is divisible by 16 for all odd integers $a$. D.) Prove that $a^{2n} - 1$ is divisible by $4 \times 2^n$ for all odd integers and for all integers. E.) Prove that $n^3 + 2n$ is divisible by 3 for all integers $n$. F.) Prove that $17n^3 + 103n$ is divisible by 6 for all integers $n$. G.) Prove that $2^n + 1$ is divisible by 3 for all odd integers $n$. This is for Discrete Mathematics and Foundations Of Number Theory.

          9.) Prove by using the method of Mathematical Induction II
A.) Prove that $5^{2n+1} + 2^{2n+1}$ is divisible by 7 for all $n \ge 0$.
B.) Prove that $a^2 - 1$ is divisible by 8 for all odd integers $a$.
C.) Prove that $a^4 - 1$ is divisible by 16 for all odd integers $a$.
D.) Prove that $a^{2n} - 1$ is divisible by $4 \times 2^n$ for all odd integers and for all integers.
E.) Prove that $n^3 + 2n$ is divisible by 3 for all integers $n$.
F.) Prove that $17n^3 + 103n$ is divisible by 6 for all integers $n$.
G.) Prove that $2^n + 1$ is divisible by 3 for all odd integers $n$.
This is for Discrete Mathematics and Foundations Of Number Theory.

9.) Prove by using the method of Mathematical Induction II
A.) Prove that 5^2n+1 + 2^2n+1 is divisible by 7 for all n ≥ 0.
B.) Prove that a^2 - 1 is divisible by 8 for all odd integers a.
C.) Prove that a^4 - 1 is divisible by 16 for all odd integers a.
D.) Prove that a^2n - 1 is divisible by 4 × 2^n for all odd integers and for all integers.
E.) Prove that n^3 + 2n is divisible by 3 for all integers n.
F.) Prove that 17n^3 + 103n is divisible by 6 for all integers n.
G.) Prove that 2^n + 1 is divisible by 3 for all odd integers n.
This is for Discrete Mathematics and Foundations Of Number Theory.

Added by Alejandro R.

Question

Please give Ace some feedback