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.
He would have bought 7 pound
This is because you would add 4 and 3 together
Hope this helps!
Answer:
n = -13
Step-by-step explanation:
19 + 10n = 7n - 20
Subtract 7n from each side
19 + 10n-7n = 7n-7n - 20
19+3n = -20
Subtract 19 from each side
19+3n -19 = -20-19
3n = -39
Divide each side by 3
3n/3 = -39/3
n = -13
If you need to siplify that radical, you should try to put all the numbers as product of prime factors.
922 = 2*461
2 and 461 are prime numbers. Then the transformation of the square root is √(922) = √(2*461) = (√2)(√461)
So you can use that in any expression to try to simpliy with other numbers whose prime factors include 2 and 461.
