Name
Abstract | ||
|---|---|---|
In 1965, Fine & Wilf proved the following theorem: if (fn)n≥0 and (gn)n≥0 are periodic sequences of real numbers, of periods h and k respectively, and fn = gn for 0 ≤ n ≤ h+k-gcd(h, k), then fn = gn for all n ≥ 0. Furthermore, the constant h + k - gcd(h, k) is best possible. In this paper we consider some variations on this theorem. In particular, we study the case where fn ≤ gn instead of fn = gn. We also obtain a generalization to more than two periods. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-44683-4_45 | MFCS |
Keywords | Field | DocType |
real number,following theorem,constant h,periodic sequence,periods h | Discrete mathematics,Combinatorics,Formal language,Period length,String (computer science),Periodic graph (geometry),Periodic sequence,Real number,Number theory,Mathematics | Conference |
Volume | ISSN | ISBN |
2136 | 0302-9743 | 3-540-42496-2 |
Citations | PageRank | References |
5 | 0.67 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Filippo Mignosi | 1 | 569 | 99.71 |
| Jeffrey Shallit | 2 | 307 | 37.95 |
| Ming-Wei Wang | 3 | 177 | 15.25 |