have a problem on hand - this one is kinda easy- but am stuck :P
the problem is :
Solve using CRT:
x congruent to 8(mod13)
x congruent to 1(mod 5)
x congruent to 5 (mod 6)
i have gotten most of it. just want to be sure
thanks
We have,
Also,
thus, we may rely on Chinese Remainder Theorem.
----
By Chinese Remainder Theorem, we know that,
Where,
Also,
Finally, thus, thus, thus,
Thanks! That was awesome - this was a problem in m Discrete Math class - so i posted it here! Sorry for trouble caused - am still a bit confused as to how you calculate b1 b2 and b3
Cheers
Last edited by darren_a1; April 9th 2006 at 04:37 PM.
Thanks! That was awesome - this was a problem in m Discrete Math class - so i posted it here! Sorry for trouble caused - am still a bit confused as to how you calculate b1 b2 and b3
Cheers
First, do you understand that those are the numbers that solve the congruences, .
Is your problem based on how to solve these congruences.