I can generate the sum of all integers and x. I meant to show that has an inverse,
Follow Math Help Forum on Facebook and Google+
Hmm, if I compose f_{n} and f_{n}, I get f_{2n}. You did not really say what n is yet. Suppose I pick n=3. Then I have f_{3}, f_{6}, f_{9}, ... Not sure if I get all elements then...?
Errr. Rather The group is, please correct my notation here. is The generator would be x + n? That is for all x in reals, for some integer n, I can generate sum of x and all integer multiples of n.
That would be correct. The notation would be <f_{n}> which would have the generator f_{n}. However, the problem statement does not mention that cyclic group, does it? Perhaps you can pick a specific n?
View Tag Cloud