Prove that for all integers n > 0, 8n – 3n is divisible by 5. check my answer?

At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get our expert's

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this and thousands of other questions.

A community for students.

Prove that for all integers n > 0, 8n – 3n is divisible by 5. check my answer?

Mathematics
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this and thousands of other questions

Base Case: n=1 8^1-3^1=5 5/5=1 Induction Hypothesis: 8^k-3^k is divisible by 3 8^(k+1)-3^(k+1) 8^(2)-3^(2) 64-9=53 53/3
I think you meant to say `Induction Hypothesis: 8^k-3^k is divisible by 5`
if we assume that claim is true, then we can say 8^k-3^k = 5q where q is some integer. Agreed?

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

what is the significance of 5q??
it just means "5 times some integer"
if I said "100 is divisible by 5" I can state that as 100 = 5q In this case, q = 20
ok, yeah. so that just means divisible by 5
yeah
the goal is to prove that if 8^k-3^k = 5q is assumed to be true, then 8^(k+1)-3^(k+1) = 5s where q and s are integers
here are 2 hints: 1) isolate the `8^k` in `8^k-3^k = 5q` to get `8^k = 5q + 3^k` 2) break down `8^(k+1)-3^(k+1) ` into `8*8^k-3*3^k`
i do not understand.8^(k+1) is just 64, no? not 64^K?
how are you getting 64? you can't replace k with 1
i didn't know i couldn't do that.
you can replace k with 1 if you wanted to prove that specific piece. But we're trying to prove the whole thing in general (for any number k)
do you see how I turned `8^(k+1)-3^(k+1)` into `8*8^k-3*3^k` ?
no, that was my next question. i thought k+1 would turn into ^2
recall that \[\LARGE x^{y+z} = x^y * x^z\]
so \[\Large 8^{k+1} = 8^k*8^1 = 8^k*8 = 8*8^k\] make sense?
yes. thank you. and now i have to do the same thing for the other side, right?
for the 3^(k+1) part you mean? yes
ok, so i just get 3^k*3+5q=6k+5q
we have 8*8^k-3*3^k now replace the 8^k with 5q + 3^k 8*8^k-3*3^k 8*(5q + 3^k) - 3*3^k 8*5q + 8*3^k - 3*3^k do you see what's next?
multiply
40q + 24^k - 9^k 40q + 15^k
8*3^k isn't equal to 24^k
8*5q + 8*3^k - 3*3^k 5*8q + 8*3^k - 3*3^k 5*8q + (8*3^k - 3*3^k) 5*8q + (8 - 3)*3^k 5*8q + 5*3^k 5*(8q + 3^k) 5*s where s = 8q + 3^k and s is an integer. So this all proves that if 8^k - 3^k = 5q, then 8^(k+1)-3^(k+1) = 5s q and s are integers
im going to have to study that, tomorrow. can you look at a different kind of problem with me?
sure
1^3 + 2^3 + 3^3 + … + n^3 = n^2(n + 1)^2/4 for all positive integers n
I'm sure you have the base case already done?
no. i just started looking at it. i have not tried solving a sequence kind of problem yet.
n^2(n^2+1)/4
you'll use induction here
i have less idea about this problem then i did the last :|
the base case is n = 1
prove that is true

Not the answer you are looking for?

Search for more explanations.

Ask your own question