Answer:
Algorithm 1 uses:
n*log(n) operations.
While algorithm 2 uses:
n^(3/2) operations.
We want to see, as n grows, which algorithm uses fewer operations.
So we would want to first solve:
n*log(n) = n^(3/2)
This will give us the exact value of n such that the number of operations is the same in both algorithms.
dividing both sides by n we get:
log(n) = n^(3/2)/n = n^(3/2 - 1) = n^(1/2)
where we can use:
log(n) = ln(n)/ln(10)
ln(n) = ln(10)*n^(1/2)
This equation actually has no solutions.
This happens because the right side is always larger than the left side.
Then, the same thing happens for our two initial equations:
n^(3/2) is always larger than n*log(n), as you can see in the graph below, where n^(3/2) is represented with the orange graph:
So we can conclude that the fist algorithm uses less operations as n grows.
Answer:
4 hours 2560 bacteria
Step-by-step explanation:
If you do the multiplication side by side it equaizes itslef at 4 hours
Answer:
Because the product is always non-termination,non-repeating decimal.
Step-by-step explanation:
If we have 
is irrational; 
is rational such that 
, then 
is irrational.
A way to represent this is:
Note that we have a contradiction, because is not a rational number, as I stated in the beginning. Therefore, ab is irrational.
Part A
The given line passes through (-2,2) and it is parallel to the line
We need to determine the slope of this line by writing it in slope -intercept form.
The slope of this line is
The line parallel to this line also has slope
The equation is
We substitute (-2,2)
The required equation is
PART B
The given line is
The slope of this line is
The slope of the line perpendicular to it is
The equation of the line is
We substitute the point, (-2,2)
The equation of the perpendicular line is
Answer:
x=24
Step-by-step explanation:
