Purchase Solution

How to Prove a Theorem

Not what you're looking for?

Ask Custom Question

A simple theorem from number theory is proven to illustrate the concept of proof. Specifically, we prove that

For every n>2, there exist integers x, y such that x is congruent to y mod(n) and x is not congruent to -y mod(n).

Purchase this Solution

Solution Summary

In this solution,a simple theorem from number theory is proven to illustrate the concept of proof.

Solution Preview

For this problem, it is enough to find two integers x, y that satisfy the assertion of the theorem. It suffices to take:

(1) x = 1, and y = 1.

Clearly, 1 ...

Purchase this Solution


Free BrainMass Quizzes
Probability Quiz

Some questions on probability

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

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.