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) = |k|gcd(x,y)$


Answers can only be viewed under the following conditions:
  1. The questioner was satisfied with and accepted the answer, or
  2. The answer was evaluated as being 100% correct by the judge.
View the answer
  • perfect. I was struggling to word a solution like you did. Thanks a lot.

The answer is accepted.
Join Matchmaticians Affiliate Marketing Program to earn up to a 50% commission on every question that your affiliated users ask or answer.