Answer:
Step-by-step explanation:
In the division algorithm, if the remainder is zero, then the algorithm terminates, resulting in a terminating decimal. remainder repeats, the calculations that follow will also repeat in a cyclical pattern causing a repeating decimal.
Answer:
Step-by-step explanation:
A number divisible by 9 is also divisible by 3 because 3 is a factor of 9.
Maybe c or A not completely sure try looking for the one you think it is and try reading it again
Given that the first spinner has three equal sectors labelled 1, 2 and 3; and the second spinner has equal sectors labelled 3, 4, 5 and 6.
The number of possible outcomes that do not show a 1 on the first spinner is 2 (i.e. the first spinner shows 2 or 3).
The number of possible outcomes that the second spinner show the number 4 is 1 (i.e. the second spinner shows 4)
In probability, the word 'and' goes with multiplication.
Therefore, <span>the number of possible outcomes that do not show a 1 on the first spinner and show the number 4 on the second spinner</span> is given by 2 x 1 = 2 possible outcomes.
i.e. the first spinner shows the number 2 and the second spinner shows the number 4 or the first spinner shows the number 3 and the second spinner shows the number 4.
Answer:
6
Step-by-step Explanation:
To simplify 
, we will look for numbers that 504 can be divided by until there are no perfect square roots under the radical.
[] To do this, we can think of perfect square roots such as 4, 9, 16, etc
We can divide 504 by 36 for an answer of 14, so can be written as 
which can be written as 6 because the square root of 36 is 6.
Have a nice day!
I hope this is what you are looking for, but if not - comment! I will edit and update my answer accordingly. (ノ^∇^)
- Heather
