JEE Main Previous Year Questions on Sets
Uploaded by
navyaarora235JEE Main Previous Year Questions on Sets
Uploaded by
navyaarora235Common questions
Powered by AIGiven 73% of people like coffee and 65% like tea, the principle of inclusion-exclusion finds the overlapping percentage of people liking both. x must satisfy 73 + 65 - x >= 0. Therefore, x cannot be 63, as it would exceed 100 when added to the other percentages. Thus, only values that maintain overall percentages within bounds are possible .
In set theory, understanding the statement ¬(A ∩ B) ⊆ C is crucial for proving subsequent deductions about A, B, and C. For example, if (A - C) ⊆ B, it does not imply A ⊆ B unless additional conditions hold, because the elements of A possibly excluded from C must all belong to B, otherwise the initial premise is violated. This logical relationship requires careful analysis of intersections and exclusions, illustrating set theory's reliance on conditional logic .
The equation 3x(3x - 1) + 2 = |3x - 1| + |3x - 2| contains symmetric and linear configurations disrupted by absolute values, thus the function may have common solutions across distinct intervals. Application of piecewise analysis, considers 3x-conditions separately per segment breaking at x = 1/3 and x = 2/3, identifying convergence at four putative points. Solving piecewise separates locations and consolidates asymptotic encounters into isolated solutions .
The function f(x) = ⌊x + 1/x^2⌋ involves analyzing the continuous function's range x ∈ (1, 3) combined with greatest integer rounding. The calculations between these intervals must address oscillations in x and 1/x boundaries which dictate specific f(x) outputs, revealing gaps and jumps. Consequently, discrete ranges emerge with calculations showing valid integer sequences such as [2, 7] exclusive of mid-ranges due to ceiling gaps .
The intersection of sets A and B involves analyzing the conditions from the quadratic equation where A = {m ∈ R : both roots of x^2 – (m+1)x + m + 4 = 0 are real} and B = [-3, 5). For real roots, the discriminant (b^2 - 4ac) must be greater than or equal to zero. Solving m^2 - 7m + 4 >= 0 gives m <= 3 or m >= 4. Thus, A = (-∞, 3] ∪ [4, ∞). The intersection A ∩ B = {–3}, since –3 is the only element common to both within the defined intervals .
Set T is an element of exactly 20 sets of Xi's and 6 sets of Yi's, where each Xi contains 10 elements and each Yi contains 5 elements. The union of all sets Xi and Yi gives T = ∪(X_i ∪ Y_i) for i = 1 to n, where each element appears in 20 out of 50 X sets and 6 out of 50 Y sets. Using inclusion-exclusion principles, the number of elements in T is calculated as n = 30 .
The given equation is log_1/2 |sin x| = 2 - log_1/2 |cos x| for x in [0, 2π]. Rewriting this using log rules, we set |sin x| * |cos x| = 1/4. Solving these trigonometric equality conditions, particularly using sin x = ±1/2 and cos x = ±1/2 within the specified domain, yields four major intervals from which to find the number of x-coordinates for which both sides satisfy. The solutions are found to be 8 .
The principle of complement and parity helps to count subsets with given properties. For set S = {1, 2, ..., 100}, calculate subsets where the product of elements is even. Since half the elements (1 to 50) are odd, their subsets' product is odd. Total subsets = 2^100 - 1; half of these are solely odd-producing and are excluded when counting even subsets. Thus, subsets with an even product are 2^100 - 2^50 .
When evaluating (C ∪ A) ∩ (C ∪ B) = C, using the fundamental operations of sets, elements are analyzed from A, B or C for consistency. Given A ≠ B ⊆ C, elements common to A or B reflect exclusively within C's constraints, making overlap absent outside C. Continuous verification over different dissections maintains intersection rests in C only. Thus the particular focus is on lawful union boundary maintenance .
For set A, solve 2(x+2)(x^2-5x+6)=1 only for integer x within feasible solving of polynomials, yielding roots satisfying two factor sets each. For B, solve inequalities -3 < 2x - 1 < 9 yielding x in the bounded region [1, 5]. Only integer solutions from A and B validly combined dictate subset configurations; further multiply the list of solutions for A × B determining possible combinations and subsets number is 2^15 .