# Discrete Math

Use mathematical induction to prove the truth of each of the following assertions for all n ≥1.

5^2n – 2^5n is divisible by 7

If n = 1, then 5^2(1) - 2^5(1) = -7, which is divisible by 7. For the inductive case, assume k ≥ 1, and the result is true for n = k; that is 7 | (5^2k + 2^5k). Use the assumption to prove n = k + 1, in other words, 5^(2(k + 1)) - 2^(5(k + 1)) is divisible by 7. Now,

5^(2(k + 1)) - 2^(5(k + 1))
= 5^(2k + 2) - 2(5k + 5)
= 5^(2k) · 5^2 - 2^(5k) · 2^5
= 25 · 5^(2k) - 32 · 2^(5k)
= IDK what to do from here. . .

Any suggestions? Thank you again!

1. 👍 0
2. 👎 0
3. 👁 225
1. Let's continue:

25 · 5^(2k) - 32 · 2^(5k)
=25*(5^(2k)-2^(5k) -7*2^(5k)

A. Is (5^(2k)-2^(5k) divisible by 7, and why?
B. Is -7*2^(5k) divisible by 7, and why?

1. 👍 0
2. 👎 0

## Similar Questions

1. ### Math

Use Mathematical Induction to show that the statement 2 + 6 + 10 + . . . + (4n – 2) = 2n^2 is true

2. ### math induction

prove the product of 4 consecutive integers is always divisible by 24 using the principles of math induction. Could anyone help me on this one? Thanks in advance! Sure For induction we want to prove some statement P for all the

3. ### precalculus

Can you please check my answers? 1.Find Pk + 1 if Pk=2^K-1/k! answer: 2^k+1/(k+1)! 2.Find Pk + 1 if Pk = 7 + 13 + 19 + ...+[6(k - 1)+1] + (6k + 1) answer: 7+13+9...(6k-1+1)+6k+1 +(6k+2) 3.What is the first step when writing a

4. ### Mathematical Induction

Use mathematical induction to prove that the following is true. 8+11+14...+(3n+5)=1/2n(3n+13), for all n in the set of natural numbers.

1. ### computer sciece(Computation Theory)

Find the error in the following proof that all horses are the same color. CLAIM: In any set of h horses, all horses are the same color. PROOF: By induction on h. Basis: For h = 1. In any set containing just one horse, all horses

2. ### MATh

Prove by mathematical induction that 1+3+5+7+......+(2n-1)=n²

3. ### algebra

Prove by mathematical induction that x^2n - y^2n has a factor of x+y. My answer is incomplete since i do not know what to do next. here it is: i.) for n=1 x^2(1) - y^2(1) = x^2 - y^2 = (x+y)(x-y) ii.) Assume that the proposition

4. ### Math..mathematical induction

Prove by mathematical induction that 1+3+5+7+....+(2n-1)=n²

1. ### precalculus

Find Pk + 1 if Pk = 7 + 13 + 19 + ...+[6(k - 1)+1] + (6k + 1) 7 + 13 + 19 + …+[6(k - 1) + 1] + (6k + 1) + [6(k + 1) + 1] 8 + 14 + 20 + …+[7(k - 1) + 1] + (7k + 1) 7 + 13 + 19 + …+(6k + 1) 7 + 13 + 19 + ...+[6(k - 1) + 1] +

2. ### Computer proof

Prove by induction on all positive integer k that if m is any ordinary nfa with k states, and m has fewer than k - 1 transitions, then there exists a state of m that is not reachable. Let N be the λ-NFA: "L" for "λ" b >(1)