Timeline for Eulerian ordering of the integers modulo n
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 29, 2018 at 10:28 | vote | accept | Sebastien Palcoux | ||
| Mar 29, 2018 at 0:38 | history | edited | user44191 | CC BY-SA 3.0 |
Conjecture was wrong.
|
| Mar 28, 2018 at 18:58 | history | edited | user44191 | CC BY-SA 3.0 |
edited body
|
| Mar 28, 2018 at 18:49 | history | edited | user44191 | CC BY-SA 3.0 |
edited body
|
| Mar 28, 2018 at 18:42 | history | edited | user44191 | CC BY-SA 3.0 |
added 507 characters in body
|
| Mar 28, 2018 at 2:43 | history | edited | user44191 | CC BY-SA 3.0 |
[Edit removed during grace period]
|
| Mar 28, 2018 at 1:05 | comment | added | user44191 | @SebastienPalcoux Any $j < i$ will differ for some digit $p$; then $r_i \neq r_j \text{(mod p)}$ (as the $d_p$ are all less than $p$), and so will be different. | |
| Mar 28, 2018 at 1:02 | comment | added | Sebastien Palcoux | Very nice! Can you prove the bijectivity of the map $i \mapsto r_i$? | |
| Mar 28, 2018 at 0:27 | history | edited | user44191 | CC BY-SA 3.0 |
added 212 characters in body
|
| Mar 28, 2018 at 0:19 | history | answered | user44191 | CC BY-SA 3.0 |