Rankbit System
JEE Physics: Waves (+15.5%) | Electrostatics: Concentric Shells (-29.7%) | Modern Physics: Photoelectric Clones (+34.2%) | Mathematics: Definite Integrals (+18.1%) | Chemistry: Coordination Splitting (-11.4%) | JEE Physics: Waves (+15.5%) | Electrostatics: Concentric Shells (-29.7%) | Modern Physics: Photoelectric Clones (+34.2%) | Mathematics: Definite Integrals (+18.1%) | Chemistry: Coordination Splitting (-11.4%)

If the domain of the function f(x) = log_e left(frac2x + 34x^2 + x - 3right) + cos^-1left(frac2x - 1x + 2right) is (alpha, beta] , then the value of 5beta - 4alpha is equal to

Solution & Explanation

### Related Formula textDomain of log_e(A): A gt 0 textDomain of cos^-1(B): -1 le B le 1 ### Core Logic Condition 1: Logarithm domain frac2x + 34x^2 + x - 3 gt 0 Factorizing the denominator: 4x^2 + 4x - 3x - 3 = 4x(x+1) - 3(x+1) = (4x-3)(x+1). frac2x + 3(4x - 3)(x + 1) gt 0 Critical points are x = -frac32, -1, frac34. Using the wavy curve method: The intervals where it is positive are left(-frac32, -1right) cup left(frac34, inftyright). Let this be set D_1. ### Step 1: Inverse Trigonometric Domain Condition 2: Arc cosine domain -1 le frac2x - 1x + 2 le 1 This breaks into two inequalities: (i) frac2x - 1x + 2 ge -1 Rightarrow frac2x - 1x + 2 + 1 ge 0 Rightarrow frac3x + 1x + 2 ge 0 Critical points are x = -2, -frac13. The valid set is (-infty, -2) cup left[-frac13, inftyright). (ii) frac2x - 1x + 2 le 1 Rightarrow frac2x - 1x + 2 - 1 le 0 Rightarrow fracx - 3x + 2 le 0 Critical points are x = -2, 3. The valid set is (-2, 3]. Intersection for the cosine domain (D_2): (-2, 3] cap left( (-infty, -2) cup left[-frac13, inftyright) right) = left[-frac13, 3right]. ### Step 2: Finding Total Domain Total domain D = D_1 cap D_2: D = left( left(-frac32, -1right) cup left(frac34, inftyright) right) cap left[-frac13, 3right] Since left[-frac13, 3right] starts strictly greater than -1, the overlap with left(-frac32, -1right) is empty. Overlap with left(frac34, inftyright) occurs from frac34 to 3. Thus, D = left(frac34, 3right]. ### Step 3: Calculating Final Expression Comparing with (alpha, beta]: alpha = frac34 and beta = 3. We need to find 5beta - 4alpha: 5(3) - 4left(frac34right) = 15 - 3 = 12 ### Pattern Recognition Compound domains always require individual set resolution (using Wavy Curve) followed by taking the strictest absolute intersection. Identifying disjoint segments (like x lt -1 missing the cosine bound) prunes manual checking. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 11 Maths: Functions

Reference Study Guides

More Functions Previous-Year Questions — Page 10

Q29 jee_main_2024_31_jan_morning Equivalence Relations
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 subset S and the number of elements in S is n. Then, the minimum value of n is
Numerical Answer. Answer: 16 to 16

Solution

### Core Logic S must be reflexive, symmetric, and transitive, containing (1,2), (2,3), and (1,4). Symmetric property forces (2,1), (3,2), (4,1) in S. Transitive property: (1,2) and (2,3) implies (1,3) in S. Symmetric implies (3,1) in S. (4,1) and (1,2) implies (4,2) in S. Symmetric implies (2,4) in S. (4,1) and (1,3) implies (4,3) in S. Symmetric implies (3,4) in S. ### Step 1: Universal Relation Since 1 is related to 2, 3, 4 and the relation is an equivalence relation (which creates partitions), all elements 1, 2, 3, and 4 must fall into the same single equivalence class. Thus, S must contain all possible ordered pairs in A times A. ### Step 2: Final Count Number of elements in A times A = 4 times 4 = 16. Minimum value of n is 16. ### Pattern Recognition If a relation connects all elements in a set to each other through a chain, its equivalence closure is the universal relation A times A. ### Evaluation Rubric / Model Answer null ### Chapter Mix Class 12 Maths: Relations and Functions

More Functions Questions — jee_main_2024_30_january_evening

Practice all Functions previous-year questions →

YOUR FIRST PREP STEP STARTS HERE

We Map Every Repeating Question in Competitive Exams.

Say goodbye to generic mock test fatigue. RankBit uses smart analysis to group past exam questions into their foundational Repeating Question Types. Find chapter weightage, track repeating questions, and score higher with targeted practice.

Select Your Target Exam

Choose an exam track below to find formulas per chapter and patterns.

Syncing Exam Intelligence

Mapping formulas and patterns across all tracks…

PATH A — FULL LENGTH PRACTICE

Full Mock Test Hub

Simulate real NTA exam conditions with fully tracked mocks. Time yourself against past papers.

Under Development
PATH B — TARGETED PRACTICE

Topic-wise Practice Hub

Practice past-year questions one chapter at a time. Pick an exam → subject → chapter and get every PYQ for that topic — pulled together from all past papers — with the chapter's key formulas alongside.

Loading Questions... Browse Topics
Latest from the Blog
View all →

Loading articles...