Solve the inequality
and give the smallest positive integer solution.
Fix the domain. The radical forces . With , the first argument is , whose discriminant is ; since the leading coefficient is positive, it is always positive. The second argument as well. So the domain is simply and no candidate solutions will be lost later.
Pull the coefficient 2 inside the logarithm. Using :
Now both sides are a single logarithm with the same base, which is the only form in which arguments can be compared directly.
Drop the logarithms. Because the base , is increasing, so the inequality between logs is equivalent to the same inequality between arguments (the direction is preserved; with a base below it would flip):
Expand and cancel. The right side is , and the terms cancel on both sides:
Square safely. Both sides are non-negative, so squaring preserves the inequality:
Read off the smallest integer. The smallest integer strictly greater than is , and it lies in the domain . Checking: while , so the inequality does hold at but fails at (both sides equal ).
Need to solve a different problem like this? Open the solver →