User interface language: English | Español

Date November 2014 Marks available 4 Reference code 14N.3srg.hl.TZ0.3
Level HL only Paper Paper 3 Sets, relations and groups Time zone TZ0
Command term Find and List Question number 3 Adapted from N/A

Question

Consider the set \(A\) consisting of all the permutations of the integers \(1,2,3,4,5\).

Two members of \(A\) are given by \(p = (1{\text{ }}2{\text{ }}5)\) and \(q = (1{\text{ }}3)(2{\text{ }}5)\).

Find the single permutation which is equivalent to \(q \circ p\).

[4]
a.

State a permutation belonging to \(A\) of order

(i)     \(4\);

(ii)     \(6\).

[3]
b.

Let \(P = \) {all permutations in \(A\) where exactly two integers change position},

and \(Q = \) {all permutations in \(A\) where the integer \(1\) changes position}.

(i)     List all the elements in \(P \cap Q\).

(ii)     Find \(n(P \cap Q')\).

[4]
c.

Markscheme

\(q \circ p = (1{\text{ }}3)(2{\text{ }}5)(1{\text{ }}2{\text{ }}5)\)     (M1)

\( = (1{\text{ }}5{\text{ }}3)\)     M1A1A1

 

Note:     M1 for an answer consisting of disjoint cycles, A1 for \((1{\text{ }}5{\text{ }}3)\),

A1 for either \((2)\) or \((2)\) omitted.

 

Note:     Allow \(\left( {\begin{array}{*{20}{c}} 1&2&3&4&5 \\ 5&2&1&4&3 \end{array}} \right)\)

If done in the wrong order and obtained \((1{\text{ }}3{\text{ }}2)\), award A2.

[4 marks]

a.

(i)     any cycle with length \(4\) eg (\(1234\))     A1

(ii)     any permutation with \(2\) disjoint cycles one of length \(2\) and one of length \(3\) eg (\(1\) \(2\)) (\(3\) \(4\) \(5\))     M1A1

 

Note:     Award M1A0 for any permutation with \(2\) non-disjoint cycles one of length \(2\) and one of length \(3\).

Accept non cycle notation.

[3 marks]

b.

(i)     (\(1\), \(2\)), (\(1\), \(3\)), (\(1\), \(4\)), (\(1\), \(5\))     M1A1

(ii)     (\(2\) \(3\)), (\(2\) \(4\)), (\(2\) \(5\)), (\(3\) \(4\)), (\(3\) \(5\)), (\(4\) \(5\))     (M1)

6     A1

 

Note:     Award M1 for at least one correct cycle.

[4 marks]

Total [11 marks]

c.

Examiners report

Many students were unable to start the question, seemingly as they did not understand the cyclic notation. Many of those that did understand found it quite straightforward to obtain good marks on this question.

a.

Many students were unable to start the question, seemingly as they did not understand the cyclic notation. Many of those that did understand found it quite straightforward to obtain good marks on this question.

b.

Many students were unable to start the question, seemingly as they did not understand the cyclic notation. Many of those that did understand found it quite straightforward to obtain good marks on this question.

c.

Syllabus sections

Topic 8 - Option: Sets, relations and groups » 8.10 » Permutations under composition of permutations.

View options