Advanced Search

Question: Unique common solution for coprimes

Question:Unique common solution for coprimes

Antonio_S 259 Maple
example
April 21 2007
0
Could someone help me please to incorporate the command for unique common solutions into a programme. I have a list of values a and b where x ==a(mod e) x==b(mod d) I have the following list of [a,b] pairs: [[0, 0], [1, 1], [0, 2], [1, 3], [0, 4], [1, 5], [0, 6], [1, 0], [0, 1], [1, 2], [0, 3], [1, 4], [0, 5], [1, 6], [0, 0]] I now need to write a procedure where I apply the following command: chrem([a,b],[e,d]) to find the unique common solutions for the listed pairs of a and b. for example chrem([1, 4], [2, 11]) = 15, where e (e=2) and d (d=11) are coprimes. Any hints on how I use each pair of a and b from the above list to generate a list for unique solutions using the chrem command would be most welcome. thanks in advance!
Please Wait...