Solving Congruences: Proving a=b

  • Thread starter Thread starter ninjagod123
  • Start date Start date
ninjagod123
Messages
7
Reaction score
0
Show that if a \equiv b mod p for all primes p, then a = b.
 
Physics news on Phys.org
Well, a - b must be divisible by all primes p. What is the only way for this to happen?
 
JSuarez said:
Well, a - b must be divisible by all primes p. What is the only way for this to happen?

Oh hmmm...

The only way is if (a - b) is zero. How would I formally write this up? I guess a - b can't be the product of all primes?
 
Every nonzero integer can only be divisible by a finite number of primes.
 
ninjagod123 said:
I guess a - b can't be the product of all primes?

In a sense, that's what 0 is. It's the "infinity" of the divisibility relation.
 
If a> b then a- b is a positive number. Since there are an infinite number of primes, there exist a prime, p> a- b. Then p cannot divide a- b so a\ne b (mod p).

If b> a just use b- a instead of a- b.
 
The world of 2\times 2 complex matrices is very colorful. They form a Banach-algebra, they act on spinors, they contain the quaternions, SU(2), su(2), SL(2,\mathbb C), sl(2,\mathbb C). Furthermore, with the determinant as Euclidean or pseudo-Euclidean norm, isu(2) is a 3-dimensional Euclidean space, \mathbb RI\oplus isu(2) is a Minkowski space with signature (1,3), i\mathbb RI\oplus su(2) is a Minkowski space with signature (3,1), SU(2) is the double cover of SO(3), sl(2,\mathbb C) is the...
Back
Top