Timeline for Cyclic order relation in Zn
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2010 at 14:27 | comment | added | Wadim Zudilin | It appears in many other places (including my own articles) but this does not imply that the cases are related to the cyclic order. It's just a natural thing in the modular arithmetic to reduce residues to the least representatives. Note that Gauss proved the law of quadratic reciprocity by reducing residues to the absolutely least ones. | |
| May 23, 2010 at 13:09 | comment | added | Roy Maclean | Although multiplication of all the elements by a factor does appear in the Dvornicich and Zannier paper in Charles Matthews answer. | |
| May 23, 2010 at 12:58 | comment | added | Wadim Zudilin | Yes, this would be the most appropriate question. And the answer I would prefer is $R(a,b,c)\iff\lbrace(b-a)/n\rbrace<\lbrace(c-a)/n\rbrace$. | |
| May 23, 2010 at 12:11 | comment | added | Roy Maclean | So the answer doesn't depend on R(a,b,c) which means the question should have been "what is the most efficient way for an algorithm to check whether elements are in cyclic order?" and the answer is to change the cyclic relation to a linear relation by shifting 'a' back to zero. | |
| May 23, 2010 at 12:01 | vote | accept | Roy Maclean | ||
| May 22, 2010 at 13:26 | history | answered | Wadim Zudilin | CC BY-SA 2.5 |