Question

discrete mathematics structure

clear answer please

thank you

read the problem

the question is there and asking to use the chinese remaider theorem

Answer 1

Solution:

Given that

Store the integer 5857458498 on some "primitive" computer - but that computer cannot store any numbers larger than 100.

"Given that Store the integer 5857458498 on some ""primitive"" computer - but that computer cannot store any numbers larger than 100. Given that store the integer 5 8 57 4 5 8 4 9 8 on "" some "" primitive "" computer. Given the number we know that n = 5857458498 therefore we have to use the Chinese remainder theorem. Given m = 2 times 3 times 5 times 7 times 11 times 11 times 13 times 17 times 19 times 23 times 29 = 6 4 6 969 3230 > 5857458498 Assume that M_1 = 2, M_2 = 3 , M_3 = 5, M_4 =7, M_5 = 11, M_6 = 13, M_7 = 17, M_8 = 23, M_9 = 29 are co - primitive numbers using M = M_1 times M_2 times M_3 times M_4 times M_5 times M_6 times M_7 times M_8 times M_9 = 6 4 6 9 6 93 2 30 n = 5857458498"