Assume a is not divisible by 10. (otherwise the problem is trivial).
<span>Define R(m) to be the remainder of a^m when divided by 10. </span>
<span>R can take on one of 9 possible values, namely, 1,2,...,9. </span>
<span>Now, consider R(1),R(2),......R(10). At least 2 of them must have the sames value (by the Pigeonhole Principle), say R(i) = R(j) ( j>i ) </span>
<span>Then, a^j - a^i is divisible by 10.</span>
(-6x-6)+(8x-6)
-6x-6+8x-6
2x-12
Hope this helps :)
Determine the mode(s) of the data 2, 2, 2,3,5,5, 6, 7, 8, 8, 8, 9, 10.
Genrish500 [490]
To find the mode, put all the numbers in order from least to greatest, then count how many times you see a number. The number you see the most is the mode. In this problem, we have more than one mode, we have two. The number two appears three times and so does number eight. Having two modes is called bimodal, and having more than two modes is called multimodal. So we have a bimodal of two and eight from this data.
Answer:
Answer is 1
Explanation:
(-6 + 5) / (-2 + 1)
-1 / -1
1