retagged by
1,002 views

2 Answers

1 1 vote

I am attaching the solution in the form of an image below where I have also proved the property of logarithms that is used in this question.

Position:
Show:

Related questions

1 1 vote
3 3 answers
2.8k
2.8k views
Tushar Garg asked Jul 4, 2018
2,756 views
How to find log n base2+ log n base 3+ log n base4+........log n base n?
0 0 votes
2 answers 2 answers
858
858 views
dragonball asked Aug 2, 2018
858 views
How the slowness and the fastness of any algorithm depends ?Is (n/logn) is slower than log(logn) ?
1 1 vote
3 3 answers
2.5k
2.5k views
Anu asked May 18, 2015
2,526 views
which of the following is correct?
0 0 votes
1 1 answer
372
372 views
Hatim asked Dec 3, 2025
372 views
· f1 = log(n!)· f2 = (log n)!. f3 = (log n)^log n. f4 = (log n)^log log n. f5 = (log log n)^log narrangement in increasing order?