Set problem. Need it well written...
We have $k,m \in \N^*$. Define two sets U and V by:
U = {$a \in \Z  1 \leq a \leq m, gcd(a,m) = 1$}
V = {$a \in \Z  1 \leq a \leq km, gcd(a,km) = k$}
a. We have $a \in U$. Show that $ka \in V$
b. Thanks to (a.) we can define a function $f: U \to V$ by $a \to ka$. Show that f is a bijection.
You can use, without proof, the solution: for $k,x,y \in \Z, gcd(kx,ky) = kgcd(x,y)$
Answer
Answers can be viewed only if
 The questioner was satisfied and accepted the answer, or
 The answer was disputed, but the judge evaluated it as 100% correct.

perfect. I was struggling to word a solution like you did. Thanks a lot.
The answer is accepted.
 answered
 87 views
 $8.00
Related Questions
 InclusionExclusion and Generating Function with Coefficient (and Integer Equation)
 Recursive Set
 Souslin operation
 Find a system consisting of two sets, neither of which is a subset of the other
 Discrete Math/ Set theory Question
 Proof through inclusion (A∆B) ∪ A = A ∪ B
 Set Theory Question Help
 Number of Combinations Created from Restricting a Set