Answer: (X) = y => b^y = x
use that equation to get the exponential form
Step-by-step explanation:
Answer:
The answer is 1,000
SInce the beginning number is 3 and there are ten possible numbers to put in the remaining three slots, there are exactly 1,000 possible combinations for a 3-digit code. The answer is 1,000. There are 3 rows of 10 digits. The number of combinations 10 to the thid power which is 1000 (10 * 10 * 10)
I hope you understand it. Also pay attention to if the line is dotted or not because they do matter.
10.4 over 1
10.4 over 1 ( 10 over 10) = 140 over 10
104 ÷ 2 over 10 ÷ 2 ➡52 over 5
Now, we're solving the "improper fraction" 10 and 2 over 5
Therefore, your answer for "10.4" in simplest form is "10 and 2 over 5
