0
Add your answer:
Earn +20 pts
What is the exponential notation for 1000?
103
What is 1000 in exponential form?
1,000 = 1.0 × 103
How do you write numbers in exponential form?
5000 = 5 x 1000 & 1000 = 10 x 10 x 10 = 2^3 x 5^3 Hence in exp in exponential form 5^(1) x 2^3 x 5^3 Remember for exponents, when multiplying with a common coefficient, you add the exponents(indices) Hence 2^3 x 5^(1 + 3) = 2^3 x 5^4
A function takes the exponential function's output and returns the exponential function's input?
A __________ function takes the exponential function's output and returns the exponential function's input.
Is the relationship linear or exponential?
is the relationship linear or exponential
What is the exponential notation for 1000?
103
How do you write 1000 in exponential form?
103
What is the exponential notation of 1000?
1.000000e+3
What is the exponential form of 1000?
1,000 = 1.0 × 103
What is 1000 in exponential form?
1,000 = 1.0 × 103
Express the square root of 1000 in exponential form?
31.62
What is 1000 in standard exponential form in 2 significant figures?
1.0*103
1000 equals what in exponential notation using powers of ten?
10 to the 3rd power
What is expnential notation?
100 in exponential notation = 102 (representing 10x10) 1000 = 103 (representing 10x10x10) 5000 = 5 x 103
What is the value of the exponential expression 36.5?
36.5 is not an exponential expression! Its value is 36.536.5 is not an exponential expression! Its value is 36.536.5 is not an exponential expression! Its value is 36.536.5 is not an exponential expression! Its value is 36.5
What is exponential time complexity and polynomial time complexity?
Algorithms which have exponential time complexity grow much faster than polynomial algorithms. The difference you are probably looking for happens to be where the variable is in the equation that expresses the run time. Equations that show a polynomial time complexity have variables in the bases of their terms. Examples: n^3 + 2n^2 + 1. Notice n is in the base, NOT the exponent. In exponential equations, the variable is in the exponent. Examples: 2^n. As said before, exponential time grows much faster. If n is equal to 1000 (a reasonable input for an algorithm), then notice 1000^3 is 1 billion, and 2^1000 is simply huge! For a reference, there are about 2^80 hydrogen atoms in the sun, this is much more than 1 billion.
What is the difference between exponential and polynomial time complexity?
Algorithms which have exponential time complexity grow much faster than polynomial algorithms. The difference you are probably looking for happens to be where the variable is in the equation that expresses the run time. Equations that show a polynomial time complexity have variables in the bases of their terms. Examples: n^3 + 2n^2 + 1. Notice n is in the base, NOT the exponent. In exponential equations, the variable is in the exponent. Examples: 2^n. As said before, exponential time grows much faster. If n is equal to 1000 (a reasonable input for an algorithm), then notice 1000^3 is 1 billion, and 2^1000 is simply huge! For a reference, there are about 2^80 hydrogen atoms in the sun, this is much more than 1 billion.
