9514 1404 393
Explanation:
You can check your answer by making sure that each of the primes you found is actually a prime. (Compare to a list of known primes, for example.) After you have determined your factors are primes, multiply them together to see if the result is 73. If so, you have found the correct prime factorization.
__
<em>Additional comment</em>
73 is prime, so its prime factor is 73.
73 = 73
For the first image can you give us the choices for each one?
Answer:
First let's define what modular arithmetic is, what would come is an arithmetic system for equivalence classes of whole numbers called congruence classes.
Now, the modular division is the division in modular arithmetic.
Answering the question, a modular division problem like ordinary arithmetic is not used, division by 0 is undefined. For example, 6/0 is not allowed. In modular arithmetic, not only 6/0 is not allowed, but 6/12 under module 6 is also not allowed. The reason is that 12 is congruent with 0 when the module is 6.
Add all the numbers together, and divide your total by the number of value there (in this case, 7). The nearest tenth is to one place after the decimal.
Stem/leaf
4/2
5/
6/7
7/3,8
8/2,4,6
9/1,4
