0
Due to the rubbish browser that we are compelled to use, it is not possible to use any super or subscripts so here goes, with things spelled out in detail:
log to base 2a of 2b = log to base a of 2b/log to base a of 2a
= [(log to base a of 2) + (log to base a of b)] / [(log to base a of 2) + (log to base a of a)]
= [(log to base a of 2) + (log to base a of b)] / [(log to base a of 2) + 1]
What else can I help you with?
How do you find log of any given number?
Although it's certainly possible, the log function is one thing that's not practical to compute with pencil and paper. Typical methods are with the use of a slide rule, calculator, or tables in a book.
How do you compute difference of meridional parts?
to get MP using calculator.. lat/2+45=tan=log=*7915.7-sin lat*23.01 just follow it...
If log y equals 0.7 plus 2 times log x express y in terms of x?
It cannot be done because the base for the second log is not given.
How do you half a number by using only powers?
You can't: let suppose y the power of x to obtain such a result then xy=x/2 then xy-1=1/2 (y-1) log (x) = - log(2) (if x is a positive number) y-1 = -log(2)/log(x) y = 1 - log(2)/log(x) So log function must also being used!
Suppose a log's mass is 5 kg After burning the log's mass of the ash is 1 kg Explain what may have happened to the other 4 kg of mass?
smoke~ if you were to capture the smoke coming out of the log and weigh it it would measure to 4kg so what is 4+1?
How do you I log in from another computer than mine?
youblogin like you are suppose to
Given log 2 and log 3 how do you compute log 36?
log(36) = 1.5563To solve this problem without using a scientific calculator, factor 36 into 2*2*3*3, and use the formula:log(a*b) = log(a) + log(b)So, in this case:log(36) = log(2) + log(2) + log(3) + log(3) = 0.3010 + 0.3010 + 0.4772 + 0.4772 = 1.5564 (slight rounding error)
What is the difference between the terms log on and log in?
Log in is when you first start your pc and go into an account by entering a password.Whereas log on is when you switch to another account whilst on the net.
How do you find log of any given number?
Although it's certainly possible, the log function is one thing that's not practical to compute with pencil and paper. Typical methods are with the use of a slide rule, calculator, or tables in a book.
What is the time complexity of the algorithm in terms of 2 log n?
The time complexity of the algorithm is O(log n).
How do you compute difference of meridional parts?
to get MP using calculator.. lat/2+45=tan=log=*7915.7-sin lat*23.01 just follow it...
If log y equals 0.7 plus 2 times log x express y in terms of x?
It cannot be done because the base for the second log is not given.
How do you use logarithm tables for division?
Suppose you want to divide x by y Find log(x) and log(y) to any base b (usually 10 or e) Calculate z = log(x) - log(y) Look up the antilog of z (or find the number whose log is z). x/y = antilog(z)
How do you half a number by using only powers?
You can't: let suppose y the power of x to obtain such a result then xy=x/2 then xy-1=1/2 (y-1) log (x) = - log(2) (if x is a positive number) y-1 = -log(2)/log(x) y = 1 - log(2)/log(x) So log function must also being used!
Suppose a log's mass is 5 kg After burning the log's mass of the ash is 1 kg Explain what may have happened to the other 4 kg of mass?
smoke~ if you were to capture the smoke coming out of the log and weigh it it would measure to 4kg so what is 4+1?
How do you solve log determinant?
To solve for the log determinant of a matrix, you typically compute the determinant first and then take the logarithm of that value. For a positive definite matrix ( A ), the log determinant can be expressed as ( \log(\det(A)) ). If ( A ) is decomposed using methods like Cholesky decomposition, you can simplify the computation by calculating the determinant of the triangular matrix and then applying the logarithm. Additionally, in some contexts, such as with Gaussian distributions, the log determinant can be efficiently computed using properties of matrix trace and eigenvalues.
Is O(n) better than O(log n) in terms of time complexity?
In terms of time complexity, O(log n) is better than O(n) because it has a faster rate of growth as the input size increases.
