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
- 11 mark
Question 1
A college library keeps four books on one shelf. Their lengths are recorded below.
Book Number of pages 120 95 120 95 On the set the librarian relates two books exactly when they have the same number of pages, and calls this relation . It is an equivalence relation.
How many ordered pairs does contain, and how many distinct equivalence classes does it have?
- 21 mark
Question 2
A hostel warden must allot rooms to students. The hostel has rooms, and every student is given exactly one room, so an allotment is a function , where is the set of students and is the set of rooms.
The warden wants an allotment in which no room is left empty.
Which statement is correct?
- 31 mark
Question 3
Four members of a study group are labelled . The messaging app records the relation
on the set , where means that has messaged .
The moderator wants to enlarge to the smallest equivalence relation on that contains it. What is the least number of ordered pairs that must be added?
- 41 mark
Question 4
A school timetable puts each of the three subjects Physics (), Chemistry () and Maths () into exactly one slot. From any such timetable one can read off the relation on given by: whenever is scheduled in the same slot as .
Four clerks each handed in a list for , but only one of the lists could have come from a real timetable.
Which list is it, and how many slots does that timetable use?
- 51 mark
Question 5
A sun-tracking mirror slowly drifts out of alignment. Its alignment error, in arc-minutes, hours after solar noon is modelled by
so is two hours before noon and is two hours after. The day's log already shows the reading occurring at two different times. Later in the log the reading appears.
How many times in give the reading , and is one-one when the window is cut down to ?
- 61 mark
Question 6
A blood bank lists four donors, one of each red-cell type: , , and . For red cells the compatibility rule is:
- can be given to , , and
- can be given to and
- can be given to and
- can be given to only
On the set define to mean that type can be given to type .
How many ordered pairs does contain, and which of reflexivity, symmetry and transitivity does have?
- 71 mark
Question 7
A town runs three bus routes. Route runs between the termini and , route between and , and route between and . The four termini , , , are all different places.
On the set define to mean that routes and have at least one terminus in common.
Is transitive, and how many ordered pairs does contain?
- 81 mark
Question 8
Let be a finite set and let 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 is onto, then is one-one, and if is one-one, then 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.
- 91 mark
Question 9
A lamp stands at the origin of a number line. The illumination it produces at the point metres from the origin is modelled by , so the domain of is .
Assertion: If only the codomain of is changed, from to , the domain staying and the rule staying , then becomes an onto function.
Reason: , so 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.
- 101 mark
Question 10
In a four-a-side cricket match the batters , , and scored , , and runs respectively. On the set define if and only if scored more runs than .
Assertion: This relation 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.
- 111 mark
Question 11
A courier company runs overnight one-way trucks between four hubs , , and . Exactly five trucks run: one from to , one from to , one from to , one from to and one from to . On the set define if and only if some truck goes directly from hub to hub .
Assertion: For this network is not reflexive and not transitive, but it is symmetric.
Reason: and .
(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.
- 121 mark
Question 12
A courier hub handles parcels in two stages. Stage 1 drops each of parcels into one of sorting bins. Stage 2 loads each bin onto one of delivery vans. Write for the set of parcels, for the set of bins and for the set of vans. Then stage 1 is a function , stage 2 is a function , and parcel ends up on van .
One morning the manager notes that every van carries at least one parcel, that is, 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 must be onto, and at least of the bins must hold a parcel.
Reason: For every van there is a parcel with , so is the image under of the bin , a bin that holds the parcel .
(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.
- 134 marks
Question 13
At the end of a unit test a teacher of a class of six students, , converts marks into one of the three grades in using a fixed band: a score of or more earns grade , a score from to earns grade , and a score below earns grade . The six scores, taken in the order to , were , , , , and . Let 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 in roster form, as a set of ordered pairs.
(b) Is one-one? Support your answer with a specific pair of students.
(c) Is onto ? Justify by comparing the range of with .
(d) How many students lie in the set ? 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 becomes one-one. Explain why this is impossible.
- 144 marks
Question 14
Sherlin and Danji are playing Ludo at home. Every time the die is rolled, the outcome belongs to the set . Sherlin's sister Raji sits beside them and notes down what she sees. Let be the set of the two players and the set of all possible outcomes of a throw, so that
Raji spends the game studying relations on and counting the ways the two players can be paired with outcomes.
Attempt any four of the following five sub-questions.
(a) Let be the relation on defined by . Which of the following is true for ?
(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 to . How many are possible?
(A)
(B)
(C)
(D)
(c) Let be the relation on given by . Then is
(A) Symmetric
(B) Reflexive
(C) Transitive
(D) None of these three
(d) Raji wants to know the number of relations possible from to . How many are possible?
(A)
(B)
(C)
(D)
(e) Over one whole game Raji records the pairs of outcomes on . Then is
(A) Symmetric
(B) Reflexive and transitive
(C) Transitive and symmetric
(D) An equivalence relation
- 154 marks
Question 15
A bottling plant tests every crate that leaves the line. A sensor produces a raw reading , measured in millivolts, and the rig converts that reading into a quality score by the rule , 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 , , is one-one.
(b) Show that is onto , 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 . Find its raw reading, and check your answer in the rule for .
(e) The older rig is the map , . Decide whether is one-one and whether it is onto, justifying each answer.
- 161 mark
Question 16
A ticket counter has six windows, numbered to . During a promotion, two windows and (not necessarily different) form a bonus pair when the product is even. On the set this gives the relation
How many ordered pairs does contain, and which of the three properties (reflexive, symmetric, transitive) does have?
- 171 mark
Question 17
A weather station logged five daily temperature deviations, in degrees Celsius, forming the set . Its software reports the "energy" of a deviation as the square of the deviation, giving the function , .
Assertion: This is many-one and onto.
Reason: Exactly two pairs of distinct elements of have equal squares, namely and , and every element of is the square of some element of .
(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.
- 181 mark
Question 18
A recurring-deposit scheme credits rupees to an account in month , for every . The credit is therefore the function , .
Assertion: This is one-one but not onto.
Reason: The function given by 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.
- 191 mark
Question 19
A vending machine has three buttons, , and , 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.
Machine Recorded pairs , , , , , , , , 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?
- 201 mark
Question 20
A survey team must give each of respondents exactly one category code, chosen from a list of codes. Writing for the set of respondents and for the set of codes, the coding is a function with and .
When the coding is finished, the team counts how many distinct codes actually appear — that is, the number of elements in the range of .
Which statement about that count is correct?
- 211 mark
Question 21
A maintenance log numbers the hours of a long shift , so the set of hours is
The machine repeats the same task every hours, so the engineer relates two hours and exactly when is a multiple of . Call this relation ; it is an equivalence relation on .
Which of the following statements is completely correct?
- 221 mark
Question 22
Four people stand in a single queue at a counter, at positions , where position is at the front. On the set define to mean that the person at position is not standing behind the person at position .
How many ordered pairs does contain, and what is the least number of ordered pairs that must be added to to make it symmetric?
- 231 mark
Question 23
A fair booth converts rupees into game tokens. A customer who hands over rupees receives
tokens — two tokens for every rupee, plus one bonus token for using the booth. Taken as , this is a bijection, so it can be undone.
A customer ends the day holding tokens and wants to know how many rupees produced them. Which option gives both the correct rule and the correct number of rupees?
- 241 mark
Question 24
Three guests , and 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 chairs. Later a fourth chair is brought in. How many seatings are possible in the two cases?
- 251 mark
Question 25
In a family census the ages, in whole years, are natural numbers. On define
which reads: person is exactly years older than person .
fails all three of reflexivity, symmetry and transitivity. Which set of counterexamples is correct throughout?
- 261 mark
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.
,
,
,
,
Exactly one of the four is a bijection. Which statement is completely correct?
- 271 mark
Question 27
A delivery app gives each of five orders to exactly one of seven riders. Writing for the orders and for the riders, one morning's assignment is the function given by
How many riders receive at least one order, how many riders receive exactly two orders, and is onto?
- 281 mark
Question 28
A school puts each of its six Class XII students into exactly one sports house.
Student House Red Blue Red Green Blue Red On the set the relation relates two students exactly when they belong to the same house. is an equivalence relation.
How many ordered pairs does contain now, and how many equivalence classes would have if were moved from Green to Blue?
- 291 mark
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 on the set of real numbers is a function.
Reason: In , the number is paired with and also with .
(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.
- 301 mark
Question 30
The factors of form the set . A gearbox designer relates two of these tooth-counts by if and only if divides , meaning the pair of gears turns in a whole-number ratio.
Assertion: On this relation is reflexive and transitive, but not symmetric.
Reason: contains exactly 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.
- 311 mark
Question 31
Boarding passes go through two machines in turn. The first is with , , and . The second is with , , and . A pass carrying the number leaves the pair of machines carrying .
Assertion: is an onto function from to .
Reason: and .
(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.
- 321 mark
Question 32
A two-stage encoder can be wired in either order. Setting I adds to the real input and then triples the result. Setting II triples the input first and then adds . Write and , both from to , so Setting I computes and Setting II computes .
Assertion: , and in fact for every real , so the two settings never agree on any input at all.
Reason: and .
(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.
- 331 mark
Question 33
A pricing app converts a raw score into a discount index by , taken as a function .
Assertion: This is one-one but not onto, and its range is the open interval .
Reason: fails to be onto because is not defined at .
(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.
- 344 marks
Question 34
Consider the following three relations on the set .
Attempt any four of the following five sub-questions.
(a) Which of the relations , and are reflexive? Justify each answer.
(b) Which of the relations , and are symmetric? Justify each answer.
(c) Which of the relations , and are transitive? Justify each answer.
(d) Which of the relations , and are equivalence relations?
(e) Show that and are in fact the same set of ordered pairs, and then write down all the distinct equivalence classes of under .
- 354 marks
Question 35
Let and be the functions defined by and .
Attempt any four of the following five sub-questions.
(a) Find the domain and the range of .
(b) Find the domain and the range of , and explain why the domain of cannot be the whole of .
(c) Determine whether is one-one and whether it is onto, justifying each answer with a specific value.
(d) Determine whether is one-one and whether it is onto, justifying each answer.
(e) Find the composite , explain why it is defined for every real , and state its domain and range.
- 364 marks
Question 36
Consider the set and the relation on defined by if and only if .
Attempt any four of the following five sub-questions.
(a) Write in roster form, as a set of ordered pairs.
(b) List, for each element of , the elements of it is related to.
(c) Find the domain, the codomain and the range of .
(d) Determine whether is a function from to . If it is, find its inverse; if it is not, give two independent reasons.
(e) Decide whether is an equivalence relation. Test all three properties, giving a specific counterexample for each one that fails.
- 374 marks
Question 37
A sports complex has installed three smart lockers, , for the three members of its coaching staff, . 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 to is any subset of . Find , 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 . Decide whether is one-one and whether it is onto , 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.
- 384 marks
Question 38
Let be the function defined by .
Attempt any four of the following five sub-questions.
(a) Show that is one-one.
(b) Show that is onto. Remember to check that the pre-image you produce really does lie in .
(c) Find the inverse function .
(d) Show that for every in the domain of .
(e) Let , where and . Show that is invertible, and find . State clearly where the condition is used.
- 391 mark
Question 39
A gym has seven lockers, numbered . Its six members have membership numbers to , and the software gives member the locker whose number is the remainder when is divided by . This defines the function
Which statement about is correct?
- 401 mark
Question 40
A parking lot charges ₹2 per hour, and the parked time (in hours, ) is recorded to any fraction of an hour. Write , the greatest integer less than or equal to , and , both as functions from to . 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 .
- System II first works out rupees and then rounds the amount down to whole rupees, so the bill is .
For which parking times do the two systems give the same bill?
- 411 mark
Question 41
A laboratory stores five reagents, labelled to , 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 " and are in the same group" is an equivalence relation on , and different groupings give different relations.
How many such equivalence relations are possible, and in how many of them is ?
- 421 mark
Question 42
Four servers pass data along one-way links. The links form the relation
on , where means " sends directly to ". The diagram shows .

An engineer wants the smallest transitive relation on that contains , so that " can reach " is recorded directly. How many ordered pairs must be added to , and which description of the resulting relation is correct?
- 431 mark
Question 43
On the set of all integers, define
is an equivalence relation, so it cuts into equivalence classes. Exactly one of the four statements below is false. Which one?
- 441 mark
Question 44
A puzzle uses tiles numbered to . Two tiles and are called matching when the product is a perfect square. This defines a relation on :
is an equivalence relation on . How many equivalence classes does have, and what is the class ?
- 451 mark
Question 45
Two inspectors each decide, independently, which of the three items of count as interchangeable. Inspector I records
and Inspector II records
Both records are equivalence relations. The manager now wants one relation for the whole team and weighs up , meaning "both inspectors agree the items are interchangeable", against , meaning "at least one inspector says so".
Which statement is correct?
- 461 mark
Question 46
Let and be defined by
Compute both composites and then decide which one of the following statements is true.
- 471 mark
Question 47
Four students hand in tests for peer marking. A marking plan is a function : student marks the test of student . The teacher wants a plan that undoes itself: if the plan is applied twice, every test comes back to its owner, that is
Nothing else is assumed about . How many such plans are there, and what kind of function is each one?
- 481 mark
Question 48
For any function whatsoever, a relation can be defined on the domain by
so two inputs are related exactly when cannot tell them apart.
Now take , and . Which of the following is completely correct?
- 491 mark
Question 49
A club has three members, labelled , and , so . Any group of members (including the empty group) may form a panel, so the possible panels are the subsets of , that is, the elements of the power set .
Two panels and are called balanced when the number of members on exactly one of the two panels is even:
Which statement about is correct?
- 501 mark
Question 50
A stock-checking program pairs two integer codes and when is a multiple of . On the set of integers, this gives the relation
Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.
Assertion: but , so is not symmetric.
Reason: , so exactly when divides .
(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.
- 511 mark
Question 51
A sensor converts a signed input (any real number) into a reading by the rule
Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.
Assertion: is one-one and onto, and is the only real number with .
Reason: , so is the composite of the bijections , and (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.
- 521 mark
Question 52
A weather station records daily temperature changes as real numbers (a fall is negative). Two changes and are called in step when they do not have opposite signs, that is, when . On the set this gives the relation
Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.
Assertion: is an equivalence relation on , and its equivalence classes are and .
Reason: is reflexive and symmetric; moreover, if and with , then .
(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.
- 531 mark
Question 53
Four machines on a shop floor are labelled . A maintenance log records the relation on , meaning "these two machines were serviced together". Machines and 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 is symmetric and transitive, but it is not reflexive.
Reason: A relation on a set that is both symmetric and transitive must also be reflexive, because gives by symmetry, and then with gives 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.
- 541 mark
Question 54
A thermostat's control signal depends on the temperature deviation (in °C, which may be negative) by the rule ,
Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.
Assertion: is a bijection, and while .
Reason: A function whose rule involves can never be one-one on .
(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.
- 554 marks
Question 55
A building has six floors, numbered to , so let . A lift trip from floor to floor is recorded as the ordered pair ; a trip with (doors open and close) is allowed. The dot grid shows all possible trips.

The maintenance team treats two trips alike when they have the same net climb. On the set they define
Attempt any four of the following five sub-questions.
(a) Prove that is an equivalence relation on .
(b) Write down the equivalence class in full.
(c) Find the number of equivalence classes of , and the number of trips in the largest class.
(d) Find the number of ordered pairs in , that is, .
(e) For a building with floors and the same rule, find the number of classes and in terms of . Check both formulas against your answers to (c) and (d).
- 564 marks
Question 56
A skate park's ramp is modelled by its height profile. At a horizontal position metres from a marker (positions to the left of the marker are negative), the height of the ramp is metres, where
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 is not one-one.
(b) Find the range of , and hence show that is not onto.
(c) Find the largest interval containing the position on which is one-one. Justify that no larger interval containing works.
(d) Treat as a function from to . Given that it is a bijection, find and check that for every .
(e) For the bijection in (d), find every point where the graph of meets the graph of .
- 571 mark
Question 57
A city map places every street corner at a point with integer coordinates. Let be the set of these lattice points. Two corners and are called twinned when the midpoint of the segment is also a lattice point. (For the "midpoint" is itself.) This defines the relation
Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.
Assertion: is an equivalence relation on with exactly equivalence classes; hence among any lattice points, at least two are twinned.
Reason: Among any lattice points, at least two have -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.
- 581 mark
Question 58
A streaming app offers three add-on packs, numbered , and . A customer's choice is a subset of , so the set of all possible choices is the power set , with members. During a promotion, pack is added free to every account. This defines ,
Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.
Assertion: is neither one-one nor onto, and its range contains exactly of the subsets of .
Reason: always contains ; whenever ; and for every .
(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.
- 591 mark
Question 59
A database stores every ordered pair of natural numbers as one natural-number code. The code is given by ,
For example, and . Which statement about is correct?
- 601 mark
Question 60
Let and be defined by and . Form both composites, then solve completely before choosing. Which statement is true?
- 611 mark
Question 61
A warehouse floor is marked as a grid of squares. The square in row and column is named , as in the diagram.

A floor robot can go from square to square in one straight run exactly when and lie in the same row or the same column. On the set of the squares, define
is reflexive and symmetric. How many ordered pairs does contain, and how many ordered pairs must be added to to obtain the smallest transitive relation on that contains ?
- 621 mark
Question 62
A team leader shares four tasks among three workers . Each task goes to exactly one worker, so a sharing plan is a function
The leader insists that every worker gets at least one task, so must be onto.
How many onto functions are there, and in how many of them do tasks and go to the same worker, that is ?
- 631 mark
Question 63
Two shuffling rules act on the set of all integers:
Both are functions from to . Which statement is correct?
- 641 mark
Question 64
Let , defined for every real . Which of the following is , in simplest form?
- 651 mark
Question 65
A packing line prints a code on every item: the -th item receives the code , where .
Read as a function this is not onto, so no inverse exists. The engineer therefore cuts the codomain down to exactly the codes that actually get printed,
and now is invertible. Which option gives , the inverse rule and the item carrying code , all three correctly?
- 661 mark
Question 66
A teacher splits six students, numbered to , into study circles. Every student is in exactly one circle, and " and are in the same circle" is recorded as an equivalence relation on (each student counts as being in the same circle as themself).
The register shows that contains exactly ordered pairs.
How many circles are there, what are their sizes, and how many different relations on fit this register?
- 671 mark
Question 67
Let be defined by , where and are real numbers with . If for every , then equals
- 681 mark
Question 68
For a real number , let be the greatest integer less than or equal to . So , and . Define by
Which statement about is correct?
- 691 mark
Question 69
A queue of customers is numbered by the natural numbers . When a new customer joins at the front, everyone's number goes up by one: , . A clerk tries to undo this with ,
Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.
Assertion: , the identity function on , and yet is not invertible.
Reason: The condition forces to be one-one but does not force 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.
- 701 mark
Question 70
A sensor reading is first calibrated by , , and then passed through an unknown processing stage . Tests show that the complete pipeline gives
Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.
Assertion: , and therefore .
Reason: Since is a bijection, .
(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.
- 711 mark
Question 71
A parcel's declared value passes through two conversion stages. Stage one applies , ; stage two applies , . A parcel entering with value leaves the pipeline with value . Both and 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: .
Reason: For any two invertible functions , .
(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.
- 721 mark
Question 72
A delivery company charges for a parcel by the rule , where is a scaled weight reading that can be negative after tare correction:
Given below are two statements, one labelled Assertion and the other labelled Reason. Choose the option that correctly describes them.
Assertion: is onto but not one-one.
Reason: Each of the two pieces of 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.
- 731 mark
Question 73
A depot numbers its storage bins with the natural numbers . A relabelling scheme is any function from to : bin gets the new label . 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 which is one-one, is not onto, and whose range misses infinitely many natural numbers; and there is a function which is onto and for which every natural number has exactly two preimages.
Reason: For every finite set and every function , if is onto then 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.
- 744 marks
Question 74
Let be the set of all students in a school, and let be the relation on given by if and only if and study in the same class. Write for the set of all equivalence classes of . Every student belongs to exactly one class. For two classes and , write when some student of class has a sibling who studies in a different class . Throughout, no student has more than one sibling in the school.
Attempt any four of the following five sub-questions.
(a) Prove that is an equivalence relation on the set of students, and say what the elements of are in terms of the school.
(b) The school has students with in each class. Find . Then show that the map sending each student to their own class is onto but not one-one.
(c) Prove that is always symmetric, and that for every class . Deduce that if is non-empty then cannot be transitive.
(d) Suppose instead that the students are spread over classes of . Find the largest possible value of , and describe an arrangement of siblings that attains it.
(e) Still with 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 classes of 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 attains its largest value.
- 754 marks
Question 75
A school coding club hides messages with a letter-shifting rule. Each letter is first replaced by a number from to :
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Let . The club's encoding function is
For example, , because ; and , because .
Attempt any four of the following five sub-questions.
(a) Prove that is one-one.
(b) Explain why is onto, and find , writing it as a letter.
(c) The club decodes with the remainder when is divided by (taking the remainder between and even when is negative). Show that for every , and decode the received letter D (that is, ).
(d) A new member suggests the key the remainder when is divided by . Show that is not one-one, and find how many elements its range has.
(e) Find every letter that leaves unchanged, that is, every with . Show that these are also exactly the letters left unchanged by .
- 764 marks
Question 76
A bank's ledger software records, for each transaction, its net effect on the balance, a real number of rupees. Instead of storing itself, a summary field stores only the direction of the transaction, computed by the signum function
Two transactions are said to be indistinguishable in the summary when they get the same summary field. This defines a relation on :
One day's ledger contains the five amounts .
Attempt any four of the following five sub-questions.
(a) Show that the summary field throws information away: is not one-one and not onto . Give two specific transaction amounts for the first and one specific unreachable value for the second, and state the range of .
(b) Find the sets , and — the three pools of transaction amounts that share each summary value — and prove that these three sets partition .
(c) Prove that is an equivalence relation on the set of possible transaction amounts, and identify the set of all equivalence classes of (written ) with the three pools of part (b). How many elements does have — that is, how many transaction directions can the ledger tell apart?
(d) The engineers replace the codomain by . Show that is then onto but still not one-one. Prove that if a subset is such that restricted to is a bijection onto , then has exactly three elements, and construct one such .
(e) Let . Write the classes of and compute . Then count the equivalence relations on every one of whose classes consists of amounts of a single direction, and justify the count.
- 774 marks
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 of possible scores: contestant with score survives against the contestant with score when is at most the square of . Formally,
Write for the squaring map used in the test.
Attempt any four of the following five sub-questions.
(a) Show that is not reflexive by naming one score. Then find all scores for which , and state exactly which scores make reflexivity fail.
(b) Show that is not symmetric, using the scores and . Then find all real for which and both lie in .
(c) Show that is not transitive by verifying the three inequalities for the scores , , . Then find a second counterexample in which all three scores are positive, and verify it.
(d) Find the range of . Hence find the set of scores that survive against every contestant, and the set of scores against which every contestant survives, justifying both answers from the range of .
(e) Only five scores were actually recorded: . Let . Compute , decide whether is transitive with a counterexample if it is not, and find the least number of ordered pairs that must be added to to make it reflexive on .
- 784 marks
Question 78
A pressure gauge is accurate only to within unit. So the lab treats two readings and as matching when they differ by less than . On the set of possible readings this gives the relation
On one day the gauge recorded exactly five readings:

Let be the matching relation restricted to these five readings.
Attempt any four of the following five sub-questions.
(a) Prove that is reflexive and symmetric on .
(b) Using three of the readings in , show that is not transitive.
(c) Find , the number of ordered pairs in .
(d) Find the smallest equivalence relation on that contains . Write its equivalence classes, and find how many ordered pairs must be added to to obtain it.
(e) A sixth reading , different from the five above, is recorded, and the same construction is repeated on : take the matching pairs among the six readings, then the smallest equivalence relation containing them. Find every real for which this equivalence relation has exactly one class.
- 791 mark
Question 79
A puzzle machine accepts any real number other than and and replaces it by
so with . (The value is never , and would need , so does map into .) The number is fed in, and each output is fed straight back in, times in all. What is the final output?
- 804 marks
Question 80
A magician uses a deck of cards. The positions in the deck are numbered (top) to (bottom). In a perfect out-shuffle the deck is cut into a top half (positions to ) and a bottom half (positions to ), 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

Let and let send each position to the position that the card at occupies after one out-shuffle. Write , , , where is the identity function on .
Attempt any four of the following five sub-questions.
(a) Write as a table, and show that is a bijection.
(b) Find and show that . Hence write down , and state the least number of out-shuffles that brings the deck back to its original order.
(c) On define if and only if for some ; that is, the card at position reaches position after , or out-shuffles. Show that is an equivalence relation, write its equivalence classes, and find the number of ordered pairs in .
(d) In a perfect in-shuffle the halves are interleaved with the bottom half first, so the new deck holds the cards from positions . Let be its position function, defined in the same way as . Write as a table, and find and . What does the result show?
(e) Find the least for which , where is composed with itself times.
