Solve the inequality
and state the least positive integer solution.
Establish the domain first, since logarithms restrict it. The presence of already forces . For the left logarithm we need ; substituting turns this into , whose discriminant is
With a negative discriminant and a positive leading coefficient, is positive for every , so this imposes nothing new. The right logarithm needs , which is automatic. Hence the domain is exactly .
Fold the coefficient into the logarithm. Using , valid because :
Now both sides are single base- logarithms.
Drop the logarithms in the correct direction. Since the base , is strictly increasing, so the inequality between logarithms is equivalent to the same inequality between arguments — with no sign flip:
If the base were between and , this step would reverse the sign.
Expand and watch the terms cancel. Since ,
Subtracting from both sides removes the quadratic-in- part entirely and leaves a linear inequality in :
Square safely and intersect with the domain. Both sides of are nonnegative, so squaring preserves the inequality:
This already lies inside the domain , so the solution set is .
Pick the least positive integer and test it. The smallest integer strictly greater than is , which is option 1. Direct substitution confirms the strictness of the boundary: at the two sides are and , equal and therefore not a solution, while at the left side is and the right is , so the inequality holds. Testing all fail and all pass, matching .
Need to solve a different problem like this? Open the solver →