Discrete math proofs
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
© BrainMass Inc. brainmass.com March 4, 2021, 6:41 pm ad1c9bdddfhttps://brainmass.com/math/discrete-math/discrete-math-proofs-56814
Solution Preview
1) Prove that if n is an odd integer then n2 = 1 mod 8
We know that iff divides i.e. there exists integers such that .
Solution: We have to prove that for each odd integer which is equivalent to prove that for as every odd integer can be represented as for some .
We prove the above using Mathematical ...
Solution Summary
There are two proofs; on regarding odd integers and one regarding divisibility.
$2.49