Timeline for Intersection of two arithmetic progressions
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 23, 2013 at 7:31 | comment | added | fretty | Well yeah but under conditions described above (on gcd$(a,b)$) you can still do a similar thing just it isn't as straight-forward. | |
| Apr 22, 2013 at 21:32 | vote | accept | Maaz-ul-Haq | ||
| Apr 22, 2013 at 21:32 | comment | added | Maaz-ul-Haq | The question is for coprime moduli. It appears that this is it: Chinese remainder theorem with some basic algebra and modular arithmetic. | |
| Apr 22, 2013 at 21:19 | comment | added | Barry Cipra | You can avoid a divisibity criterion and use the chinese remainder theorem only when the moduli are relatively prime. A better example would have used 10 and 14 instead of 5 and 7. | |
| Apr 22, 2013 at 21:03 | history | answered | fretty | CC BY-SA 3.0 |