Find the Smallest Positive Integer Such that
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let the number be of the form 1 3 k + 3 and 1 1 j + 7 . This implies 1 3 k = 1 1 j + 4 . Note that the first number of this sort is 2 6 . Hence all the other numbers in this series are 1 4 3 l + 2 6 ; since the LCM is 1 4 3 . Don't forget the 3 in the original number; this gives us a number of the form 1 4 3 l + 2 9 . Now, again apply the same modular arithmetic rule along with 7 a + 5 to get 8 8 7 . Please note that this LCM method would work for any co-prime numbers. So the next number satisfying the given set of conditions would be 8 8 7 + 1 4 3 × 7