Ask a New Question

Asked by Majeed

prove by induction that 3.7^(2n)+1 is divisible by 4
8 years ago

Answers

Answered by Steve
test for n=1

3.7^2+1 = 14.69
BZZZZTT! But thanks for playing.

I suspect a typo in your presentation.
8 years ago
There are no AI answers yet. The ability to request AI answers is coming soon!

Submit Your Answer


We prioritize human answers over AI answers.

If you are human, and you can answer this question, please submit your answer.

Related Questions

Prove by induction that 9^(n+2)- 4n is divisible by 5 for n greater than or equal to 1. Thanks. Prove By induction that sinx + sin3x + sin5x +.... Sin(2n-1) =sin^2(nx)/sin3x Prove by induction on all positive integer k that if m is any ordinary nfa with k states, and m has... Prove by mathematical induction that 1+3+5+7+......+(2n-1)=n² Prove by mathematical induction that the sum of the first n terms of the geometric series 1/5 + 1/5^... prove by mathematical induction that 7n+4n+1 is divisible by 6 Prove by mathematical induction that : E (3r-5)= 3n^2-7n /2 r=1 use mathematical induction to prove -1/2^n = 1/2^n - 1 Use mathematical induction to prove that each proposition is valid for all positive integral values... Use mathematical induction to prove the property for all positive integers n. A factor of (n^3+3n...
Submit Your Answer

Question

prove by induction that 3.7^(2n)+1 is divisible by 4

Ask a New Question
Archives Contact Us Privacy Policy Terms of Use