document.write( "Question 48084: This problem has stumped me can you assist with this?\r
\n" ); document.write( "\n" ); document.write( "5) Logarithms:
\n" ); document.write( "a) Using a calculator, find log 1000 where log means log to the base of 10.
\n" ); document.write( "Answer: \r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "b) Most calculators have 2 different logs on them: log, which is base 10, and ln, which is base e. In computer science, digital computers are based on the binary numbering system which means that there are only 2 numbers available to the computer, 0 and 1. When a computer scientist needs a logarithm, he needs a log to base 2 which is not on any calculator. To find the log of a number to any base, we can use a conversion formula as shown here:
\n" ); document.write( "
\n" ); document.write( "Using this formula, find . Round your answer to the hundredth's place.
\n" ); document.write( "Answer:
\n" ); document.write( "Show work in this space.
\n" ); document.write( "

Algebra.Com's Answer #31821 by Nate(3500)\"\" \"About 
You can put this solution on YOUR website!
a) Using a calculator, find log 1000 where log means log to the base of 10.
\n" ); document.write( "On a standard calculator, you press LOG; then, you type in 1000 and press enter.
\n" ); document.write( "\"log%2810%2C1000%29+=+log%2810%2C10%5E3%29+=+3\"
\n" ); document.write( "b) Most calculators have 2 different logs on them: log, which is base 10, and ln, which is base e. In computer science, digital computers are based on the binary numbering system which means that there are only 2 numbers available to the computer, 0 and 1. When a computer scientist needs a logarithm, he needs a log to base 2 which is not on any calculator. To find the log of a number to any base, we can use a conversion formula as shown here:
\n" ); document.write( "\"log%28a%2Cb%29+=+log%282%2Cb%29%2Flog%282%2Ca%29\" Round what to the hundredth's place?
\n" ); document.write( "
\n" );