Group axioms and examples

Group axioms and examples Test

Spec 1.1–2 · Edexcel A-Level Further Maths: Subtopic test

Studying this course? Keep your progress in one place.

Two ways to do this test

Question by question

One question at a time. Each answer is marked the moment you hand it in, so you learn as you go. Drago helps if you get stuck. All 10 questions, or just 5.

Exam mode

The whole paper in one go, timed like the real exam. Nothing is marked until you hand it in, then you get every mark explained.

10 questions, 27 marks

Edexcel A-Level Further Maths

Group axioms and examples

Total 27 marks

Name

Class

Date

  1. 1
    The set G={1,3,5,7}G=\{1,3,5,7\} under multiplication modulo 8 is a group.
    (a)
    What is the inverse of 55 in GG?
    [1 mark]
    • A55
    • B33
    • C77
    • D11
    Show the mark scheme

    Mark scheme

    Answer: A
    (b)
    How many times does the identity element appear in the Cayley table of GG?
    [1 mark]
    • A11
    • B22
    • C33
    • D44
    Show the mark scheme

    Mark scheme

    Answer: D
    (c)
    Determine whether GG is a cyclic group, justifying your answer.
    [2 marks]
    Show the mark scheme

    Mark scheme

    M1: finds the powers of the non-identity elements: 32≡13^2\equiv1, 52≡15^2\equiv1, 72≡17^2\equiv1
    A1: every element other than the identity returns to
    11 after two steps, so no element generates all four elements; GG is not cyclic
    Accept: a complete Cayley table showing every element is self-inverse

    Total for question 1: 4 marks

  2. 2
    The set G={1,2,3,4,5,6}G=\{1,2,3,4,5,6\} under multiplication modulo 7 is a group.
    (a)
    What is the inverse of 33 in GG?
    [1 mark]
    • A22
    • B55
    • C44
    • D66
    Show the mark scheme

    Mark scheme

    Answer: B
    (b)
    Which of these elements generates GG?
    [1 mark]
    • A22
    • B44
    • C33
    • D66
    Show the mark scheme

    Mark scheme

    Answer: C
    (c)
    Show that the set {1,2,3,4,5}\{1,2,3,4,5\} under multiplication modulo 6 is not a group.
    [2 marks]
    Show the mark scheme

    Mark scheme

    B1: 2×3=6≡02\times3=6\equiv0 (or 3×4≡03\times4\equiv0)
    B1:
    00 is not in the set, so the set is not closed
    Accept:
    22 has no inverse, because 2×k2\times k is never ≡1(mod6)\equiv1\pmod6

    Total for question 2: 4 marks

  3. 3
    Let ee be the identity permutation of {1,2,3}\{1,2,3\}, let rr be the permutation 1→2, 2→3, 3→11\to2,\ 2\to3,\ 3\to1, and let ss be the permutation that swaps 11 and 22 and fixes 33. The product xyxy means apply yy first, then xx. The six permutations of {1,2,3}\{1,2,3\} form a group under this product.
    (a)
    Find rsrs and srsr, writing each as a permutation, and state what this shows about the group.
    [3 marks]
    Show the mark scheme

    Mark scheme

    B1: rsrs sends 1→31\to3, 2→22\to2, 3→13\to1, i.e. (1 3)(1\ 3)
    B1:
    srsr sends 1→11\to1, 2→32\to3, 3→23\to2, i.e. (2 3)(2\ 3)
    B1:
    rs≠srrs\neq sr, so the group is not commutative
    Accept: follow-through if the order of composition is stated clearly and used consistently
    (b)
    Find r−1r^{-1} and show that srs=r−1srs=r^{-1}.
    [4 marks]
    Show the mark scheme

    Mark scheme

    B1: r−1r^{-1} sends 1→31\to3, 2→12\to1, 3→23\to2, i.e. (1 3 2)(1\ 3\ 2)
    M1: composes
    srssrs step by step, applying ss, then rr, then ss
    A1:
    srssrs sends 1→31\to3, 2→12\to1, 3→23\to2
    A1: this equals
    r−1r^{-1}
    Accept:
    srs=s(rs)=(1 2)(1 3)srs=s(rs)=(1\ 2)(1\ 3) evaluated correctly

    Total for question 3: 7 marks

  4. 4
    Let G={0,1,2,3,4,5}G=\{0,1,2,3,4,5\} under addition modulo 6.
    (a)
    Show that GG satisfies the four group axioms.
    [6 marks]
    Show the mark scheme

    Mark scheme

    B1: closure: the sum of two elements modulo 6 is an integer from 00 to 55, so it is in GG
    B1: associativity: addition of integers is associative, and reducing modulo 6 preserves this

    B1: identity:
    00, since a+0≡aa+0\equiv a
    B1: inverse of
    00 is 00, and the inverse of a≠0a\neq0 is 6−a6-a (pairs 1↔51\leftrightarrow5, 2↔42\leftrightarrow4, with 33 self-inverse)
    B1: each inverse is in
    GG and a+(6−a)=6≡0a+(6-a)=6\equiv0
    B1: all four axioms hold, so
    GG is a group
    Accept: a complete Cayley table used to show closure and the inverses
    (b)
    Show that GG is cyclic by finding two different generators, and show that 22 is not a generator.
    [6 marks]
    Show the mark scheme

    Mark scheme

    M1: multiples of 11: 1,2,3,4,5,01,2,3,4,5,0
    A1: these are all six elements, so
    11 generates GG
    M1: multiples of
    55: 5,4,3,2,1,05,4,3,2,1,0
    A1: all six elements, so
    55 generates GG
    M1: multiples of
    22: 2,4,02,4,0
    A1: only three elements, so
    22 does not generate GG and GG is cyclic
    Accept: repeated addition of the element, or powers written as
    g,g2,…g,g^2,\ldots in multiplicative notation

    Total for question 4: 12 marks

End of questions

Subtopic tests