JEE Main 2025MathematicsSets And RelationsSymmetric Transitive And Reflexive PropertiesmediumMCQ

JEE Main 2025Sets And Relations Question with Solution

From: JEE Main 2025 (Online) 8th April Evening Shift

Question

Let A = {0, 1, 2, 3, 4, 5}. Let R be a relation on A defined by (x, y) ∈ R if and only if max{x, y} ∈ {3, 4}. Then among the statements

(S1): The number of elements in R is 18, and

(S2): The relation R is symmetric but neither reflexive nor transitive

Choose an option

Show full solutionCorrect option: C
Correct answer
C

only (S2) is true

Step-by-step explanation

To evaluate the relation on the set , we first need to understand the conditions for an element to be in . Specifically, if and only if .

Considering this, let's list the pairs:

For , the possible pairs are:

For , the possible pairs are:

Combining these, the set consists of the following elements:

This gives us a total of 16 elements in , not 18 as initially claimed in statement .

Next, we analyze the properties of the relation :

Reflexivity: A relation is reflexive if for all . For example, are not in , so is not reflexive.

Symmetry: A relation is symmetric if whenever , then as well. For all pairs listed, both and are present. Thus, is symmetric.

Transitivity: A relation is transitive if whenever and , then . An example where transitivity fails is and are in but is not in . Therefore, is not transitive.

In conclusion, statement is correct as is symmetric but neither reflexive nor transitive.

Practice this on the real CBT interface

Solve this JEE Main question (and the rest of the Sets And Relations chapter) on PrepSharp's TCS iON-style CBT player — with timer, bookmarks and session analytics.

Solve interactively →

About this question

This is a previous-year question from JEE Main 2025, covering the Sets And Relations chapter of Mathematics. PrepSharp catalogues every PYQ from JEE Main with a verified answer key and step-by-step solution prepared by IIT alumni — so you can search by chapter, topic or year and revise efficiently.