Examiner's comment
Another fresh topic to the new specification, but once again it was answer well by most, certainly part (i). It is clear that the new topics have been covered well in preparing candidates for the exam. In part (i) the most common score profile was M1 M1 A0 A1. The general outline of the proof was attempted well, but many lacked the rigour required as they did not achieve suitable expressions for the expansions to verify both yielded the same. The definition of associativity was understood by nearly all of the candidates sitting the paper, but a small number of them gave a numerical example of it working for once case, rather than a proof. A single example will be required in order to show an operation is not associative, but is not sufficient to prove an operation is. Part (ii) is where the most of the difficulty in this question lay. For part (a) many candidates realised the group was cyclic since 3 (only a small number used 5) was a generator, but some merely stated this was so because its order is 6 and did not show how it generated the rest of the group. Those who listed the powers of 3 (or 5) would usually gain both marks for completing the argument that the group was cyclic. Others assumed that writing out the group tables was proof of being cyclic. Identifying the subgroups in part (b) produced a variety of response, but usually scoring two of the available marks. The subgroup {1, 17} was usually identified correctly, but {1,7,13} was sometimes missed, as were one or other of {1} and H itself. many also identified spurious subgroups such as {1,5}, {1,7}, {1,13} and so on, assuming 1 and any element formed a subgroup. Nevertheless, many were able to identify the three correct subgroups and no others. Part (c) proved provided the most challenge for candidates in this question. Most commonly either 3 or 0 marks were scored on this part as candidates either knew what to do and got it correct, or did not even know where to start. Many would just match up elements in ascending order, which did not gain access to marks. Others attempted to explain what an isomorphism is in general terms rather than identify a specific isomorphism for the group. There were some good attempts at defining mappings algebraically by identifying that powers of a generator needed to map to powers of a generator. Candidates attempting such an approach usually scored well. Partially correct attempts at this approach tended to stem from attempting to match elements by order, which would give correct pairings 1→ 1 and 6 → 17 and that {2,4} → {7, 13} and {3,5} → {5,11}, but would then choose incorrect pairings for the latter two elements for their pairings for {2,4}. Some did not make a selection at all, but left the set-wise mappings, which was not sufficient information to identify an isomorphism.