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.
Answer:
c) The series diverges. There is no sum.
Step-by-step explanation:
A geometric series is a series of the form:
, 
Where:
- First term of the series, dimensionless.
- Common ratio, dimensionless.
A geometric series converges only if 
. As 
, the geometric series diverges. Hence, the right answer is C.
Answer:
B, C, E, F
Step-by-step explanation:
The following relationships apply.
- the diagonals of a parallelogram bisect each other
- the diagonals of a rectangle are congruent
- the diagonals of a rhombus meet at right angles
- a rectangle is a parallelogram
- a parallelogram with congruent adjacent sides is a rhombus
__
CEDF has diagonals that bisect each other, and it has congruent adjacent sides. It is a parallelogram and a rhombus, but not a rectangle. (B and C are true.)
ABCD has congruent diagonals that bisect each other. It is a parallelogram and a rectangle, but not a rhombus. (There is no indication adjacent sides are congruent, or that the diagonals meet at right angles.) (E and F are true.)
The true statements are B, C, E, F.
Answer:
12.5 miles per hour
Step-by-step explanation:
1,100 ft/min * (60 min)/(1 hr) * (1 mile)/(5280 ft) = 12.5 miles/hr
D - 6lb / $1 would be the answer
