SOLUTION: A certain computer design has 64 different sequences of 10 binary digits so that the total number of possible states is (2^10)^64 = 1024^64. Evaluate 1024^64 using logarithms. Show

Question 515107: A certain computer design has 64 different sequences of 10 binary digits so that the total number of possible states is (2^10)^64 = 1024^64. Evaluate 1024^64 using logarithms. Show your work.
Answer by stanbon(75887) (Show Source): You can put this solution on YOUR website!
Evaluate 1024^64 using logarithms
----
Let x = 1024^64
logx = 64*log(1024)
logx = 64*3.0103
---
logx = 192.66
---
x = 10^192.66
x = overflow on my TI-84
==============================
Cheers,
Stan H.
RELATED QUESTIONS
In the past, a local telephone number in the U.S. consisted of a sequence of two letters (answered by stanbon)

In 2014, a certain state added a ninth area code. Using the information about telephone... (answered by ikleyn)

The Fundamental Counting Principle states that the number of ways in which a series of... (answered by Ashlynbyrd,solver91311)

If a die is rolled 35 times, there are 6^35 different sequences possible. The following... (answered by Edwin McCravy)

A computer password consists of 3 different digits followed by one of the letters A, B,... (answered by stanbon)

how many sequences are possible for the last four digits of a social security number and... (answered by edjones)

What in the world does this mean? Please Please, HELP! Using a calculator, find log... (answered by stanbon)

Using a calculator, find log 1000 where log means log to the base of 10. Answer: b) (answered by longjonsilver)

Think of a two-digit number. What is the probability that it has different... (answered by Edwin McCravy)