Hallo(adsbygoogle = window.adsbygoogle || []).push({});

I have gotten the task of finding the smallest number which is:

1 or 2 mod 3

0 mod 4

0 or 1 or 4 mod 5

1, 2, 5, 6, 9 or 10 mod 11

I have also been given that the smallest number is in the range [10,50].

Now, it is quite easy to see that 16 is the smallest number creating a solution.

But my question is if there are any known algorithm for finding the smallest possible solution besides lining up all 2*1*3*6 modular equations and solving them?

Thanks

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Finding smallest solution to modular equations

Loading...

Similar Threads - Finding smallest solution | Date |
---|---|

I How to find admissible functions for a domain? | Jan 31, 2018 |

I How to find the matrix of the derivative endomorphism? | Oct 22, 2017 |

I Finding the Kernel of a Matrix Map | Sep 15, 2017 |

A How can I find the collision time of 2 ellipsoids that rotate | May 22, 2017 |

Find the smallest Matrix for this Kernel | May 9, 2013 |

**Physics Forums - The Fusion of Science and Community**