The Euler quotient modulo an odd-prime power \(p^r~(r>1)\) can be uniquely decomposed as a \(p\)-adic number of the form $$ \frac{u^{(p-1)p^{r-1}} -1}{p^r}\equiv a_0(u)+a_1(u)p+\ldots+a_{r-1}(u)p^{r-1} \pmod {p^r},~ \gcd(u,p)=1, $$ where \(0\le a_j(u)1\). We firstly study certain...

Linear complexity problems of level sequences of Euler quotients and their related binary sequences

10.48550/arxiv.1410.2182