A Note on Periodicities of Preferential Arrangement Numbers

From MaRDI portal





The well-known fact that the minimal positive solution \(u\) of the congruence \(b^{n-u} \equiv b^n\pmod m\) satisfies \(u \leq \lambda(m) \leq \varphi(m)\) for all composite \(m\) (different from \( 4, p^a, 2p^a\); \(p\) odd prime) leads to similar periodicity properties for expressions as \[ f_n = \sum_{r=1}^n A(n, r), \quad\text{where } A(n, r)=\sum_{j=0}^r (-1)^j\binom{r}{j} (r-j)^n. \] The author remarks that congruences \(3^{n+u} \equiv 3^n(10^k) \) and \(f_{n+u} \equiv f_n(10^k)\) have the same minimal solution \(u=\lambda(10^k)\), but \(f_{n+u} \equiv f_n\pmod{16}\) has a minimal solution \( u<\lambda(16) \).












This page was built for publication: A Note on Periodicities of Preferential Arrangement Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5524468)