Diophantine and coprime solutions x,y

  • Thread starter Thread starter thomas430
  • Start date Start date
thomas430
Messages
16
Reaction score
0
Hi everyone,

I saw that for the linear diophantine equation d=ax+by, where d=(a,b), that x and y must be coprime.

Why is this? I feel like there are properties of coprime numbers that I am not aware of, because there are a few things like this that I have encountered.

Any help appreciated :-)


Thomas.
 
Physics news on Phys.org
If x and y are NOT coprime, that is, if x= mu and y= mv for some integers m, u, and v, then the Diophantine equation becomes d= amu+ bmv= m(au+bv). Since the right hand side is divisible by m, the left side, d, must be also, say, d= mc. Then we could divide the entire equation by m to get the simpler equation c= au+ bv. But since d= (a,b) that is impossible.
 
Oh! So d /should/ divide c, because d=(a,b)... but this contradicts d=mc, which suggests d cannot divide c, as d > c. (as m>1 because m=(x,y) and we said that (x,y) != 1)

Thanks, HallsofIvy :-)
 
##\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...
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...
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...
Back
Top