krispiekr3am
- 23
- 0
5x = 1 (mod 13)
13x = 2 (mod 23)
37x = 5 (mod 13)
13x = 2 (mod 23)
37x = 5 (mod 13)
The discussion revolves around solving a set of modular equations involving multiple variables. Participants explore various methods for addressing these equations, including the Chinese remainder theorem and the implications of compatibility between the equations.
Participants express differing views on the compatibility of the equations and whether they can be solved simultaneously. There is no consensus on the correctness of the proposed solutions or methods.
Some participants highlight potential issues with notation and clarity, suggesting that misinterpretations may arise from ambiguous expressions. The discussion also reflects varying levels of familiarity with modular arithmetic concepts.
Individuals interested in modular arithmetic, particularly those studying mathematics or related fields, may find the exploration of solving modular equations and the associated methods useful.
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?