|Feb26-12, 03:51 AM||#1|
Question regarding mod classes
Find the smallest positive integer which when divided by 12, by 17, by 45 or by 70 gives
a remainder of 4 in each case.
I know I can approach this problem by writing the equivalence classes.
x=4mod45 or x=4mod70
I also know I can find x by multiplying 12*17*45 + 4, but this isn't the smallest positive integer.
Can someone help me with a formula I can use?
|Feb26-12, 06:33 AM||#2|
Erm... how about the solution x=4?
It is a solution and I don't think there are any smaller positive integers that are also a solution.
|Feb26-12, 01:32 PM||#3|
If you for some reason do not like the number 4, you have to add the lcm of your moduli to get the next.
|Similar Threads for: Question regarding mod classes|
|Simple Question about C++ classes||Programming & Comp Sci||1|
|Question on universailty classes||Atomic, Solid State, Comp. Physics||3|
|Another terminology question. ZFC and classes.||Set Theory, Logic, Probability, Statistics||8|
|Basic general ed classes before classes for 4 yr Bachelor's degree?||Academic Guidance||5|
|question on summer classes||Academic Guidance||8|