Determine whether each of the functions log(n + 1) and log(n2 + 1) is o(log n)

1 answer:

8 0

Assuming the order required is as n-> inf.

As n->inf, o(log(n+1)) -> o(log(n)) since the 1 is insignificant compared with n.

We can similarly drop the "1" as n-> inf, the expression becomes log(n^2+1) ->
log(n^2)=2log(n) which is still o(log(n)).

So yes, both are o(log(n)).

Note: you may have more offers of answers if you post similar questions in the computer and technology section.

You might be interested in

Say you wanted to give someone 35000 berries, but every time you give someone berries, it takes away 30%. How could you calculat

VladimirAG [237]

Answer:

What I understand is that I need to give someone an exact number so that when 30% is taken, they keep exactly 35,000

To make the statement above true, we would need to divide 35,000 by 7 since the answer would be 10% of the number we need. Once we do this we get 5000 which is 10% now we multiply 5000 by 10 to get 100% and we get 50.000 once we give this amount to the person and 30% is taken away they are left with 35,000

5 0

2 years ago

Hey yall please help me I suffer from short time memory loss and it's hard for me to focus and remember☹ Examine parallelogram Q

Andrei [34K]

m<A = 114° , m<Q = 114° , m< D= 66° ,m<U = 66°

x=13

FIRST THREE OPTIONS

A,B,C