retagged by
879 views
0 0 votes
Prove that : log*(log n) = log*n -1.

1 Answer

0 0 votes

The iterated logarithm of n, written log* n (usually read "log star"), is the number of times the logarithm function must be iteratively applied before the result is less than or equal to 1.

In the question log*(log n) = log*n -1 if we are taking log then we are reducing the one count.

So in the result we have to subtract 1.

if the case is log*(log(log( n))) = log*n -2.

so by resoning we can prove this.

Position:
Show:

Related questions

0 0 votes
1 1 answer
725
725 views
akash.dinkar12 asked Jun 28, 2019
725 views
Obtain asymptotically tight bounds on $lg\ (n!)$ without using Stirling’s approximation. Instead, evaluate the summation $\sum_{k=1}^{n} lg\ k$.
0 0 votes
2 2 answers
680
680 views
akash.dinkar12 asked Jun 26, 2019
680 views
Prove that $n!=\omega(2^n)$ and $n!=o(n^n)$.
0 0 votes
0 0 answers
313
313 views
akash.dinkar12 asked Apr 4, 2019
313 views
Show that $K$ $ln$ $K = \Theta (n)$ implies $k=$$\Theta$$($$n$$/$$ln$ $n$$)$.
0 0 votes
0 0 answers
378
378 views
akash.dinkar12 asked Apr 4, 2019
378 views
Show that the golden ratio $\phi$ and its conjugate $\hat{\phi}$ both satisfy the equation $x^2=x+1$.