CUET · MATHS · PYQ PAPER 2025

Let a relation \(R=\{(a, b): a\) is a factor of \(b, a, b \in N\}\). Then, \(R\) is __________.

A Reflexive and Symmetric but NOT Transitive.
B Symmetric and Transitive but NOT Reflexive.
C Reflexive and Transitive but NOT Symmetric.
D Equivalence Relation.

Verified Solution

Answer & Solution

Correct Answer

(C) Reflexive and Transitive but NOT Symmetric.

Step-by-step Solution

Detailed explanation

\(a\) is a factor of \(a\). R is Reflexive. Let \((2,4) \in R\) since \(2\) is a factor of \(4\). \((4,2) \notin R\) since \(4\) is not a factor of \(2\). R is NOT Symmetric. Let \((a,b) \in R \Rightarrow b=k_1 a\) for \(k_1 \in N\). Let \((b,c) \in R \Rightarrow c=k_2 b\) for…

Apply the relevant identity from the chapter and substitute the values established in the previous step, keeping the original constraint in view.

Use the simplified expression to isolate the unknown, then plug the result back into the question setup to confirm the working is internally consistent.

Cross-check against a boundary or limiting case. Both the dimensional balance and the qualitative behaviour at the extreme should agree with the candidate answer.

Combine the steps above to identify the correct option. The remaining choices each fail at least one of the consistency, dimensional, or boundary checks.

Same subject

The corner points of the bounded feasible region determined by the system of linear inequalities are \((0,0),(2,4),(0,5)\) and \((4,0)\). If the maximum value of \(Z=a x+b y\), where \(a, b>0\) occurs at both \((2,4)\) and \((4,0)\), then

CUET 2025 Easy

Match List - I with List - II.

LIST - I	LIST - II
(A) \((\hat{i} \times \hat{j})+(\hat{j} \times \hat{i})\)	(I) 1
(B) \(\hat{i} \cdot \hat{i}+\hat{j} \cdot \hat{j}+\hat{k} \cdot \hat{k}\)	(II) \(\hat{k}-\hat{j}\)
(C) \(\hat{i} \times(\hat{i}+\hat{j}+\hat{k})\)	(III) \(\overrightarrow{0}\)
(D) \(\hat{i} \cdot(\hat{i}+\hat{j}+\hat{k})\)	(IV) 3

Choose the correct answer from the options given below :

CUET 2023 Easy

Explore more questions on app

From CUET

Explore more questions on app