Question

Find a formula for the number of digits of 2^n. Now the textbook answer is '1+|_n*lg2_|',...

Find a formula for the number of digits of 2^n.

Now the textbook answer is '1+|_n*lg2_|', the symbol used is integer floor, and lg2 is log(10)2.

Question: How do I find this formula?? Show me the process of finding this formula. I know that when n=3, the number of digit is 1; when n goes pass 3, there will be 2 digits; when n goes pass 6, there will be 3 digits, and so on.

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
=Using the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 only once,...
=Using the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 only once, find all the possible 3 digit number plus another 3 digit number to equal a 4 digit number. (No repetition of numbers is allowed.) One example is 589+437=1026. We are asked to find ALL the possibilities. I know it has to do with combinations, but I'm not quite sure if I'm using it the proper way.
The digits 2, 2, 3, 5, 5, and 5 are used to make six-digit number. Find...
The digits 2, 2, 3, 5, 5, and 5 are used to make six-digit number. Find the different numbers possible: If the number starts with a 5 and is a multiple of 5
Answer with Python. A number is cool if the sum of its digits is divisible by...
Answer with Python. A number is cool if the sum of its digits is divisible by 5. Given an integer n, return the nth cool number. def nthCool(n): nthCool(1) = 5 nthCool(2) = 14 nthCool(3) = 19
2. Find a system of recurrence relations for the number of n-digit quaternary sequences that contain...
2. Find a system of recurrence relations for the number of n-digit quaternary sequences that contain an even number of 2’s and an odd number of 3’s. Define the initial conditions for the system. (A quaternary digit is either a 0, 1, 2 or 3)
1. Given an n-element array A, Algorithm X executes an O(n)-time computation for each even number...
1. Given an n-element array A, Algorithm X executes an O(n)-time computation for each even number in A and an O(log n)-time computation for each odd number in A. What is the best-case running time of Algorithm X? What is the worst-case running time of Algorithm X? 2. Given an array, A, of n integers, give an O(n)-time algorithm that finds the longest subarray of A such that all the numbers in that subarray are in sorted order. Your algorithm...
write a C program to find whether the given number of three digits is an integer...
write a C program to find whether the given number of three digits is an integer such that the sum of the cubes of its digits is equal to the number itself. For example, 371 is since 3**3 + 7**3 + 1**3 = 371. Output: Enter a number, or -999 to quit : 432 4**3 + 3**3 + 2**3 is not = 432 Enter a number, or -999 to quit : 371 3**3 + 7**3 + 1**3 is = 371...
1. A 4-digit number is created from the numbers {1,2,3,4,5,6}. How many ways can the digits...
1. A 4-digit number is created from the numbers {1,2,3,4,5,6}. How many ways can the digits be chosen so that the number is more than 1500? 2. An applied statistics class contains 30% sophomores, 40% juniors, and the rest seniors. If 40% of the sophomores, 20% of the juniors, and 10% of the seniors will fail, what is the probability a randomly selected student in the class will fail? 3. A coin is flipped 10 times or until 3 heads...
Please code in Java and please implement constarints Digital Root and Iterations Given a non-negative integer,...
Please code in Java and please implement constarints Digital Root and Iterations Given a non-negative integer, print out its digital root and the number of iterations required to reach it. The digital root is the single digit number obtained by an iterative process of finding the sum of digits. In the next iteration, the sum of the digits in the previous iteration is computed, and the process repeated until a single digit value is obtained. Input Format The first line...
How to write a C++ program. Additive persistence is a property of the sum of the...
How to write a C++ program. Additive persistence is a property of the sum of the digits of an integer. The sum of the digits is found, and then the summation of digits is performed creating a new sum. This process repeats until a single integer digit is reached. Consider the following example: 1. The beginning integer is 1234 2. Sum its digits is 1+2+3+4 = 10 3. The integer is now 10 4. The sum of its digits is...
The floor of a real number n, writtten ⌊n⌋, is the greatest integer which is ≤...
The floor of a real number n, writtten ⌊n⌋, is the greatest integer which is ≤ n. For example, ⌊2.3⌋ = 2, and ⌊π⌋ = 3. Suppose that X is an exponential random variable with mean 1/3. Then Y = ⌊X⌋ is a discrete random variable. Find its pmf. (It is one we have studied; call it by its name.)
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT