Let A=\1, 2, 3, , 20\. Let R1 and R2 be two relations on A such that R1=\(a, b): b is divisible by a\ R2=\(a, b): a is an integral multiple of b\. Then, number of elements in R1-R2 is equal to .
Relations and Functions (Class 12)
Previous year questions with solutions · 2024 – 2026
Year-wise statistics questions · papers · average per paper · weightage
| Year | Questions | Papers | Avg / paper | Weightage |
|---|---|---|---|---|
| 2026 | 20 | 19 | 1.1 | 4.21% ▼ 23.1% vs last year |
| 2025 | 26 | 19 | 1.4 | 5.47% ▲ 17.3% vs last year |
| 2024 | 28 | 20 | 1.4 | 4.67% |
Consider the relations R1 and R2 defined as a R1 b a2+b2=1 for all a, b R and (a, b) R2(c, d) a+d=b+c for all (a, b),(c, d) N N. Then :
- R1 and R2 both are equivalence relations
- Only R1 is an equivalence relation
- Only R2 is an equivalence relation
- Neither R1 nor R2 is an equivalence relation
If f(x)= 4x+36x-4, x 23 and (f f)(x)=g(x), where g: R- \ 23 \ R- \ 23 \, then (g g g)(4) is equal to
- -4
- 1920
- - 1920
- 4
Let A=\1, 2, 3, 4\ and R=\(1, 2), (2, 3), (1, 4)\ be a relation on A. Let S be the equivalence relation on A such that R S and the number of elements in S is n. Then, the minimum value of n is .
Let A=\1, 2, 3, , 100\. Let R be a relation on A defined by (x, y) R if and only if 2x=3y. Let R1 be a symmetric relation on A such that R R1 and the number of elements in R1 is n. Then, the minimum value of n is .
Let A=\1,2,3, , 7\ and let P(A) denote the power set of A. If the number of functions f: A P(A) such that a f(a), a A is mn, m and n N and m is least, then m+n is equal to .
Let f: R-\0\ R be a function satisfying f ( xy )= f(x)f(y) for all x,y,f(y) 0. If f'(1)=2024, then
- xf'(x)+2024f(x)=0
- xf'(x)-2023f(x)=0
- xf'(x)-2024f(x)=0
- xf'(x)+f(x)=2024
The number of symmetric relations defined on the set \1,2,3,4\ which are not reflexive is .
Let R be a relation on Z Z defined by (a, b)R(c, d) if and only if ad-bc is divisible by 5. Then R is
- Reflexive and transitive but not symmetric
- Reflexive and symmetric but not transitive
- Reflexive but neither symmetric nor transitive
- Reflexive, symmetric and transitive
If f(x)= cases2+2x, & -1 x<0\ 1- x3, & 0 x 3 cases; g(x)= cases-x, & -3 x 0\ x, & 0<x 1 cases, then range of (f g)(x) is
- [0,1)
- [0,3)
- (0,1]
- [0,1]
If R is the smallest equivalence relation on the set \1,2,3,4\ such that \(1,2),(1,3)\ , then the number of elements in R is .
- 15
- 10
- 12
- 8
Let S=\1,2,3, ,10\. Suppose M is the set of all the subsets of S, then the relation R=\(A, B):A B ; A, B M\ is :
- symmetric only
- reflexive only
- symmetric and reflexive only
- symmetric and transitive only
The function f:N-\1\ ; defined by f(n)= the highest prime factor of n, is :
- one-one only
- neither one-one nor onto
- onto only
- both one-one and onto
Let f:R- \ -12 \ and g:R- \ -52 \ be defined as f(x)= 2x+32x+1 and g(x)= |x|+12x+5. Then, the domain of the function fog is :
- R- \- 74 \
- R
- R- \- 52,- 74 \
- R- \- 52 \