krispiekr3am
- 23
- 0
5x = 1 (mod 13)
13x = 2 (mod 23)
37x = 5 (mod 13)
13x = 2 (mod 23)
37x = 5 (mod 13)
krispiekr3am said:5x = 1 (mod 13)
13x = 2 (mod 23)
37x = 5 (mod 13)
You could use the chinese remainder theorem if you can put it in the appropriate form. For example if you find some k such that 5k = 1 mod 13 (Euclid's algorithm), then the first equation is x = k (mod 13).krispiekr3am said:5x = 1 (mod 13)
13x = 2 (mod 23)
37x = 5 (mod 13)
matt grime said:Are those even compatible?