Confirming your payment

Skip to content

Opening your dashboard

Class 12 Maths Chapter 1 Relation and Functions: Competency-Based Questions (CBQ)

80 questions on Chapter 1, each worked through on its own page with the AI tutor. Class 12 Maths, CBSE 2026-27.

80 questions

1–4 marks · Mixed difficulty

  1. 1

    Question 1

    A college library keeps four books on one shelf. Their lengths are recorded below.

    BookNumber of pages
    B1B_1120
    B2B_295
    B3B_3120
    B4B_495

    On the set A={B1,B2,B3,B4}A=\{B_1,B_2,B_3,B_4\} the librarian relates two books exactly when they have the same number of pages, and calls this relation RR. It is an equivalence relation.

    How many ordered pairs does RR contain, and how many distinct equivalence classes does it have?

    MCQEasy
    1 mark
  2. 2

    Question 2

    A hostel warden must allot rooms to 44 students. The hostel has 66 rooms, and every student is given exactly one room, so an allotment is a function f:S→Rf:S\to R, where SS is the set of 44 students and RR is the set of 66 rooms.

    The warden wants an allotment in which no room is left empty.

    Which statement is correct?

    MCQMedium
    1 mark
  3. 3

    Question 3

    Four members of a study group are labelled 1,2,3,41,2,3,4. The messaging app records the relation

    R={(1,1),(2,2),(3,3),(4,4),(1,3),(3,4)}R=\{(1,1),(2,2),(3,3),(4,4),(1,3),(3,4)\}

    on the set A={1,2,3,4}A=\{1,2,3,4\}, where (a,b)∈R(a,b)\in R means that aa has messaged bb.

    The moderator wants to enlarge RR to the smallest equivalence relation on AA that contains it. What is the least number of ordered pairs that must be added?

    MCQMedium
    1 mark
  4. 4

    Question 4

    A school timetable puts each of the three subjects Physics (PP), Chemistry (CC) and Maths (MM) into exactly one slot. From any such timetable one can read off the relation RR on {P,C,M}\{P,C,M\} given by: x R yx\,R\,y whenever xx is scheduled in the same slot as yy.

    Four clerks each handed in a list for RR, but only one of the lists could have come from a real timetable.

    R1={(P,P),(C,C),(M,M),(P,C)}R_1=\{(P,P),(C,C),(M,M),(P,C)\}

    R2={(P,P),(C,C),(M,M),(P,C),(C,P),(C,M),(M,C)}R_2=\{(P,P),(C,C),(M,M),(P,C),(C,P),(C,M),(M,C)\}

    R3={(P,P),(C,C),(M,M),(P,M),(M,P)}R_3=\{(P,P),(C,C),(M,M),(P,M),(M,P)\}

    R4={(P,C),(C,P),(M,M)}R_4=\{(P,C),(C,P),(M,M)\}

    Which list is it, and how many slots does that timetable use?

    MCQMedium
    1 mark
  5. 5

    Question 5

    A sun-tracking mirror slowly drifts out of alignment. Its alignment error, in arc-minutes, tt hours after solar noon is modelled by

    E(t)=t4,t∈[−2, 2]E(t)=t^4,\qquad t\in[-2,\,2]

    so t=−2t=-2 is two hours before noon and t=2t=2 is two hours after. The day's log already shows the reading E=1E=1 occurring at two different times. Later in the log the reading E=16E=16 appears.

    How many times tt in [−2,2][-2,2] give the reading E=16E=16, and is EE one-one when the window is cut down to [0,2][0,2]?

    MCQMedium
    1 mark
  6. 6

    Question 6

    A blood bank lists four donors, one of each red-cell type: OO, AA, BB and ABAB. For red cells the compatibility rule is:

    • OO can be given to OO, AA, BB and ABAB
    • AA can be given to AA and ABAB
    • BB can be given to BB and ABAB
    • ABAB can be given to ABAB only

    On the set T={O,A,B,AB}T=\{O,A,B,AB\} define x R yx\,R\,y to mean that type xx can be given to type yy.

    How many ordered pairs does RR contain, and which of reflexivity, symmetry and transitivity does RR have?

    MCQMedium
    1 mark
  7. 7

    Question 7

    A town runs three bus routes. Route r1r_1 runs between the termini AA and BB, route r2r_2 between BB and CC, and route r3r_3 between CC and DD. The four termini AA, BB, CC, DD are all different places.

    On the set {r1,r2,r3}\{r_1,r_2,r_3\} define x S yx\,S\,y to mean that routes xx and yy have at least one terminus in common.

    Is SS transitive, and how many ordered pairs does SS contain?

    MCQEasy
    1 mark
  8. 8

    Question 8

    Let XX be a finite set and let f:X→Xf:X\to X be a function.

    Given below are two statements based on the above context — one labelled Assertion and the other labelled Reason. Read the statements carefully and choose the option that correctly describes them.

    Assertion: If ff is onto, then ff is one-one, and if ff is one-one, then ff is onto.

    Reason: Every one-one function is always onto, and every onto function is always one-one.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Medium
    1 mark
  9. 9

    Question 9

    A lamp stands at the origin of a number line. The illumination it produces at the point xx metres from the origin is modelled by f(x)=1x2f(x) = \dfrac{1}{x^2}, so the domain of ff is R−{0}\mathbb{R} - \{0\}.

    Assertion: If only the codomain of ff is changed, from R\mathbb{R} to (0,∞)(0, \infty), the domain staying R−{0}\mathbb{R} - \{0\} and the rule staying f(x)=1x2f(x) = \dfrac{1}{x^2}, then ff becomes an onto function.

    Reason: f(−2)=f(2)=14f(-2) = f(2) = \dfrac{1}{4}, so ff is a many-one function.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Medium
    1 mark
  10. 10

    Question 10

    In a four-a-side cricket match the batters PP, QQ, RR and SS scored 4545, 6262, 6262 and 3030 runs respectively. On the set A={P,Q,R,S}A = \{P, Q, R, S\} define a T ba \, T \, b if and only if aa scored more runs than bb.

    Assertion: This relation TT is transitive, but it is neither reflexive nor symmetric.

    Reason: Whenever a relation is defined by a strict inequality between numerical values, its failure to be reflexive forces it to fail to be transitive as well.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Medium
    1 mark
  11. 11

    Question 11

    A courier company runs overnight one-way trucks between four hubs PP, QQ, RR and SS. Exactly five trucks run: one from PP to QQ, one from QQ to PP, one from QQ to RR, one from RR to SS and one from SS to RR. On the set A={P,Q,R,S}A = \{P, Q, R, S\} define a T ba \, T \, b if and only if some truck goes directly from hub aa to hub bb.

    Assertion: For this network TT is not reflexive and not transitive, but it is symmetric.

    Reason: (P,Q)∈T(P, Q) \in T and (Q,P)∈T(Q, P) \in T.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Easy
    1 mark
  12. 12

    Question 12

    A courier hub handles parcels in two stages. Stage 1 drops each of 66 parcels into one of 44 sorting bins. Stage 2 loads each bin onto one of 33 delivery vans. Write PP for the set of parcels, BB for the set of bins and VV for the set of vans. Then stage 1 is a function f:P→Bf:P\to B, stage 2 is a function g:B→Vg:B\to V, and parcel pp ends up on van (g∘f)(p)(g\circ f)(p).

    One morning the manager notes that every van carries at least one parcel, that is, g∘f:P→Vg\circ f:P\to V is onto.

    Given below are two statements based on the above context, one labelled Assertion and the other labelled Reason. Read the statements carefully and choose the option that correctly describes them.

    Assertion: On that morning gg must be onto, and at least 33 of the 44 bins must hold a parcel.

    Reason: For every van vv there is a parcel pp with v=g(f(p))v=g(f(p)), so vv is the image under gg of the bin f(p)f(p), a bin that holds the parcel pp.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Medium
    1 mark
  13. 13

    Question 13

    At the end of a unit test a teacher of a class of six students, S={s1,s2,s3,s4,s5,s6}S=\{s_1,s_2,s_3,s_4,s_5,s_6\}, converts marks into one of the three grades in G={A,B,C}G=\{A,B,C\} using a fixed band: a score of 8080 or more earns grade AA, a score from 6060 to 7979 earns grade BB, and a score below 6060 earns grade CC. The six scores, taken in the order s1s_1 to s6s_6, were 9191, 7878, 6464, 8282, 5555 and 7070. Let g:S→Gg:S\to G be the map that sends each student to the grade the band awards for that student's score.

    Attempt any four of the following five sub-questions.

    (a) Write gg in roster form, as a set of ordered pairs.

    (b) Is gg one-one? Support your answer with a specific pair of students.

    (c) Is gg onto GG? Justify by comparing the range of gg with GG.

    (d) How many students lie in the set g−1(B)={s∈S:g(s)=B}g^{-1}(B)=\{s\in S: g(s)=B\}? List that set.

    (e) The teacher wonders whether the three bands could be redrawn — keeping the same six scores and the same three grades — so that gg becomes one-one. Explain why this is impossible.

    Medium
    4 marks
  14. 14

    Question 14

    Sherlin and Danji are playing Ludo at home. Every time the die is rolled, the outcome belongs to the set B={1,2,3,4,5,6}B=\{1,2,3,4,5,6\}. Sherlin's sister Raji sits beside them and notes down what she sees. Let AA be the set of the two players and BB the set of all possible outcomes of a throw, so that

    A={S,D},B={1,2,3,4,5,6}.A=\{S,D\},\qquad B=\{1,2,3,4,5,6\}.

    Raji spends the game studying relations on BB and counting the ways the two players can be paired with outcomes.

    Attempt any four of the following five sub-questions.

    (a) Let RR be the relation on BB defined by R={(x,y):y is divisible by x}R=\{(x,y): y \text{ is divisible by } x\}. Which of the following is true for RR?

    (A) Reflexive and transitive but not symmetric

    (B) Reflexive and symmetric but not transitive

    (C) Not reflexive but symmetric and transitive

    (D) Equivalence

    (b) Raji wants to know the number of functions from AA to BB. How many are possible?

    (A) 626^2

    (B) 262^6

    (C) 6!6!

    (D) 222^2

    (c) Let RR be the relation on BB given by R={(1,2),(2,2),(1,3),(3,4),(1,5),(4,5)}R=\{(1,2),(2,2),(1,3),(3,4),(1,5),(4,5)\}. Then RR is

    (A) Symmetric

    (B) Reflexive

    (C) Transitive

    (D) None of these three

    (d) Raji wants to know the number of relations possible from AA to BB. How many are possible?

    (A) 626^2

    (B) 262^6

    (C) 6!6!

    (D) 2122^{12}

    (e) Over one whole game Raji records the pairs of outcomes R={(1,1),(2,2),(3,3),(4,4),(5,5),(6,6),(1,2),(4,5),(5,6),(4,6)}R=\{(1,1),(2,2),(3,3),(4,4),(5,5),(6,6),(1,2),(4,5),(5,6),(4,6)\} on BB. Then RR is

    (A) Symmetric

    (B) Reflexive and transitive

    (C) Transitive and symmetric

    (D) An equivalence relation

    Medium
    4 marks
  15. 15

    Question 15

    A bottling plant tests every crate that leaves the line. A sensor produces a raw reading xx, measured in millivolts, and the rig converts that reading into a quality score by the rule f(x)=3x−4f(x)=3x-4, where the reading may be any real number and the score is recorded as a real number. The shift supervisor logs only the scores, not the raw readings, so at the end of a shift she has to work backwards from a logged score to the reading that produced it. An older rig in the next hall uses the same rule, but both its readings and its scores are always whole numbers.

    Attempt any four of the following five sub-questions.

    (a) Show that f:R→Rf:\mathbb{R}\to\mathbb{R}, f(x)=3x−4f(x)=3x-4, is one-one.

    (b) Show that ff is onto R\mathbb{R}, that is, that every score the log could contain is actually achievable.

    (c) Write the formula the supervisor should use to recover a raw reading from a logged score.

    (d) One crate is logged with a score of 1111. Find its raw reading, and check your answer in the rule for ff.

    (e) The older rig is the map h:Z→Zh:\mathbb{Z}\to\mathbb{Z}, h(x)=3x−4h(x)=3x-4. Decide whether hh is one-one and whether it is onto, justifying each answer.

    Medium
    4 marks
  16. 16

    Question 16

    A ticket counter has six windows, numbered 11 to 66. During a promotion, two windows aa and bb (not necessarily different) form a bonus pair when the product abab is even. On the set A={1,2,3,4,5,6}A=\{1,2,3,4,5,6\} this gives the relation

    R={(a,b)∈A×A: ab is even}R=\{(a,b)\in A\times A:\ ab \text{ is even}\}

    How many ordered pairs does RR contain, and which of the three properties (reflexive, symmetric, transitive) does RR have?

    MCQMedium
    1 mark
  17. 17

    Question 17

    A weather station logged five daily temperature deviations, in degrees Celsius, forming the set A={−3,−1,0,1,3}A = \{-3, -1, 0, 1, 3\}. Its software reports the "energy" of a deviation as the square of the deviation, giving the function f:A→{0,1,9}f : A \to \{0, 1, 9\}, f(x)=x2f(x) = x^2.

    Assertion: This ff is many-one and onto.

    Reason: Exactly two pairs of distinct elements of AA have equal squares, namely f(−1)=f(1)=1f(-1) = f(1) = 1 and f(−3)=f(3)=9f(-3) = f(3) = 9, and every element of {0,1,9}\{0, 1, 9\} is the square of some element of AA.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Medium
    1 mark
  18. 18

    Question 18

    A recurring-deposit scheme credits n3n^3 rupees to an account in month nn, for every n∈Nn \in \mathbb{N}. The credit is therefore the function f:N→Nf : \mathbb{N} \to \mathbb{N}, f(n)=n3f(n) = n^3.

    Assertion: This ff is one-one but not onto.

    Reason: The function g:R→Rg : \mathbb{R} \to \mathbb{R} given by g(x)=x3g(x) = x^3 is both one-one and onto.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Medium
    1 mark
  19. 19

    Question 19

    A vending machine has three buttons, 11, 22 and 33, and can dispense three products: Chips, Juice and Nuts. A technician tests four machines and records the wiring of each as a set of (button, product) pairs.

    MachineRecorded pairs
    L1L_1(1, Chips)(1,\ \mathrm{Chips}), (2, Juice)(2,\ \mathrm{Juice})
    L2L_2(1, Chips)(1,\ \mathrm{Chips}), (2, Juice)(2,\ \mathrm{Juice}), (2, Nuts)(2,\ \mathrm{Nuts}), (3, Chips)(3,\ \mathrm{Chips})
    L3L_3(1, Nuts)(1,\ \mathrm{Nuts}), (2, Nuts)(2,\ \mathrm{Nuts}), (3, Juice)(3,\ \mathrm{Juice})
    L4L_4(1, Juice)(1,\ \mathrm{Juice}), (2, Chips)(2,\ \mathrm{Chips}), (3, Nuts)(3,\ \mathrm{Nuts})

    A wiring counts as a function from the set of buttons to the set of products. Which of the four wirings really are functions, and which of those are onto?

    MCQEasy
    1 mark
  20. 20

    Question 20

    A survey team must give each of 55 respondents exactly one category code, chosen from a list of 88 codes. Writing A={R1,R2,R3,R4,R5}A=\{R_1,R_2,R_3,R_4,R_5\} for the set of respondents and BB for the set of codes, the coding is a function f:A→Bf:A\to B with ∣A∣=5|A|=5 and ∣B∣=8|B|=8.

    When the coding is finished, the team counts how many distinct codes actually appear — that is, the number of elements in the range of ff.

    Which statement about that count is correct?

    MCQEasy
    1 mark
  21. 21

    Question 21

    A maintenance log numbers the hours of a long shift 0,1,2,…,120,1,2,\ldots,12, so the set of hours is

    A={x∈Z:0≤x≤12}A=\{x\in\mathbb{Z}:0\le x\le 12\}

    The machine repeats the same task every 44 hours, so the engineer relates two hours aa and bb exactly when ∣a−b∣|a-b| is a multiple of 44. Call this relation RR; it is an equivalence relation on AA.

    Which of the following statements is completely correct?

    MCQMedium
    1 mark
  22. 22

    Question 22

    Four people stand in a single queue at a counter, at positions 1,2,3,41,2,3,4, where position 11 is at the front. On the set A={1,2,3,4}A=\{1,2,3,4\} define a R ba\,R\,b to mean that the person at position aa is not standing behind the person at position bb.

    How many ordered pairs does RR contain, and what is the least number of ordered pairs that must be added to RR to make it symmetric?

    MCQMedium
    1 mark
  23. 23

    Question 23

    A fair booth converts rupees into game tokens. A customer who hands over xx rupees receives

    g(x)=2x+1g(x)=2x+1

    tokens — two tokens for every rupee, plus one bonus token for using the booth. Taken as g:R→Rg:\mathbb{R}\to\mathbb{R}, this is a bijection, so it can be undone.

    A customer ends the day holding 1515 tokens and wants to know how many rupees produced them. Which option gives both the correct rule g−1g^{-1} and the correct number of rupees?

    MCQMedium
    1 mark
  24. 24

    Question 24

    Three guests G1G_1, G2G_2 and G3G_3 arrive at a dinner. A seating gives each guest one chair, and no two guests may share a chair.

    At first the room holds exactly 33 chairs. Later a fourth chair is brought in. How many seatings are possible in the two cases?

    MCQMedium
    1 mark
  25. 25

    Question 25

    In a family census the ages, in whole years, are natural numbers. On N={1,2,3,…}\mathbb{N}=\{1,2,3,\ldots\} define

    a R b  ⟺  a=b+5a\,R\,b \iff a=b+5

    which reads: person aa is exactly 55 years older than person bb.

    RR fails all three of reflexivity, symmetry and transitivity. Which set of counterexamples is correct throughout?

    MCQMedium
    1 mark
  26. 26

    Question 26

    A data team must pick an encoder. An encoder is usable only if it can be decoded: every value of the stated codomain must be produced by exactly one input — that is, the map must be a bijection. Four encoders are proposed.

    f1:N→Nf_1:\mathbb{N}\to\mathbb{N}, f1(x)=x2f_1(x)=x^2

    f2:R→Rf_2:\mathbb{R}\to\mathbb{R}, f2(x)=x3f_2(x)=x^3

    f3:Z→Zf_3:\mathbb{Z}\to\mathbb{Z}, f3(x)=2x+1f_3(x)=2x+1

    f4:R→Rf_4:\mathbb{R}\to\mathbb{R}, f4(x)=sin⁡xf_4(x)=\sin x

    Exactly one of the four is a bijection. Which statement is completely correct?

    MCQMedium
    1 mark
  27. 27

    Question 27

    A delivery app gives each of five orders to exactly one of seven riders. Writing O={O1,O2,O3,O4,O5}O=\{O_1,O_2,O_3,O_4,O_5\} for the orders and D={D1,D2,…,D7}D=\{D_1,D_2,\ldots,D_7\} for the riders, one morning's assignment is the function f:O→Df:O\to D given by

    f={(O1,D3),(O2,D5),(O3,D3),(O4,D1),(O5,D5)}f=\{(O_1,D_3),(O_2,D_5),(O_3,D_3),(O_4,D_1),(O_5,D_5)\}

    How many riders receive at least one order, how many riders receive exactly two orders, and is ff onto?

    MCQEasy
    1 mark
  28. 28

    Question 28

    A school puts each of its six Class XII students into exactly one sports house.

    StudentHouse
    S1S_1Red
    S2S_2Blue
    S3S_3Red
    S4S_4Green
    S5S_5Blue
    S6S_6Red

    On the set A={S1,S2,S3,S4,S5,S6}A=\{S_1,S_2,S_3,S_4,S_5,S_6\} the relation RR relates two students exactly when they belong to the same house. RR is an equivalence relation.

    How many ordered pairs does RR contain now, and how many equivalence classes would RR have if S4S_4 were moved from Green to Blue?

    MCQMedium
    1 mark
  29. 29

    Question 29

    Given below are two statements — one labelled Assertion and the other labelled Reason. Read the statements carefully and choose the option that correctly describes them.

    Assertion: The relation R={(a,b):a2+b2=25}R=\{(a,b): a^2+b^2=25\} on the set of real numbers is a function.

    Reason: In RR, the number a=3a=3 is paired with b=4b=4 and also with b=−4b=-4.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Medium
    1 mark
  30. 30

    Question 30

    The factors of 1212 form the set D={1,2,3,4,6,12}D = \{1, 2, 3, 4, 6, 12\}. A gearbox designer relates two of these tooth-counts by a R ba \, \mathrm{R} \, b if and only if aa divides bb, meaning the pair of gears turns in a whole-number ratio.

    Assertion: On DD this relation R\mathrm{R} is reflexive and transitive, but not symmetric.

    Reason: R\mathrm{R} contains exactly 1818 ordered pairs.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Medium
    1 mark
  31. 31

    Question 31

    Boarding passes go through two machines in turn. The first is f:{2,3,4,5}→{3,4,5,9}f : \{2, 3, 4, 5\} \to \{3, 4, 5, 9\} with f(2)=3f(2) = 3, f(3)=4f(3) = 4, f(4)=5f(4) = 5 and f(5)=5f(5) = 5. The second is g:{3,4,5,9}→{7,11,15}g : \{3, 4, 5, 9\} \to \{7, 11, 15\} with g(3)=7g(3) = 7, g(4)=7g(4) = 7, g(5)=11g(5) = 11 and g(9)=11g(9) = 11. A pass carrying the number xx leaves the pair of machines carrying (g∘f)(x)(g \circ f)(x).

    Assertion: g∘fg \circ f is an onto function from {2,3,4,5}\{2, 3, 4, 5\} to {7,11,15}\{7, 11, 15\}.

    Reason: (g∘f)(2)=7(g \circ f)(2) = 7 and (g∘f)(4)=11(g \circ f)(4) = 11.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Medium
    1 mark
  32. 32

    Question 32

    A two-stage encoder can be wired in either order. Setting I adds 22 to the real input and then triples the result. Setting II triples the input first and then adds 22. Write f(x)=x+2f(x) = x + 2 and g(x)=3xg(x) = 3x, both from R\mathbb{R} to R\mathbb{R}, so Setting I computes g∘fg \circ f and Setting II computes f∘gf \circ g.

    Assertion: g∘f≠f∘gg \circ f \neq f \circ g, and in fact (g∘f)(x)−(f∘g)(x)=4(g \circ f)(x) - (f \circ g)(x) = 4 for every real xx, so the two settings never agree on any input at all.

    Reason: (g∘f)(x)=3x+6(g \circ f)(x) = 3x + 6 and (f∘g)(x)=3x+2(f \circ g)(x) = 3x + 2.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Medium
    1 mark
  33. 33

    Question 33

    A pricing app converts a raw score xx into a discount index by f(x)=x1+∣x∣f(x) = \dfrac{x}{1 + |x|}, taken as a function f:R→Rf : \mathbb{R} \to \mathbb{R}.

    Assertion: This ff is one-one but not onto, and its range is the open interval (−1,1)(-1, 1).

    Reason: ff fails to be onto because ff is not defined at x=−1x = -1.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Medium
    1 mark
  34. 34

    Question 34

    Consider the following three relations on the set A={1,2,3,4,5}A=\{1,2,3,4,5\}.

    R={(a,b):a≤b}R=\{(a,b): a\le b\}

    S={(a,b):a+b is even}S=\{(a,b): a+b \text{ is even}\}

    T={(a,b):a−b is even}T=\{(a,b): a-b \text{ is even}\}

    Attempt any four of the following five sub-questions.

    (a) Which of the relations RR, SS and TT are reflexive? Justify each answer.

    (b) Which of the relations RR, SS and TT are symmetric? Justify each answer.

    (c) Which of the relations RR, SS and TT are transitive? Justify each answer.

    (d) Which of the relations RR, SS and TT are equivalence relations?

    (e) Show that SS and TT are in fact the same set of ordered pairs, and then write down all the distinct equivalence classes of AA under SS.

    Medium
    4 marks
  35. 35

    Question 35

    Let f:R→Rf:\mathbb{R}\to\mathbb{R} and g:[0,∞)→Rg:[0,\infty)\to\mathbb{R} be the functions defined by f(x)=x2f(x)=x^2 and g(x)=xg(x)=\sqrt{x}.

    Attempt any four of the following five sub-questions.

    (a) Find the domain and the range of ff.

    (b) Find the domain and the range of gg, and explain why the domain of gg cannot be the whole of R\mathbb{R}.

    (c) Determine whether ff is one-one and whether it is onto, justifying each answer with a specific value.

    (d) Determine whether gg is one-one and whether it is onto, justifying each answer.

    (e) Find the composite (g∘f)(x)(g\circ f)(x), explain why it is defined for every real xx, and state its domain and range.

    Medium
    4 marks
  36. 36

    Question 36

    Consider the set A={1,2,3,4,5,6}A=\{1,2,3,4,5,6\} and the relation RR on AA defined by (a,b)∈R(a,b)\in R if and only if a+b≤5a+b\le 5.

    Attempt any four of the following five sub-questions.

    (a) Write RR in roster form, as a set of ordered pairs.

    (b) List, for each element of AA, the elements of AA it is related to.

    (c) Find the domain, the codomain and the range of RR.

    (d) Determine whether RR is a function from AA to AA. If it is, find its inverse; if it is not, give two independent reasons.

    (e) Decide whether RR is an equivalence relation. Test all three properties, giving a specific counterexample for each one that fails.

    Medium
    4 marks
  37. 37

    Question 37

    A sports complex has installed three smart lockers, L={L1,L2,L3}L=\{L_1,L_2,L_3\}, for the three members of its coaching staff, S={P,Q,R}S=\{P,Q,R\}. The management app stores an allocation as a set of (coach, locker) pairs. On its loosest setting the app will store any collection of such pairs at all. On its normal setting every coach must be given exactly one locker, but two coaches may share a locker and a locker may be left empty. On its strictest setting every coach gets a locker and every locker is used by exactly one coach. Before choosing a setting, the administrator wants to know how many allocations each one permits.

    Attempt any four of the following five sub-questions.

    (a) A relation from SS to LL is any subset of S×LS\times L. Find ∣S×L∣|S\times L|, and hence the number of allocations the loosest setting permits.

    (b) How many allocations does the normal setting permit?

    (c) How many allocations does the strictest setting permit?

    (d) The app currently holds f={(P,L2),(Q,L3),(R,L2)}f=\{(P,L_2),(Q,L_3),(R,L_2)\}. Decide whether ff is one-one and whether it is onto LL, justifying each answer.

    (e) Using your counts from (b) and (c), find how many of the normal-setting allocations fail the strictest setting, and describe in words what goes wrong in such an allocation.

    Medium
    4 marks
  38. 38

    Question 38

    Let f:R−{1}→R−{1}f:\mathbb{R}-\{1\}\to\mathbb{R}-\{1\} be the function defined by f(x)=x+1x−1f(x)=\dfrac{x+1}{x-1}.

    Attempt any four of the following five sub-questions.

    (a) Show that ff is one-one.

    (b) Show that ff is onto. Remember to check that the pre-image you produce really does lie in R−{1}\mathbb{R}-\{1\}.

    (c) Find the inverse function f−1f^{-1}.

    (d) Show that (f∘f)(x)=x(f\circ f)(x)=x for every xx in the domain of ff.

    (e) Let g(x)=ax+bcx+dg(x)=\dfrac{ax+b}{cx+d}, where c≠0c\ne 0 and ad−bc≠0ad-bc\ne 0. Show that g:R−{−dc}→R−{ac}g:\mathbb{R}-\left\{-\dfrac{d}{c}\right\}\to\mathbb{R}-\left\{\dfrac{a}{c}\right\} is invertible, and find g−1g^{-1}. State clearly where the condition ad−bc≠0ad-bc\ne 0 is used.

    Medium
    4 marks
  39. 39

    Question 39

    A gym has seven lockers, numbered 0,1,2,3,4,5,60,1,2,3,4,5,6. Its six members have membership numbers 11 to 66, and the software gives member nn the locker whose number is the remainder when n2n^2 is divided by 77. This defines the function

    f:{1,2,3,4,5,6}→{0,1,2,3,4,5,6},f(n)=the remainder when n2 is divided by 7f:\{1,2,3,4,5,6\}\to\{0,1,2,3,4,5,6\},\qquad f(n)=\text{the remainder when } n^2 \text{ is divided by } 7

    Which statement about ff is correct?

    MCQMedium
    1 mark
  40. 40

    Question 40

    A parking lot charges ₹2 per hour, and the parked time xx (in hours, x≥0x\ge 0) is recorded to any fraction of an hour. Write f(x)=[x]f(x)=[x], the greatest integer less than or equal to xx, and g(x)=2xg(x)=2x, both as functions from [0,∞)[0,\infty) to [0,∞)[0,\infty). Two billing systems are compared.

    • System I first rounds the time down to whole hours and then charges ₹2 per hour, so the bill in rupees is (g∘f)(x)(g\circ f)(x).
    • System II first works out 2x2x rupees and then rounds the amount down to whole rupees, so the bill is (f∘g)(x)(f\circ g)(x).

    For which parking times xx do the two systems give the same bill?

    MCQMedium
    1 mark
  41. 41

    Question 41

    A laboratory stores five reagents, labelled 11 to 55, in compatibility groups. Every reagent is in exactly one group, and no reagent is ever stored alone: each group holds at least two reagents.

    The record "aa and bb are in the same group" is an equivalence relation RR on A={1,2,3,4,5}A=\{1,2,3,4,5\}, and different groupings give different relations.

    How many such equivalence relations RR are possible, and in how many of them is (1,2)∉R(1,2)\notin R?

    MCQHard
    1 mark
  42. 42

    Question 42

    Four servers 1,2,3,41,2,3,4 pass data along one-way links. The links form the relation

    R={(1,2), (2,3), (3,1), (3,4)}R=\{(1,2),\,(2,3),\,(3,1),\,(3,4)\}

    on A={1,2,3,4}A=\{1,2,3,4\}, where (a,b)∈R(a,b)\in R means "aa sends directly to bb". The diagram shows RR.

    Arrow diagram on four circled nodes 1, 2, 3, 4: arrows 1 to 2, 2 to 3, 3 to 1 and 3 to 4

    An engineer wants the smallest transitive relation on AA that contains RR, so that "aa can reach bb" is recorded directly. How many ordered pairs must be added to RR, and which description of the resulting relation is correct?

    MCQHard
    1 mark
  43. 43

    Question 43

    On the set Z\mathbb{Z} of all integers, define

    a R b  ⟺  3 divides a−ba\,R\,b \iff 3 \text{ divides } a-b

    RR is an equivalence relation, so it cuts Z\mathbb{Z} into equivalence classes. Exactly one of the four statements below is false. Which one?

    MCQMedium
    1 mark
  44. 44

    Question 44

    A puzzle uses 2020 tiles numbered 11 to 2020. Two tiles aa and bb are called matching when the product abab is a perfect square. This defines a relation on A={1,2,3,…,20}A=\{1,2,3,\ldots,20\}:

    R={(a,b)∈A×A: ab is a perfect square}R=\{(a,b)\in A\times A:\ ab \text{ is a perfect square}\}

    RR is an equivalence relation on AA. How many equivalence classes does RR have, and what is the class [2][2]?

    MCQHard
    1 mark
  45. 45

    Question 45

    Two inspectors each decide, independently, which of the three items of A={1,2,3}A=\{1,2,3\} count as interchangeable. Inspector I records

    R1={(1,1),(2,2),(3,3),(1,2),(2,1)}R_1=\{(1,1),(2,2),(3,3),(1,2),(2,1)\}

    and Inspector II records

    R2={(1,1),(2,2),(3,3),(2,3),(3,2)}R_2=\{(1,1),(2,2),(3,3),(2,3),(3,2)\}

    Both records are equivalence relations. The manager now wants one relation for the whole team and weighs up R1∩R2R_1\cap R_2, meaning "both inspectors agree the items are interchangeable", against R1∪R2R_1\cup R_2, meaning "at least one inspector says so".

    Which statement is correct?

    MCQMedium
    1 mark
  46. 46

    Question 46

    Let f:R∖{2}→R∖{1}f:\mathbb{R}\setminus\{2\}\to\mathbb{R}\setminus\{1\} and g:R∖{1}→R∖{2}g:\mathbb{R}\setminus\{1\}\to\mathbb{R}\setminus\{2\} be defined by

    f(x)=x+1x−2,g(x)=2x+1x−1.f(x)=\frac{x+1}{x-2},\qquad g(x)=\frac{2x+1}{x-1}.

    Compute both composites and then decide which one of the following statements is true.

    MCQHard
    1 mark
  47. 47

    Question 47

    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?

    MCQHard
    1 mark
  48. 48

    Question 48

    For any function f:X→Yf:X\to Y whatsoever, a relation can be defined on the domain XX by

    R={(a,b)∈X×X:f(a)=f(b)}R=\{(a,b)\in X\times X : f(a)=f(b)\}

    so two inputs are related exactly when ff cannot tell them apart.

    Now take X=ZX=\mathbb{Z}, Y=ZY=\mathbb{Z} and f(x)=x2f(x)=x^{2}. Which of the following is completely correct?

    MCQHard
    1 mark
  49. 49

    Question 49

    A club has three members, labelled 11, 22 and 33, so X={1,2,3}X=\{1,2,3\}. Any group of members (including the empty group) may form a panel, so the possible panels are the subsets of XX, that is, the elements of the power set P(X)P(X).

    Two panels AA and BB are called balanced when the number of members on exactly one of the two panels is even:

    R={(A,B)∈P(X)×P(X): n(A∪B)−n(A∩B) is even}R=\{(A,B)\in P(X)\times P(X):\ n(A\cup B)-n(A\cap B)\ \text{is even}\}

    Which statement about RR is correct?

    MCQHard
    1 mark
  50. 50

    Question 50

    A stock-checking program pairs two integer codes aa and bb when 2a+3b2a+3b is a multiple of 55. On the set Z\mathbb{Z} of integers, this gives the relation

    R={(a,b)∈Z×Z: 5 divides 2a+3b}R=\{(a,b)\in\mathbb{Z}\times\mathbb{Z}:\ 5 \text{ divides } 2a+3b\}

    Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.

    Assertion: (2,7)∈R(2,7)\in R but (7,2)∉R(7,2)\notin R, so RR is not symmetric.

    Reason: 2a+3b=2(a−b)+5b2a+3b=2(a-b)+5b, so (a,b)∈R(a,b)\in R exactly when 55 divides a−ba-b.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Hard
    1 mark
  51. 51

    Question 51

    A sensor converts a signed input xx (any real number) into a reading by the rule

    f(x)=x3+3x2+3x+7,f:R→Rf(x)=x^3+3x^2+3x+7,\qquad f:\mathbb{R}\to\mathbb{R}

    Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.

    Assertion: ff is one-one and onto, and x=1x=1 is the only real number with f(x)=14f(x)=14.

    Reason: f(x)=(x+1)3+6f(x)=(x+1)^3+6, so ff is the composite of the bijections x↦x+1x\mapsto x+1, x↦x3x\mapsto x^3 and x↦x+6x\mapsto x+6 (applied in that order).

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Hard
    1 mark
  52. 52

    Question 52

    A weather station records daily temperature changes as real numbers (a fall is negative). Two changes xx and yy are called in step when they do not have opposite signs, that is, when xy≥0xy\ge 0. On the set R\mathbb{R} this gives the relation

    R={(x,y)∈R×R: xy≥0}R=\{(x,y)\in\mathbb{R}\times\mathbb{R}:\ xy\ge 0\}

    Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.

    Assertion: RR is an equivalence relation on R\mathbb{R}, and its equivalence classes are (−∞,0](-\infty,0] and [0,∞)[0,\infty).

    Reason: RR is reflexive and symmetric; moreover, if xy≥0xy\ge 0 and yz≥0yz\ge 0 with y≠0y\ne 0, then xz≥0xz\ge 0.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Hard
    1 mark
  53. 53

    Question 53

    Four machines on a shop floor are labelled A={1,2,3,4}A = \{1, 2, 3, 4\}. A maintenance log records the relation R={(1,1),(1,2),(2,1),(2,2)}R = \{(1,1), (1,2), (2,1), (2,2)\} on AA, meaning "these two machines were serviced together". Machines 33 and 44 appear in no entry at all.

    Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.

    Assertion: This RR is symmetric and transitive, but it is not reflexive.

    Reason: A relation on a set AA that is both symmetric and transitive must also be reflexive, because (a,b)∈R(a, b) \in R gives (b,a)∈R(b, a) \in R by symmetry, and then (a,b)∈R(a, b) \in R with (b,a)∈R(b, a) \in R gives (a,a)∈R(a, a) \in R by transitivity.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Medium
    1 mark
  54. 54

    Question 54

    A thermostat's control signal depends on the temperature deviation xx (in °C, which may be negative) by the rule f:R→Rf:\mathbb{R}\to\mathbb{R},

    f(x)=2x+∣x∣.f(x)=2x+|x|.

    Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.

    Assertion: ff is a bijection, and f−1(6)=2f^{-1}(6)=2 while f−1(−6)=−6f^{-1}(-6)=-6.

    Reason: A function whose rule involves ∣x∣|x| can never be one-one on R\mathbb{R}.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Hard
    1 mark
  55. 55

    Question 55

    A building has six floors, numbered 11 to 66, so let A={1,2,3,4,5,6}A=\{1,2,3,4,5,6\}. A lift trip from floor aa to floor bb is recorded as the ordered pair (a,b)∈A×A(a,b)\in A\times A; a trip with a=ba=b (doors open and close) is allowed. The dot grid shows all 3636 possible trips.

    A 6 by 6 grid of dots, one for each trip (a, b), with a (start floor) on the horizontal axis and b (end floor) on the vertical axis

    The maintenance team treats two trips alike when they have the same net climb. On the set A×AA\times A they define

    (a,b) R (c,d)  ⟺  a+d=b+c(a,b)\,R\,(c,d)\iff a+d=b+c

    Attempt any four of the following five sub-questions.

    (a) Prove that RR is an equivalence relation on A×AA\times A.

    (b) Write down the equivalence class [(2,5)][(2,5)] in full.

    (c) Find the number of equivalence classes of RR, and the number of trips in the largest class.

    (d) Find the number of ordered pairs in RR, that is, ∣R∣|R|.

    (e) For a building with floors 1,2,…,n1,2,\ldots,n and the same rule, find the number of classes and ∣R∣|R| in terms of nn. Check both formulas against your answers to (c) and (d).

    Hard
    4 marks
  56. 56

    Question 56

    A skate park's ramp is modelled by its height profile. At a horizontal position xx metres from a marker (positions to the left of the marker are negative), the height of the ramp is f(x)f(x) metres, where

    f(x)=x2−4x+6,f:R→R.f(x)=x^2-4x+6,\qquad f:\mathbb{R}\to\mathbb{R}.

    The designers want to read off a position from a given height, which needs an inverse function.

    Attempt any four of the following five sub-questions.

    (a) Show that ff is not one-one.

    (b) Find the range of ff, and hence show that ff is not onto.

    (c) Find the largest interval containing the position x=5x=5 on which ff is one-one. Justify that no larger interval containing 55 works.

    (d) Treat ff as a function from [2,∞)[2,\infty) to [2,∞)[2,\infty). Given that it is a bijection, find f−1(y)f^{-1}(y) and check that f(f−1(y))=yf\left(f^{-1}(y)\right)=y for every y≥2y\ge2.

    (e) For the bijection in (d), find every point where the graph of ff meets the graph of f−1f^{-1}.

    Hard
    4 marks
  57. 57

    Question 57

    A city map places every street corner at a point with integer coordinates. Let Π={(x,y):x,y∈Z}\Pi=\{(x,y): x,y\in\mathbb{Z}\} be the set of these lattice points. Two corners PP and QQ are called twinned when the midpoint of the segment PQPQ is also a lattice point. (For P=QP=Q the "midpoint" is PP itself.) This defines the relation

    R={(P,Q)∈Π×Π: the midpoint of PQ has integer coordinates}R=\{(P,Q)\in\Pi\times\Pi:\ \text{the midpoint of } PQ \text{ has integer coordinates}\}

    Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.

    Assertion: RR is an equivalence relation on Π\Pi with exactly 44 equivalence classes; hence among any 55 lattice points, at least two are twinned.

    Reason: Among any 55 lattice points, at least two have xx-coordinates of the same parity (both even or both odd).

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Hard
    1 mark
  58. 58

    Question 58

    A streaming app offers three add-on packs, numbered 11, 22 and 33. A customer's choice is a subset of X={1,2,3}X=\{1,2,3\}, so the set of all possible choices is the power set P(X)P(X), with 88 members. During a promotion, pack 11 is added free to every account. This defines G:P(X)→P(X)G:P(X)\to P(X),

    G(A)=A∪{1}.G(A)=A\cup\{1\}.

    Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.

    Assertion: GG is neither one-one nor onto, and its range contains exactly 44 of the 88 subsets of XX.

    Reason: G(A)G(A) always contains 11; G(B)=BG(B)=B whenever 1∈B1\in B; and G(A)=G(A∪{1})G(A)=G(A\cup\{1\}) for every A∈P(X)A\in P(X).

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Hard
    1 mark
  59. 59

    Question 59

    A database stores every ordered pair (m,n)(m,n) of natural numbers as one natural-number code. The code is given by f:N×N→Nf:\mathbb{N}\times\mathbb{N}\to\mathbb{N},

    f(m,n)=2 m−1 (2n−1).f(m,n)=2^{\,m-1}\,(2n-1).

    For example, f(1,1)=1f(1,1)=1 and f(2,3)=2×5=10f(2,3)=2\times5=10. Which statement about ff is correct?

    MCQHard
    1 mark
  60. 60

    Question 60

    Let f:R→Rf:\mathbb{R}\to\mathbb{R} and g:R→Rg:\mathbb{R}\to\mathbb{R} be defined by f(x)=x3f(x)=x^3 and g(x)=x+1g(x)=x+1. Form both composites, then solve (f∘g)(x)=(g∘f)(x)(f\circ g)(x)=(g\circ f)(x) completely before choosing. Which statement is true?

    MCQMedium
    1 mark
  61. 61

    Question 61

    A warehouse floor is marked as a 4×44\times 4 grid of 1616 squares. The square in row rr and column cc is named (r,c)(r,c), as in the diagram.

    A 4 by 4 grid of squares labelled (1,1) to (4,4), with rows 1 to 4 down the left and columns 1 to 4 along the top

    A floor robot can go from square ss to square tt in one straight run exactly when ss and tt lie in the same row or the same column. On the set SS of the 1616 squares, define

    R={(s,t)∈S×S: s and t lie in the same row or in the same column}R=\{(s,t)\in S\times S:\ s \text{ and } t \text{ lie in the same row or in the same column}\}

    RR is reflexive and symmetric. How many ordered pairs does RR contain, and how many ordered pairs must be added to RR to obtain the smallest transitive relation on SS that contains RR?

    MCQHard
    1 mark
  62. 62

    Question 62

    A team leader shares four tasks 1,2,3,41,2,3,4 among three workers a,b,ca,b,c. Each task goes to exactly one worker, so a sharing plan is a function

    f:{1,2,3,4}→{a,b,c}.f:\{1,2,3,4\}\to\{a,b,c\}.

    The leader insists that every worker gets at least one task, so ff must be onto.

    How many onto functions ff are there, and in how many of them do tasks 11 and 22 go to the same worker, that is f(1)=f(2)f(1)=f(2)?

    MCQHard
    1 mark
  63. 63

    Question 63

    Two shuffling rules act on the set Z\mathbb{Z} of all integers:

    f(n)={n+3,n oddn−5,n eveng(n)={n+3,n oddn−4,n evenf(n)=\begin{cases} n+3, & n \text{ odd}\\ n-5, & n \text{ even}\end{cases} \qquad\qquad g(n)=\begin{cases} n+3, & n \text{ odd}\\ n-4, & n \text{ even}\end{cases}

    Both are functions from Z\mathbb{Z} to Z\mathbb{Z}. Which statement is correct?

    MCQHard
    1 mark
  64. 64

    Question 64

    Let f(x)=x−1x+1f(x)=\dfrac{x-1}{x+1}, defined for every real x≠−1x\neq-1. Which of the following is (f∘f)(x)(f\circ f)(x), in simplest form?

    MCQHard
    1 mark
  65. 65

    Question 65

    A packing line prints a code on every item: the xx-th item receives the code f(x)=4x+3f(x)=4x+3, where x∈Nx\in\mathbb{N}.

    Read as a function f:N→Nf:\mathbb{N}\to\mathbb{N} this is not onto, so no inverse exists. The engineer therefore cuts the codomain down to exactly the codes that actually get printed,

    Y={y∈N:y=4x+3 for some x∈N}Y=\{y\in\mathbb{N} : y=4x+3 \text{ for some } x\in\mathbb{N}\}

    and now f:N→Yf:\mathbb{N}\to Y is invertible. Which option gives YY, the inverse rule and the item carrying code 2323, all three correctly?

    MCQMedium
    1 mark
  66. 66

    Question 66

    A teacher splits six students, numbered 11 to 66, into study circles. Every student is in exactly one circle, and "aa and bb are in the same circle" is recorded as an equivalence relation RR on A={1,2,3,4,5,6}A=\{1,2,3,4,5,6\} (each student counts as being in the same circle as themself).

    The register shows that RR contains exactly 2020 ordered pairs.

    How many circles are there, what are their sizes, and how many different relations RR on AA fit this register?

    MCQHard
    1 mark
  67. 67

    Question 67

    Let f:R→Rf:\mathbb{R}\to\mathbb{R} be defined by f(x)=ax+bf(x)=ax+b, where aa and bb are real numbers with a>0a>0. If (f∘f)(x)=9x−6(f\circ f)(x)=9x-6 for every x∈Rx\in\mathbb{R}, then a+ba+b equals

    MCQHard
    1 mark
  68. 68

    Question 68

    For a real number xx, let [x][x] be the greatest integer less than or equal to xx. So [2.7]=2[2.7]=2, [3]=3[3]=3 and [−0.4]=−1[-0.4]=-1. Define f:R→Rf:\mathbb{R}\to\mathbb{R} by

    f(x)=x+[x].f(x)=x+[x].

    Which statement about ff is correct?

    MCQHard
    1 mark
  69. 69

    Question 69

    A queue of customers is numbered by the natural numbers N={1,2,3,…}\mathbb{N}=\{1,2,3,\ldots\}. When a new customer joins at the front, everyone's number goes up by one: f:N→Nf:\mathbb{N}\to\mathbb{N}, f(n)=n+1f(n)=n+1. A clerk tries to undo this with g:N→Ng:\mathbb{N}\to\mathbb{N},

    g(n)={5,n=1n−1,n≥2.g(n)=\begin{cases} 5, & n=1\\ n-1, & n\ge2.\end{cases}

    Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.

    Assertion: g∘f=INg\circ f=I_{\mathbb{N}}, the identity function on N\mathbb{N}, and yet ff is not invertible.

    Reason: The condition g∘f=INg\circ f=I_{\mathbb{N}} forces ff to be one-one but does not force ff to be onto, while an invertible function must be both one-one and onto.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Hard
    1 mark
  70. 70

    Question 70

    A sensor reading xx is first calibrated by f:R→Rf:\mathbb{R}\to\mathbb{R}, f(x)=3x+2f(x)=3x+2, and then passed through an unknown processing stage g:R→Rg:\mathbb{R}\to\mathbb{R}. Tests show that the complete pipeline gives

    (g∘f)(x)=9x2+12x+7for every x∈R.(g\circ f)(x)=9x^2+12x+7\quad\text{for every }x\in\mathbb{R}.

    Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.

    Assertion: g(x)=x2+3g(x)=x^2+3, and therefore f∘g=g∘ff\circ g=g\circ f.

    Reason: Since ff is a bijection, g=(g∘f)∘f−1g=(g\circ f)\circ f^{-1}.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Hard
    1 mark
  71. 71

    Question 71

    A parcel's declared value passes through two conversion stages. Stage one applies f:R→Rf : \mathbb{R} \to \mathbb{R}, f(x)=2x+1f(x) = 2x + 1; stage two applies g:R→Rg : \mathbb{R} \to \mathbb{R}, g(x)=3x−2g(x) = 3x - 2. A parcel entering with value xx leaves the pipeline with value (g∘f)(x)(g \circ f)(x). Both ff and gg are bijections, so the pipeline can be undone.

    Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.

    Assertion: (g∘f)−1(x)=x−16(g \circ f)^{-1}(x) = \dfrac{x - 1}{6}.

    Reason: For any two invertible functions f,g:R→Rf, g : \mathbb{R} \to \mathbb{R}, (g∘f)−1=g−1∘f−1(g \circ f)^{-1} = g^{-1} \circ f^{-1}.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Hard
    1 mark
  72. 72

    Question 72

    A delivery company charges for a parcel by the rule f:R→Rf:\mathbb{R}\to\mathbb{R}, where xx is a scaled weight reading that can be negative after tare correction:

    f(x)={x+2,x<0x2,x≥0.f(x)=\begin{cases} x+2, & x<0\\ x^2, & x\ge0.\end{cases}

    Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.

    Assertion: ff is onto but not one-one.

    Reason: Each of the two pieces of ff is one-one on its own interval.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Hard
    1 mark
  73. 73

    Question 73

    A depot numbers its storage bins with the natural numbers N={1,2,3,… }\mathbb{N} = \{1, 2, 3, \dots\}. A relabelling scheme is any function from N\mathbb{N} to N\mathbb{N}: bin nn gets the new label h(n)h(n). The manager wants to know how badly a relabelling can behave on an infinite stock of bins.

    Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.

    Assertion: There is a function f:N→Nf : \mathbb{N} \to \mathbb{N} which is one-one, is not onto, and whose range misses infinitely many natural numbers; and there is a function g:N→Ng : \mathbb{N} \to \mathbb{N} which is onto and for which every natural number has exactly two preimages.

    Reason: For every finite set XX and every function h:X→Xh : X \to X, if hh is onto then hh is one-one.

    (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.

    (B) Assertion is correct, reason is correct; reason is not a correct explanation for assertion.

    (C) Assertion is correct, reason is incorrect.

    (D) Assertion is incorrect, reason is correct.

    Hard
    1 mark
  74. 74

    Question 74

    Let AA be the set of all students in a school, and let RR be the relation on AA given by (a,b)∈R(a,b)\in R if and only if aa and bb study in the same class. Write A/RA/R for the set of all equivalence classes of RR. Every student belongs to exactly one class. For two classes XX and YY, write (X,Y)∈S(X,Y)\in S when some student of class XX has a sibling who studies in a different class YY. Throughout, no student has more than one sibling in the school.

    Attempt any four of the following five sub-questions.

    (a) Prove that RR is an equivalence relation on the set AA of students, and say what the elements of A/RA/R are in terms of the school.

    (b) The school has 500500 students with 5050 in each class. Find ∣A/R∣|A/R|. Then show that the map π:A→A/R\pi:A\to A/R sending each student to their own class is onto but not one-one.

    (c) Prove that SS is always symmetric, and that (X,X)∉S(X,X)\notin S for every class XX. Deduce that if SS is non-empty then SS cannot be transitive.

    (d) Suppose instead that the 500500 students are spread over 2020 classes of 2525. Find the largest possible value of ∣S∣|S|, and describe an arrangement of siblings that attains it.

    (e) Still with 2020 classes, find the least number of students a class must contain for the largest value in (d) to be attainable at all. Deduce that a school of 2020 classes of 1818 students could not reach that value, whatever its sibling arrangement. Finally, back in the school of part (d), find the greatest possible number of students who have no sibling when ∣S∣|S| attains its largest value.

    Hard
    4 marks
  75. 75

    Question 75

    A school coding club hides messages with a letter-shifting rule. Each letter is first replaced by a number from 00 to 2525:

    ABCDEFGHIJKLM
    00112233445566778899101011111212
    NOPQRSTUVWXYZ
    1313141415151616171718181919202021212222232324242525

    Let L={0,1,2,…,25}L=\{0,1,2,\ldots,25\}. The club's encoding function E:L→LE:L\to L is

    E(x)=the remainder when 5x+8 is divided by 26.E(x)=\text{the remainder when } 5x+8 \text{ is divided by } 26.

    For example, E(3)=23E(3)=23, because 5×3+8=235\times3+8=23; and E(10)=6E(10)=6, because 58=2×26+658=2\times26+6.

    Attempt any four of the following five sub-questions.

    (a) Prove that EE is one-one.

    (b) Explain why EE is onto, and find E(7)E(7), writing it as a letter.

    (c) The club decodes with D(y)=D(y)= the remainder when 21(y−8)21(y-8) is divided by 2626 (taking the remainder between 00 and 2525 even when y−8y-8 is negative). Show that D(E(x))=xD(E(x))=x for every x∈Lx\in L, and decode the received letter D (that is, y=3y=3).

    (d) A new member suggests the key E2(x)=E_2(x)= the remainder when 2x+82x+8 is divided by 2626. Show that E2E_2 is not one-one, and find how many elements its range has.

    (e) Find every letter that EE leaves unchanged, that is, every x∈Lx\in L with E(x)=xE(x)=x. Show that these are also exactly the letters left unchanged by E∘EE\circ E.

    Hard
    4 marks
  76. 76

    Question 76

    A bank's ledger software records, for each transaction, its net effect xx on the balance, a real number of rupees. Instead of storing xx itself, a summary field stores only the direction of the transaction, computed by the signum function

    sgn⁡:R→R,sgn⁡(x)={1,x>00,x=0−1,x<0.\operatorname{sgn}:\mathbb{R}\to\mathbb{R},\qquad \operatorname{sgn}(x)=\begin{cases}1,& x>0\\ 0,& x=0\\ -1,& x<0.\end{cases}

    Two transactions are said to be indistinguishable in the summary when they get the same summary field. This defines a relation on R\mathbb{R}:

    T={(a,b)∈R×R: sgn⁡(a)=sgn⁡(b)}.T=\{(a,b)\in\mathbb{R}\times\mathbb{R}:\ \operatorname{sgn}(a)=\operatorname{sgn}(b)\}.

    One day's ledger contains the five amounts D={−3, −1, 0, 2, 5}D=\{-3,\,-1,\,0,\,2,\,5\}.

    Attempt any four of the following five sub-questions.

    (a) Show that the summary field throws information away: sgn⁡\operatorname{sgn} is not one-one and not onto R\mathbb{R}. Give two specific transaction amounts for the first and one specific unreachable value for the second, and state the range of sgn⁡\operatorname{sgn}.

    (b) Find the sets {x∈R:sgn⁡(x)=1}\{x\in\mathbb{R}:\operatorname{sgn}(x)=1\}, {x∈R:sgn⁡(x)=0}\{x\in\mathbb{R}:\operatorname{sgn}(x)=0\} and {x∈R:sgn⁡(x)=−1}\{x\in\mathbb{R}:\operatorname{sgn}(x)=-1\} — the three pools of transaction amounts that share each summary value — and prove that these three sets partition R\mathbb{R}.

    (c) Prove that TT is an equivalence relation on the set of possible transaction amounts, and identify the set of all equivalence classes of TT (written R/T\mathbb{R}/T) with the three pools of part (b). How many elements does R/T\mathbb{R}/T have — that is, how many transaction directions can the ledger tell apart?

    (d) The engineers replace the codomain by {−1,0,1}\{-1,0,1\}. Show that sgn⁡\operatorname{sgn} is then onto but still not one-one. Prove that if a subset E⊆RE\subseteq\mathbb{R} is such that sgn⁡\operatorname{sgn} restricted to EE is a bijection onto {−1,0,1}\{-1,0,1\}, then EE has exactly three elements, and construct one such EE.

    (e) Let TD=T∩(D×D)T_D=T\cap(D\times D). Write the classes of TDT_D and compute ∣TD∣|T_D|. Then count the equivalence relations on DD every one of whose classes consists of amounts of a single direction, and justify the count.

    Hard
    4 marks
  77. 77

    Question 77

    A two-round quiz gives every contestant a real-valued round-one score; penalties make negative scores possible. The organisers define a head-to-head test on the set R\mathbb{R} of possible scores: contestant with score aa survives against the contestant with score bb when aa is at most the square of bb. Formally,

    R={(a,b)∈R×R: a≤b2}.R=\{(a,b)\in\mathbb{R}\times\mathbb{R}:\ a\le b^2\}.

    Write s:R→Rs:\mathbb{R}\to\mathbb{R} for the squaring map s(b)=b2s(b)=b^2 used in the test.

    Attempt any four of the following five sub-questions.

    (a) Show that RR is not reflexive by naming one score. Then find all scores aa for which (a,a)∈R(a,a)\in R, and state exactly which scores make reflexivity fail.

    (b) Show that RR is not symmetric, using the scores 11 and 22. Then find all real bb for which (2,b)(2,b) and (b,2)(b,2) both lie in RR.

    (c) Show that RR is not transitive by verifying the three inequalities for the scores a=5a=5, b=3b=3, c=−2c=-2. Then find a second counterexample in which all three scores are positive, and verify it.

    (d) Find the range of ss. Hence find the set of scores aa that survive against every contestant, and the set of scores bb against which every contestant survives, justifying both answers from the range of ss.

    (e) Only five scores were actually recorded: D={−2, −1, 0, 12, 2}D=\{-2,\,-1,\,0,\,\tfrac12,\,2\}. Let RD=R∩(D×D)R_D=R\cap(D\times D). Compute ∣RD∣|R_D|, decide whether RDR_D is transitive with a counterexample if it is not, and find the least number of ordered pairs that must be added to RDR_D to make it reflexive on DD.

    Hard
    4 marks
  78. 78

    Question 78

    A pressure gauge is accurate only to within 11 unit. So the lab treats two readings aa and bb as matching when they differ by less than 11. On the set R\mathbb{R} of possible readings this gives the relation

    R={(a,b)∈R×R: ∣a−b∣<1}R=\{(a,b)\in\mathbb{R}\times\mathbb{R}:\ |a-b|<1\}

    On one day the gauge recorded exactly five readings:

    D={0, 0.7, 1.3, 2.6, 3.2}D=\{0,\ 0.7,\ 1.3,\ 2.6,\ 3.2\}

    A number line with the five readings 0, 0.7, 1.3, 2.6 and 3.2 marked as dots

    Let RD=R∩(D×D)R_D=R\cap(D\times D) be the matching relation restricted to these five readings.

    Attempt any four of the following five sub-questions.

    (a) Prove that RR is reflexive and symmetric on R\mathbb{R}.

    (b) Using three of the readings in DD, show that RR is not transitive.

    (c) Find ∣RD∣|R_D|, the number of ordered pairs in RDR_D.

    (d) Find the smallest equivalence relation on DD that contains RDR_D. Write its equivalence classes, and find how many ordered pairs must be added to RDR_D to obtain it.

    (e) A sixth reading xx, different from the five above, is recorded, and the same construction is repeated on D∪{x}D\cup\{x\}: take the matching pairs among the six readings, then the smallest equivalence relation containing them. Find every real xx for which this equivalence relation has exactly one class.

    Hard
    4 marks
  79. 79

    Question 79

    A puzzle machine accepts any real number other than 00 and 11 and replaces it by

    f(x)=11−xf(x)=\frac{1}{1-x}

    so f:X→Xf:X\to X with X=R−{0,1}X=\mathbb{R}-\{0,1\}. (The value f(x)f(x) is never 00, and f(x)=1f(x)=1 would need x=0x=0, so ff does map XX into XX.) The number 22 is fed in, and each output is fed straight back in, 20262026 times in all. What is the final output?

    MCQHard
    1 mark
  80. 80

    Question 80

    A magician uses a deck of 88 cards. The positions in the deck are numbered 11 (top) to 88 (bottom). In a perfect out-shuffle the deck is cut into a top half (positions 11 to 44) and a bottom half (positions 55 to 88), and the two halves are interleaved so that the top card stays on top. Reading from the top, the new deck holds the cards that were in positions

    1, 5, 2, 6, 3, 7, 4, 81,\ 5,\ 2,\ 6,\ 3,\ 7,\ 4,\ 8

    Class 12 Maths Relation and Functions

    Let A={1,2,3,4,5,6,7,8}A=\{1,2,3,4,5,6,7,8\} and let f:A→Af:A\to A send each position pp to the position f(p)f(p) that the card at pp occupies after one out-shuffle. Write f2=f∘ff^2=f\circ f, f3=f∘f∘ff^3=f\circ f\circ f, f0=IAf^0=I_A, where IAI_A is the identity function on AA.

    Attempt any four of the following five sub-questions.

    (a) Write ff as a table, and show that ff is a bijection.

    (b) Find f2f^2 and show that f3=IAf^3=I_A. Hence write down f−1f^{-1}, and state the least number of out-shuffles that brings the deck back to its original order.

    (c) On AA define p R qp\,R\,q if and only if q=fk(p)q=f^k(p) for some k∈{0,1,2}k\in\{0,1,2\}; that is, the card at position pp reaches position qq after 00, 11 or 22 out-shuffles. Show that RR is an equivalence relation, write its equivalence classes, and find the number of ordered pairs in RR.

    (d) In a perfect in-shuffle the halves are interleaved with the bottom half first, so the new deck holds the cards from positions 5,1,6,2,7,3,8,45,1,6,2,7,3,8,4. Let g:A→Ag:A\to A be its position function, defined in the same way as ff. Write gg as a table, and find (g∘f)(2)(g\circ f)(2) and (f∘g)(2)(f\circ g)(2). What does the result show?

    (e) Find the least n≥1n\ge 1 for which gn=IAg^n=I_A, where gng^n is gg composed with itself nn times.

    Hard
    4 marks