Interpretation of homomorphism question

  • Thread starter Thread starter physicsjock
  • Start date Start date
  • Tags Tags
    Interpretation
physicsjock
Messages
84
Reaction score
0
Hey,

I had this question I thought i answered but now I'm questioning if the group operation is supposed to be addition and not multiplication.

The question \varphi :\mathbb{Z}\to {{\mathbb{Z}}_{n}}\,\,\,\,\,where\,\,\varphi (a)=\text{Remainder}\left( \frac{a}{n} \right)

When I initially did it, I just mindlessly took the group operation to be multiplication where as it could be addition but it is not directly stated.

So do you guys think it would be multiplication to give
\varphi (a)\varphi (b)=\text{Remainder}\left( \frac{a}{n} \right)\times \text{Remainder}\left( \frac{b}{n} \right)

or addition to give

\varphi (a)+\varphi (b)=\text{Remainder}\left( \frac{a}{n} \right)+\text{Remainder}\left( \frac{b}{n} \right)

Either way its not a homomorphism but I want understand how it works properly.

Is the general way to write this \varphi (a)*\varphi (b) where * is the binary operation if the group the homomorphism is acting on unless given?

Thanks
 
Physics news on Phys.org
Reduction modulo n is a group homomorphism. Now check the group axioms for Z/nZ under multiplication to see if you have a group. That should answer your question.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top