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.
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I ##(p^k -1) \equiv X \mbox{(mod p)}## via Wilson's theorem
Replies
2
Views
1K
I How to Prove a Congruence Relation for Prime Numbers?
Replies
17
Views
2K
I Proof regarding congruence relation
Replies
4
Views
2K
I Question on Primitive Roots and GCDs
Replies
2
Views
2K
I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?
Replies
48
Views
3K
I ##(A/\mathfrak{a})_{\mathfrak{p}/\mathfrak{a}}## and its isomorphism?
Replies
31
Views
1K
Verify that ## x\equiv a^{p-2}b\pmod {p} ## is a solution
Replies
6
Views
1K
[IntroNumTheory] Determining the remainder by using congruence
Replies
1
Views
1K
MHB Solving Congruences with Polynomials: A Prime Challenge
Replies
5
Views
3K
A question about quadratic residues
Replies
1
Views
3K

Hot Threads

Recent Insights

Back
Top