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.
Divide the numerator by the denominator so for example if you had 1/2 you would divide 1 by 2 to get 0.5
Use Pythagorean Theorem:
c = sr (a^2 + b^2) = sr (3^2 + 5.3^2)
= sr (9 + 28.09) = sr (37.09)
= 6.09 = 6.1
Answer:
80
Step-by-step explanation:
From the given diagram;
KN = NM
9x - 5 = 7x + 7
9x - 7x = 7 + 5
2x = 12
x = 12/2
x = 6
Since KM= 2KL
KM = 2(6x+4)
KM = 12x + 8
KM = 12(6)+8
KM = 72+8
KM = 80
Hence the length of KM is 80