-1
$\begingroup$

Respected Mathematicians, Suppose we are given 10 remainders each of 10 digits for given ten distinct prime bases each of 10 digits. Find the rational number that corresponds to these remainders in the specified prime bases using Matlab. Observe that the rational number could consist more than 40 digits in numerator as well as those in denominator. Standard precision of Matlab does not allow more than 16 digits. But vpa (variable precision arithmetic) in Matlab will allow much more than 16 digits.

Consider, for example, the remainders 1, 1, 2 corresponding to the prime bases 3, 5, 7, respectively. What will be the rational number? The answer is 16. I would like to know the generalization of this part, especially about the rationals.

Thanking you all.

  • 0
    The main issue is how to implement CRT for solving error-free (reasonably) large real-world problems and not CRT/algorithm/mathematics for small problems. Please discuss more precisely.2012-07-30

1 Answers 1

1

You need to look at the Chinese remainder theorem. Nice tutorials exists via Google search.

Edit: here is a Youtube lesson and some more resources here and here.

  • 0
    ! see that first paragraph of my question and put in matlab and then discuss the observations or generalizations, which you want to make. Once again thank you so much.2012-07-25