The number of distinct integers n for which log
Correct Answer :
2
Solution :
The correct answer is 2.
We need to find the number of distinct integers n for which:
Step 1 – Recall the behaviour of logarithms with base between 0 and 1.
The base of the logarithm here is , which satisfies 0 < base < 1. For such a base, the logarithmic function is decreasing. This means:
if and only if
(Since , and the function is decreasing, it is non-negative only when the argument is at most 1, while remaining positive for the log to be defined.)
Step 2 ��� Set up the compound inequality.
Letting , we need:
Step 3 – Solve the right-hand inequality: n² − 7n + 11 ≤ 1.
Factorising:
This quadratic inequality holds when .
Step 4 – Solve the left-hand inequality: n² − 7n + 11 > 0.
The discriminant of is:
The roots are:
Since , the roots are approximately 2.382 and 4.618.
The quadratic is positive (opens upwards) when or .
Step 5 – Find the intersection of both conditions for integer values of n.
We need integers n satisfying both:
• (from Step 3)
• or (from Step 4)
The integer candidates in [2, 5] are: n = 2, 3, 4, 5.
Now applying the second condition:
• n = 2: 2 < 2.382 ✔ → n² − 7n + 11 = 4 − 14 + 11 = 1 > 0 ✔
• n = 3: 3 is NOT < 2.382 and NOT > 4.618 ✘ → n² − 7n + 11 = 9 ��� 21 + 11 = −1 < 0 (argument is negative, log undefined)
• n = 4: 4 is NOT < 2.382 and NOT > 4.618 ✘ → n² − 7n + 11 = 16 − 28 + 11 = −1 < 0 (argument is negative, log undefined)
• n = 5: 5 > 4.618 ✔ → n² − 7n + 11 = 25 − 35 + 11 = 1 > 0 ✔
Step 6 – Verify the two valid values.
For n = 2 and n = 5, the argument equals 1:
✔
These are the only integers in the valid range, since n = 3 and n = 4 make the argument negative (−1), rendering the logarithm undefined.
Therefore, the number of distinct integers n satisfying the given inequality is 2.
Access expert-curated educational resources and study materials—completely free.
Create, conduct, and manage professional online assessments with Mindyard. Perfect for teachers and institutes.
Copyright © 2026 Mindyard. All Rights Reserved.