Confirming your payment

Skip to content

Competency-Based Questions (CBQ) · Question 47 of 80

Four students 1,2,3,4 hand in tests for peer marking.

Question 471 markMCQHard

Four students 1,2,3,41,2,3,4 hand in tests for peer marking. A marking plan is a function f:{1,2,3,4}→{1,2,3,4}f:\{1,2,3,4\}\to\{1,2,3,4\}: student xx marks the test of student f(x)f(x). The teacher wants a plan that undoes itself: if the plan is applied twice, every test comes back to its owner, that is

(f∘f)(x)=xfor every x∈{1,2,3,4}.(f\circ f)(x)=x\quad\text{for every }x\in\{1,2,3,4\}.

Nothing else is assumed about ff. How many such plans ff are there, and what kind of function is each one?

Select your answer
  • (A) 1010, and every one of them is a bijection

    Correct answer
  • (B) 2424, and every one of them is a bijection

  • (C) 77, and every one of them is a bijection

  • (D) 44, and every one of them is a bijection