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 fn and fn, I get f2n.
You did not really say what n is yet.
Suppose I pick n=3.
Then I have f3, f6, f9, ...
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 <fn> which would have the generator fn.
However, the problem statement does not mention that cyclic group, does it?
Perhaps you can pick a specific n?
View Tag Cloud