| Autor: |
Lehmer, D. H., Mahler, K., Poorten, A. J. van der |
| Zdroj: |
Mathematics of Computation; 1986, Vol. 46 Issue: 174 p683-689, 7p |
| Abstrakt: |
Let $ g \geqslant 2$ $ \mathcal{L}$g employing only the digits 0 or 1. Given an integer $ k > 1$ $ l \equiv a\;\pmod k$ $ l \in \mathcal{L}$  . There is a simple criterion to distinguish the two cases. The casual reader will be intrigued by our subsequent discussion of techniques for obtaining the smallest nontrivial solution of the cited congruence. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
