Counting Keith numbers
| dc.creator | Klazar, Martin | |
| dc.creator | Luca, Florian | |
| dc.date | 2006-08-16 | |
| dc.date.accessioned | 2026-07-07T07:21:51Z | |
| dc.date.available | 2026-07-07T07:21:51Z | |
| dc.description | A Keith number is a positive integer N with the decimal representation a_1a_2...a_n such that n>=2 and N appears in the sequence (K_m) given by the recurrence K_1=a_1,...,K_n=a_n and K_m=K_{m-1}+K_{m-2}+...+K_{m-n} for m>n. We prove that there are only finitely many Keith numbers using only one decimal digit (i.e., a_1=a_2=...=a_n), and that the set of Keith numbers is of asymptotic density zero. | |
| dc.description | 12 pages | |
| dc.identifier | https://arxiv.org/abs/math/0608419 | |
| dc.identifier | http://arxiv.org/abs/math/0608419 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115451 | |
| dc.subject | Number Theory | |
| dc.subject | Combinatorics | |
| dc.subject | 11B37; 11B39 | |
| dc.title | Counting Keith numbers | |
| dc.type | text |