Purchase Solution

Discrete math proofs

Not what you're looking for?

Ask Custom Question

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

Attachments
Purchase this Solution

Solution Summary

There are two proofs; on regarding odd integers and one regarding divisibility.

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 ...

Purchase this Solution


Free BrainMass Quizzes
Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.