GATE-2024-CS1(Forenoon)
October 23, 2024
Asymptotic-Complexity
October 23, 2024
GATE-2024-CS1(Forenoon)
October 23, 2024
Asymptotic-Complexity
October 23, 2024

Logarithms

Question 2
Which of the following statements is TRUE for all sufficiently large integers n?
A
22√(log log n) < 2 < √(log n) < n
B
2√(log n) < n < 22√(log log n)
C
n < 2√(log n) < 22√(log log n)
D
n < 22√(log log n) < 2√(log n) <
E
2√(log n) < 22√(log log n) < n
Correct Answer: A

Leave a Reply

Your email address will not be published. Required fields are marked *