First, the question is probably what this function is big O of. Second, there are infinitely many answers, and you are probably looking for the slowest-growing one. Then 6^n is correct.

Results 1 to 6 of 6

- Oct 14th 2013, 08:35 AM #1

- Joined
- Sep 2012
- From
- Maryland
- Posts
- 15

- Oct 14th 2013, 09:17 AM #2

- Joined
- Oct 2009
- Posts
- 5,573
- Thanks
- 789

- Oct 14th 2013, 01:11 PM #3

- Joined
- Sep 2012
- From
- Maryland
- Posts
- 15

- Oct 14th 2013, 01:25 PM #4

- Joined
- Oct 2009
- Posts
- 5,573
- Thanks
- 789

- Oct 16th 2013, 08:25 AM #5

- Joined
- Oct 2009
- Posts
- 5,573
- Thanks
- 789

## Re: Big O problem

The function log(log(n)) grows very, v e r y slowly. If the logs are based 10, it returns 2 for n=10¹⁰⁰, which is greater than the number of particles in the universe. Nevertheless, this function tends to infinity as n → ∞.

I am not sure what exactly you difficulty with log(log(n)) is. Feel free to post concrete questions about these functions.

- Oct 16th 2013, 07:49 PM #6

- Joined
- Sep 2012
- From
- Maryland
- Posts
- 15