Question
let $m$ is positive numbers,and such $m\ge 5$,and $$A_{m+1}=\overline{1234\cdots m}=1\times (m+1)^{m-1}+2\times (m+1)^{m-2}+\cdots+(m-1)\times (m+1)+m$$(or see (http://en.wikipedia.org/wiki/Positional_notation)
and positive integer number $a$ such $$\gcd{(a,m)}=1,\left[\dfrac{a}{m}\right]=\left[\dfrac{a}{m+1}\right]$$
show that: $$aA_{m+1}=\overline{\sigma_{0}\sigma_{1}\sigma_{2}\cdots\sigma_{m}}$$ where a permutation $\sigma_{0},\sigma_{1},\sigma_{2},\cdots,\sigma_{m}$ of $0,1,2,3,\cdots,m$ is alternating.and $[x]$ is the largest integer not greater than x.
My idea: since $$\left[\dfrac{a}{m}\right]=\left[\dfrac{a}{m+1}\right]\le\dfrac{a}{m+1}$$ then we have $$\left[\dfrac{a}{m}\right]\le a-m\left[\dfrac{a}{m}\right]$$ let $a=pm+r,p,r\in N,0\le r<m$,then we have $$p\le r<m$$. then I can't. I fell this reslut is interesting, I don't know somepaper have this reserch?Thank you for you help