Question

Prove: 13n - 6n is divisible by 7

Prove: 13n - 6n is divisible by 7

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Prove that 7^(n) − 1 is divisible by 6, for every positvie integer n
Prove that 7^(n) − 1 is divisible by 6, for every positvie integer n
Use mathematical induction to prove 7^(n) − 1 is divisible by 6, for each integer n...
Use mathematical induction to prove 7^(n) − 1 is divisible by 6, for each integer n ≥ 1.
Prove that every prime greater than 3 can be written in the form 6n+ 1 or...
Prove that every prime greater than 3 can be written in the form 6n+ 1 or 6n+ 5 for some positive integer n.
Prove that every prime greater than 3 can be written in the form 6n + 1...
Prove that every prime greater than 3 can be written in the form 6n + 1 or 6n + 5 for some positive integer n.
Consider the following expression: 7^n-6*n-1 Using induction, prove the expression is divisible by 36. I understand...
Consider the following expression: 7^n-6*n-1 Using induction, prove the expression is divisible by 36. I understand the process of mathematical induction, however I do not understand how the solution showed the result for P_n+1 is divisible by 36? How can we be sure something is divisible by 36? Please explain in great detail.
Prove that an integer is divisible by 2 if and only if the digit in the...
Prove that an integer is divisible by 2 if and only if the digit in the units place is divisible by 2. (Hint: Look at a couple of examples: 58 = 5 10 + 8, while 57 = 5 10 + 7. What does Lemma 1.3 suggest in the context of these examples?) (Lemma 1.3. If d is a nonzero integer such that d|a and d|b for two integers a and b, then for any integers x and y, d|(xa...
A number n is divisible by 7 if, when we form an alternating sum of blocks...
A number n is divisible by 7 if, when we form an alternating sum of blocks of three from right to left, we obtain a multiple of 7 (e.g., if n = 100, 200, 240, then we consider 240−200+100 = 140, which is divisible by 7). Prove the statement.
Prove that √3 is irrational. You may use the fact that n2 is divisible by 3...
Prove that √3 is irrational. You may use the fact that n2 is divisible by 3 only if n is divisible by 3. Prove by contradiction that there is not a smallest positive rational number.
Prove the following by contraposition: If the product of two integers is not divisible by an...
Prove the following by contraposition: If the product of two integers is not divisible by an integer n, then neither integer is divisible by n. (Match the Numbers With the Letter to the right) 1 Contraposition ___ A x = kn where k is also an integer 2 definition of divisible ___ B xy is divisible by n 3 by substitution ___ C xy = (kn)y 4 by associative rule ___ D If the product of two integers is not...
1. Prove that an integer a is divisible by 5 if and only if a2 is...
1. Prove that an integer a is divisible by 5 if and only if a2 is divisible by 5. 2. Deduce that 98765432 is not a perfect square. Hint: You can use any theorem/proposition or whatever was proved in class. 3. Prove that for all integers n,a,b and c, if n | (a−b) and n | (b−c) then n | (a−c). 4. Prove that for any two consecutive integers, n and n + 1 we have that gcd(n,n + 1)...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT