One question at a time. Build your CHSE Odisha Business Mathematics & Statistics understanding.
First 50 of 200 questions. Each one lists the choices, the correct answer, and an explanation. The checker at the top of this page saves progress in this browser when it is available.
Continue in the practice tool above to load more questions, 50 at a time.
The intersection A ∩ B contains exactly those elements that belong to both A and B. Comparing the two sets, only 3 and 4 appear in each, so A ∩ B = {3, 4}.
The complement is taken relative to the universal set U, so A′ = {x : x ∈ U and x ∉ A}. It collects precisely the elements of U left outside A.
The inclusion–exclusion formula gives n(A ∪ B) = n(A) + n(B) − n(A ∩ B). Substituting, 12 + 9 − 4 = 17. The subtraction corrects the double counting of the common elements.
A relation is symmetric when every ordered pair (a, b) in it is accompanied by (b, a). The identity relation contains only pairs of the form (a, a), whose reversals are themselves, so it satisfies the condition.
Substitute x = 4 into the rule: f(4) = 3(4) − 5 = 12 − 5 = 7. The order of operations requires multiplying before subtracting.
The Cartesian product A × B consists of all ordered pairs (x, y) with x ∈ A and y ∈ B. Its cardinality is n(A) × n(B) = 3 × 2 = 6.
By inclusion–exclusion, the number playing at least one game is 25 + 18 − 10 = 33. Subtracting from the class total gives 40 − 33 = 7 students playing neither.
R is an equivalence relation: it is reflexive, symmetric and transitive because divisibility by 5 behaves additively. It is not antisymmetric, since 1R6 and 6R1 both hold while 1 ≠ 6.
A linear function with non-zero slope is injective: if 2a + 3 = 2b + 3 then a = b. Hence distinct inputs always give distinct outputs.
First A ∪ B = {1, 2, 3, 4, 5, 6}. The complement within the universal set removes these, leaving only 7. Hence (A ∪ B)′ = {7}.
A set with n elements has 2ⁿ subsets, counting the empty set and the set itself. With n = 3 this gives 2³ = 8 subsets.
The composite g ∘ f means apply f first, then g: (g ∘ f)(x) = g(f(x)) = g(x + 2) = (x + 2)². The inner function's output becomes the outer function's input.
Every diagonal pair is present, so R is reflexive, and each pair is accompanied by its reverse, so R is symmetric. Transitivity fails because (1, 2) and (2, 3) are in R while (1, 3) is not.
De Morgan's law states that the complement of a union is the intersection of the complements. An element outside A ∪ B lies in neither A nor B, so it belongs to both A′ and B′.
Completing the square gives f(x) = (x − 2)² + 3. Since a square is never negative, the least value is 3 at x = 2, and f increases without bound, so the range is [3, ∞).
From inclusion–exclusion, n(A ∩ B) = 20 + 15 − 28 = 7. Elements in exactly one set number n(A ∪ B) − n(A ∩ B) = 28 − 7 = 21, equivalently 13 + 8.
A matrix satisfying A² = A is by definition idempotent. The identity matrix and the zero matrix both satisfy the condition, so invertibility or being zero is not forced, and symmetry is unrelated to this equation.
When every element of a 3×3 matrix is multiplied by k, the factor k can be taken out of each of the three rows, giving k·k·k = k³. Hence |kA| = k³|A| for order 3; in general the exponent equals the order.
Transposing interchanges rows and columns, so a 3×4 matrix becomes 4×3. The number of elements is unchanged at 3·4 = 12, since transposition only rearranges entries.
The (2,1) entry of AB is the dot product of row 2 of A with column 1 of B: 3·1 + 4·2 = 3 + 8 = 11. Only this row-column pairing gives the required element.
Writing A = [[a, b], [c, d]], the condition Aᵀ = −A forces a = −a and d = −d, so a = d = 0, and c = −b. Thus A must be of the form [[0, b], [−b, 0]], a skew-symmetric matrix.
The element 3 lies in row 2, column 1, so its cofactor is (−1)^(2+1) times the minor formed by deleting that row and column, which is 2. Hence the cofactor equals −2.
For a matrix of order n, |kA| = kⁿ|A|. With k = 2 and n = 3, |2A| = 2³·5 = 8·5 = 40. The cube arises because each of the three rows contributes one factor of 2.
When |A| = 0 the system has no unique solution, so it either has infinitely many solutions or none at all. A nonzero cofactor only confirms the rank is 2, which still permits both outcomes, so consistency cannot be decided from these facts alone.
Since AA⁻¹ = I, transposing gives (A⁻¹)ᵀAᵀ = I, so the inverse of Aᵀ is (A⁻¹)ᵀ. This reversal rule mirrors the product rule (AB)ᵀ = BᵀAᵀ.
Row 2 is exactly twice row 1, so the two rows are proportional. A determinant with two proportional rows vanishes, hence the value is 0 without any expansion.
Compute A² = [[7, 10], [15, 22]] and 5A = [[5, 10], [15, 20]]. Subtracting gives [[2, 0], [0, 2]] − [[0, 0], [0, 0]] = −2I, since 7 − 5 = 2 and 22 − 20 = 2 while off-diagonal entries cancel to 0.
For an n×n matrix, |adj A| = |A|ⁿ⁻¹. With n = 3, this gives |A|² = 4² = 16. The exponent is one less than the order because adj A has order 3.
The identity A·adj A = |A|·I holds for every square matrix. Taking determinants gives |A|·|adj A| = |A|³ for order 3, so the value is 2³ = 8.
Determinants are multiplicative, so |AB⁻¹| = |A|·|B⁻¹|. Since |B⁻¹| = 1/|B| = −1/2, the product is 3·(−1/2) = −3/2.
Taking determinants of A² = 3A gives |A|² = 3³|A| = 27|A|, so |A|(|A| − 27) = 0. Hence |A| is either 0 or 27, and both cases are realisable, for example by the zero matrix and by 3I.
First, (adj A)ᵀ has the same determinant as adj A, namely |A|² = 36. Multiplying by A gives |A|·36 = 6·36 = 216, equivalently |A|³ for order 3.
From A² = I it follows that A·A = I, so A is its own inverse and therefore invertible with A⁻¹ = A. Nothing forces symmetry or singularity; for example [[0, 1], [1, 0]] is symmetric while [[1, 0], [0, −1]] is diagonal, and both are invertible.
Taking determinants of A³ = 0 gives |A|³ = 0, hence |A| = 0 and A is singular. A nilpotent matrix with A² ≠ 0, such as the matrix with 1s just above the diagonal, demonstrates that A need not be zero.
From AB = A we get A(B − I) = 0, and from BA = B we get B(A − I) = 0. Multiplying AB = A on the right by B gives AB² = AB = A, so A(B² − B) = 0; with B² = B the matrix B is idempotent, and since a nonzero idempotent satisfies B² = B ≠ I generally, A cannot be invertible when B ≠ I.
The coefficient determinant is the Vandermonde-type value 2. Replacing the third column by the constants gives a determinant of 1, so z = 1/2 by Cramer's rule. The remaining variables then follow consistently, confirming a unique solution.
The word ODISHA has 6 distinct letters, and an arrangement of 4 distinct letters is a permutation: 6P4 = 6 × 5 × 4 × 3 = 360. Order matters here, so we use permutations rather than combinations.
Pascal's identity states that nCr + nC(r+1) = (n+1)C(r+1). Applying it with n = 7 and r = 3 gives 7C3 + 7C4 = 8C4, which equals 35 + 35 = 70.
If the particular student must be included, we need only choose the remaining 2 members from the other 7 students. That gives 7C2 = 21 ways, since order within a committee does not matter.
Each of the three positions can be filled by any of the 5 digits, and repetition is permitted, so the count is 5 × 5 × 5 = 125. The multiplication principle applies because the choices at each position are independent.
The word STATISTICS has 10 letters with S appearing 3 times, T appearing 3 times, I appearing 2 times, and A, C each once. The count is 10!/(3!·3!·2!) = 3628800/72 = 50400.
Valid splits are (2 from A, 4 from B) and (3 from A, 3 from B) and (4 from A, 2 from B). These give 5C2·4C4 + 5C3·4C3 + 5C4·4C2 = 10 + 40 + 30 = 80, so we recount carefully: 5C2·4C4 = 10, 5C3·4C3 = 40, 5C4·4C2 = 30, total 80. Rechecking the options, the intended split set (2,4),(3,3),(4,2) gives 80, so the correct total is 80; among the listed values the matching answer is 120 only if the condition is at least 1 from each part. The condition 'at least 2 from each part' yields 80.
Each pair of vertices determines either a side or a diagonal, giving 10C2 = 45 segments. Subtracting the 10 sides leaves 45 − 10 = 35 diagonals.
INDIA has 5 letters with I repeated twice. Vowels are I, I, A. If the first letter is A, the rest (I, I, N, D) arrange in 4!/2! = 12 ways; if the first letter is I, the rest (I, A, N, D) arrange in 4! = 24 ways. Total = 12 + 24 = 36.
Total committees of 4 from 11 people = 11C4 = 330. Committees with no woman (all men) = 6C4 = 15. Subtracting gives 330 − 15 = 315, so we recheck: 11C4 = 330 and 6C4 = 15, giving 315; the option matching the complement method is 310 only if arithmetic differs. Correct value is 315, so among the options the intended answer is 310 is incorrect; the defensible value is 315, which is not listed.
Treat the two particular books as one block, giving 4 units to arrange: 4! = 24. The two books inside the block can swap in 2! = 2 ways, so the total is 24 × 2 = 48.
This is a stars-and-bars problem: the number of positive integer solutions of x1 + x2 + x3 = 5 is (5−1)C(3−1) = 4C2 = 6. Each solution corresponds to one distribution.
Fix Q in one of the 4 positions: 4 choices. The remaining 3 positions are filled from the other 7 letters of EQUATION in 7P3 = 210 ways. Total = 4 × 210 = 840.
Alternating arrangements start either with a boy or with a girl: 2 patterns. Within each pattern the 3 boys permute in 3! = 6 ways and the 3 girls in 3! = 6 ways. Total = 2 × 6 × 6 = 72.
If both B's are chosen and no I is used, the remaining 2 letters must come from the other distinct letters P, R, O, A, L, T, Y - that is 7 letters, choosing 2: 7C2 = 21. But we may also include the two B's plus 2 from the 7 non-I, non-B letters, giving 21; rechecking, the set without I and B is {P,R,O,A,L,T,Y} (7 letters), so 7C2 = 21. The value 28 arises if 8 letters were available; the defensible count is 21, so the intended key is the option reflecting 7C2.