Purchase Solution

Congruence of Integers (Prove)

Not what you're looking for?

Ask Custom Question

Prove the following:

Prove that if m is an integer, then either m^2 = 0 ( mod 4) or m^2 =1 (mod 4).
Hint: Consider that cases where m is even and where m is odd

Purchase this Solution
Solution Summary

The solution assists with proving the congruence of integers.

Purchase this Solution
Free BrainMass Quizzes
Graphs and Functions

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

Solving quadratic inequalities

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

Probability Quiz

Some questions on probability

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.

View More Free Quizzes
Related BrainMass Solutions

  • Congruences, Primitive Roots, Indices and Table of Indices

    Given that g is a primitive root modulo m, prove the following... 7. Construct a table of indices of all integers from.... 8. Solve the congruence 9x≡11(mod 17) using the table in 7. 9.

  • Congruences : Primes, Inverse Modulo, GCD and Wilson's theorem

    (note that g must divide n because g = gcd (c,n) so that n/g is an integer) Then a = b + kn/g for some integer k (definition of congruence) So ac = bc + kcn/g (multiplication, integers so we can commute and associate) Since g = gcd (c,n), g divides

  • Euclidean algorithm

    Find the number of solutions of ths congruence among integers in the range 0≤x≤104 by resorting to the Chiness Reminder Theorem Clarification: you are not asked to list all solutions.

  • Finding Solutions of Congruence

    Factor the left-hand side of the congruence; show that a solution of the quadratic congruence is a solution of one of two different linear congruence's.]

  • Discrete Math: Binary Relations

    (optional) Make and prove a conjecture about which integers are related by T to 0, which integers are related by T to 1, and which integers are related by T to 2. 9. Let X = {a, b, c}. Recall that P(X) is the power set of X.

  • Congruence Functions Solved

    Solving the congruence 42x 12 (mod 90) is equivalent to solving the equation 42x = 12 + 90q for integers x and q. This reduces to 7x = 2 + 15q, or 7x 2 (mod 15).

  • Cryptography, congruences, and primes

    According to the Chinese Remainder Theorem, the solution of the system of congruence equations is (mod ) Therefore, we get (mod ) (b) The condition in (a) that and are relatively prime is necessary.

  • Chinese Remainder Theorem : Proof and Problems

    (a) (1) State and prove the Chinese Remainder Theorem. (ii) Find the 2 smallest positive integer solutions of the simultaneous set of congruence equations: 2x=3 (mod 5) 3x=4 (mod 7) x=5 (mod8) (b) Let p be a prime and a a positive integer.

  • Quadratic congruences

    Hence all solutions of the congruence are all integers congruent to 2 modulo 7. (b) x2 ≡ 55 (mod 179) Means we are looking for x such that x2 - 55 = 179k, k being an integer.

View More Related Solutions