1) Prove that if n is an odd integer then n2 = 1 mod 8
( I suppose I would need to examine the case where k is odd and k is
even.. but I am getting stuck along the way..)
2) Prove that 5n+3 is divisible by 4 for all integers n>=0
I can’t seem to complete this properly I get to something in the likes
of 5k+5k+3 and I don’t know what to do next.. I need a proper walk
through
Mathematics Homework Solutions
#56814
Discrete mathematics
Proper walk through of following proofs required ( for a better understanding )
---
1) Prove that if n is an odd integer then n2 = 1 mod 8
2) Prove that 5n+3 is divisible by 4 for all integers n>=0
There are two proofs; on regarding odd integers and one regarding divisibility.
What is this?
By OTA - Overall OTA Rating
Departed OTA
Purchase Cost Now
$2.19 CAD (was ~$15.96)
Included in Download
- Plain text response
- Attached file(s):
- Proofs2Q[1].doc
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- A proof and a solution involving a Diophantine equation - Show that the Diophantine equation x^2-y^2=n is solvable in integers if and only if n is odd or n is divisible by 4. When this equation is solvable, find all integer solutions.
- Discrete mathematics proofs - 1) Prove that all integers a,b,p, with p>0 and q>0 that ((a+b) mod p)mod q = (a mod p) mod q + (b mod p) mod q Or give a counterexample 2) prove for all integers a,b,p,q with p>0 and q>0 that ( ...
- Prove that 7^n - 6n-1 is divisible by 36 for all positive integers n. - Prove that 7^n - 6n-1 is divisible by 36 for all positive integers n.
- Theory of Numbers - Euclid's Division Lemma - Theory of Numbers - Euclid's Division Lemma (a) Prove that if a and b are odd integers , then a2 - b2 is divisible by 8. (b) Prove that if a is an odd integer, then { a2 + (a + 2)2 + (a + 4 ...
- Proofs using the mod function. - Prove that ((ax mod M) +b) mod M = (ax + b) mod M when M is a positive integer, and a, b and x are nonnegative integers.
