- 2, 3, 7, 43, 1807, 3263443, 10650056950807, 113423713055421844361000443 (sequence A000058 in the OEIS).
Sylvester's sequence is named after James Joseph Sylvester, who first investigated it in 1880. Its values grow doubly exponentially, and the sum of its reciprocals forms a series of unit fractions that converges to 1 more rapidly than any other series of unit fractions with the same number of terms. The recurrence by which it is defined allows the numbers in the sequence to be factored more easily than other numbers of the same magnitude, but, due to the rapid growth of the sequence, complete prime factorizations are known only for a few of its members. Values derived from this sequence have also been used to construct finite Egyptian fraction representations of 1, Sasakian Einstein manifolds, and hard instances for online algorithms.
Formally, Sylvester's sequence can be defined by the formula
The product of an empty set is 1, so s0 = 2.
Alternatively, one may define the sequence by the recurrence
- with s0 = 2.
It is straightforward to show by induction that this is equivalent to the other definition.
Closed form formula and asymptotics
The Sylvester numbers grow doubly exponentially as a function of n. Specifically, it can be shown that
- s0 is the nearest integer to E2; s1 is the nearest integer to E4; s2 is the nearest integer to E8; for sn, take E2, square it n more times, and take the nearest integer.
This would only be a practical algorithm if we had a better way of calculating E to the requisite number of places than calculating sn and taking its repeated square root.
The double-exponential growth of the Sylvester sequence is unsurprising if one compares it to the sequence of Fermat numbers Fn; the Fermat numbers are usually defined by a doubly exponential formula, , but they can also be defined by a product formula very similar to that defining Sylvester's sequence:
Connection with Egyptian fractions
The partial sums of this series have a simple form,
This may be proved by induction, or more directly by noting that the recursion implies that
so the sum telescopes
Since this sequence of partial sums (sj-2)/(sj-1) converges to one, the overall series forms an infinite Egyptian fraction representation of the number one:
One can find finite Egyptian fraction representations of one, of any length, by truncating this series and subtracting one from the last denominator:
The sum of the first k terms of the infinite series provides the closest possible underestimate of 1 by any k-term Egyptian fraction. For example, the first four terms add to 1805/1806, and therefore any Egyptian fraction for a number in the open interval (1805/1806,1) requires at least five terms.
It is possible to interpret the Sylvester sequence as the result of a greedy algorithm for Egyptian fractions, that at each step chooses the smallest possible denominator that makes the partial sum of the series be less than one. Alternatively, the terms of the sequence after the first can be viewed as the denominators of the odd greedy expansion of 1/2.
Uniqueness of quickly growing series with rational sums
As Sylvester himself observed, Sylvester's sequence seems to be unique in having such quickly growing values, while simultaneously having a series of reciprocals that converges to a rational number. This sequence provides an example showing that double-exponential growth is not enough to cause an integer sequence to be an irrationality sequence.
To make this more precise, it follows from results of Badea (1993) that, if a sequence of integers grows quickly enough that
and if the series
converges to a rational number A, then, for all n after some point, this sequence must be defined by the same recurrence
that can be used to define Sylvester's sequence.
Divisibility and factorizations
If i < j, it follows from the definition that sj ≡ 1 (mod si). Therefore, every two numbers in Sylvester's sequence are relatively prime. The sequence can be used to prove that there are infinitely many prime numbers, as any prime can divide at most one number in the sequence. More strongly, no prime factor of a number in the sequence can be congruent to 5 (mod 6), and the sequence can be used to prove that there are infinitely many primes congruent to 7 (mod 12).
|Unsolved problem in mathematics:
Are all the terms in Sylvester's sequence squarefree?
(more unsolved problems in mathematics)
Much remains unknown about the factorization of the numbers in the Sylvester's sequence. For instance, it is not known if all numbers in the sequence are squarefree, although all the known terms are.
As Vardi (1991) describes, it is easy to determine which Sylvester number (if any) a given prime p divides: simply compute the recurrence defining the numbers modulo p until finding either a number that is congruent to zero (mod p) or finding a repeated modulus. Via this technique he found that 1166 out of the first three million primes are divisors of Sylvester numbers, and that none of these primes has a square that divides a Sylvester number. The set of primes which can occur as factors of Sylvester numbers is of density zero in the set of all primes: indeed, the number of such primes less than x is .
The following table shows known factorizations of these numbers, (except the first four, which are all prime):
|n||Factors of sn|
|4||13 × 139|
|5||3263443, which is prime|
|6||547 × 607 × 1033 × 31051|
|7||29881 × 67003 × 9119521 × 6212157481|
|8||5295435634831 × 31401519357481261 × 77366930214021991992277|
|9||181 × 1987 × 112374829138729 × 114152531605972711 × 35874380272246624152764569191134894955972560447869169859142453622851|
|10||2287 × 2271427 × 21430986826194127130578627950810640891005487 × P156|
|11||73 × C416|
|12||2589377038614498251653 × 2872413602289671035947763837 × C785|
|13||52387 × 5020387 × 5783021473 × 401472621488821859737 × 287001545675964617409598279 × C1600|
|14||13999 × 74203 × 9638659 × 57218683 × 10861631274478494529 × C3293|
|15||17881 × 97822786011310111 × 54062008753544850522999875710411 × C6618|
|16||128551 × C13335|
|17||635263 × 1286773 × 21269959 × C26661|
|18||50201023123 × 139263586549 × 60466397701555612333765567 × C53313|
|19||775608719589345260583891023073879169 × C106685|
|20||352867 × 6210298470888313 × C213419|
|21||387347773 × 1620516511 × C426863|
|22||91798039513 × C853750|
As is customary, Pn and Cn denote prime and composite numbers n digits long.
Boyer, Galicki & Kollár (2005) use the properties of Sylvester's sequence to define large numbers of Sasakian Einstein manifolds having the differential topology of odd-dimensional spheres or exotic spheres. They show that the number of distinct Sasakian Einstein metrics on a topological sphere of dimension 2n − 1 is at least proportional to sn and hence has double exponential growth with n.
As Galambos & Woeginger (1995) describe, Brown (1979) and Liang (1980) used values derived from Sylvester's sequence to construct lower bound examples for online bin packing algorithms. Seiden & Woeginger (2005) similarly use the sequence to lower bound the performance of a two-dimensional cutting stock algorithm.
Znám's problem concerns sets of numbers such that each number in the set divides but is not equal to the product of all the other numbers, plus one. Without the inequality requirement, the values in Sylvester's sequence would solve the problem; with that requirement, it has other solutions derived from recurrences similar to the one defining Sylvester's sequence. Solutions to Znám's problem have applications to the classification of surface singularities (Brenton and Hill 1988) and to the theory of nondeterministic finite automata.
D. R. Curtiss (1922) describes an application of the closest approximations to one by k-term sums of unit fractions, in lower-bounding the number of divisors of any perfect number, and Miller (1919) uses the same property to upper bound the size of certain groups.
- Graham, Knuth & Patashnik (1989) set this as an exercise; see also Golomb (1963).
- This claim is commonly attributed to Curtiss (1922), but Miller (1919) appears to be making the same statement in an earlier paper. See also Rosenman & Underwood (1933), Salzer (1947), and Soundararajan (2005).
- Guy (2004).
- Guy & Nowakowski (1975).
- This appears to be a typo, as Andersen finds 1167 prime divisors in this range.
- Jones (2006).
- Odoni (1985).
- All prime factors p of Sylvester numbers sn with p < 5×107 and n ≤ 200 are listed by Vardi. Ken Takusagawa lists the factorizations up to s9 and the factorization of s10. The remaining factorizations are from a list of factorizations of Sylvester's sequence maintained by Jens Kruse Andersen. Retrieved 2014-06-13.
- In their work, Seiden and Woeginger refer to Sylvester's sequence as "Salzer's sequence" after the work of Salzer (1947) on closest approximation.
- Domaratzki et al. (2005).
- Badea, Catalin (1993). "A theorem on irrationality of infinite series and applications". Acta Arithmetica. 63: 313–323. MR 1218459.
- Badea, Catalin (1995). "On some criteria for irrationality for series of positive rationals: a survey" (PDF). Archived from the original (PDF) on 2008-09-11.
- Boyer, Charles P.; Galicki, Krzysztof; Kollár, János (2005). "Einstein metrics on spheres". Annals of Mathematics. 162 (1): 557–580. arXiv: . doi:10.4007/annals.2005.162.557. MR 2178969.
- Brenton, Lawrence; Hill, Richard (1988). "On the Diophantine equation 1=Σ1/ni + 1/Πni and a class of homologically trivial complex surface singularities". Pacific Journal of Mathematics. 133 (1): 41–67. doi:10.2140/pjm.1988.133.41. MR 0936356.
- Brown, D. J. (1979). "A lower bound for on-line one-dimensional bin packing algorithms". Tech. Rep. R-864. Coordinated Science Lab., Univ. of Illinois, Urbana-Champaign.
- Curtiss, D. R. (1922). "On Kellogg's diophantine problem". American Mathematical Monthly. 29 (10): 380–387. doi:10.2307/2299023. JSTOR 2299023.
- Domaratzki, Michael; Ellul, Keith; Shallit, Jeffrey; Wang, Ming-Wei (2005). "Non-uniqueness and radius of cyclic unary NFAs". International Journal of Foundations of Computer Science. 16 (5): 883–896. doi:10.1142/S0129054105003352. MR 2174328.
- Erdős, Paul; Graham, Ronald L. (1980). Old and new problems and results in combinatorial number theory. Monographies de L'Enseignement Mathématique, No. 28, Univ. de Genève. MR 0592420.
- Galambos, Gábor; Woeginger, Gerhard J. (1995). "On-line bin packing — A restricted survey". Mathematical Methods of Operations Research. 42 (1): 25. doi:10.1007/BF01415672. MR 1346486.
- Golomb, Solomon W. (1963). "On certain nonlinear recurring sequences". American Mathematical Monthly. 70 (4): 403–405. doi:10.2307/2311857. JSTOR 2311857. MR 0148605.
- Graham, R.; Knuth, D. E.; Patashnik, O. (1989). Concrete Mathematics (2nd ed.). Addison-Wesley. Exercise 4.37. ISBN 0-201-55802-5.
- Guy, Richard K. (2004). "E24 Irrationality sequences". Unsolved Problems in Number Theory (3rd ed.). Springer-Verlag. p. 346. ISBN 0-387-20860-7. Zbl 1058.11001.
- Guy, Richard; Nowakowski, Richard (1975). "Discovering primes with Euclid". Delta (Waukesha). 5 (2): 49–63. MR 0384675.
- Jones, Rafe (2006). "The density of prime divisors in the arithmetic dynamics of quadratic polynomials". Journal of the London Mathematical Society. 78: 523–544. arXiv: . doi:10.1112/jlms/jdn034.
- Liang, Frank M. (1980). "A lower bound for on-line bin packing". Information Processing Letters. 10 (2): 76–79. doi:10.1016/S0020-0190(80)90077-0. MR 0564503.
- Miller, G. A. (1919). "Groups possessing a small number of sets of conjugate operators". Transactions of the American Mathematical Society. 20 (3): 260–270. doi:10.2307/1988867. JSTOR 1988867.
- Odoni, R. W. K. (1985). "On the prime divisors of the sequence wn+1 =1+w1⋯wn". J. Lond. Math. Soc., II. Ser. 32: 1–11. Zbl 0574.10020.
- Rosenman, Martin; Underwood, F. (1933). "Problem 3536". American Mathematical Monthly. 40 (3): 180–181. doi:10.2307/2301036. JSTOR 2301036.
- Salzer, H. E. (1947). "The approximation of numbers as sums of reciprocals". American Mathematical Monthly. 54 (3): 135–142. doi:10.2307/2305906. JSTOR 2305906. MR 0020339.
- Seiden, Steven S.; Woeginger, Gerhard J. (2005). "The two-dimensional cutting stock problem revisited". Mathematical Programming. 102 (3): 519–530. doi:10.1007/s10107-004-0548-1. MR 2136225.
- Soundararajan, K. (2005). "Approximating 1 from below using n Egyptian fractions". arXiv: .
- Sylvester, J. J. (1880). "On a point in the theory of vulgar fractions". American Journal of Mathematics. 3 (4): 332–335. doi:10.2307/2369261. JSTOR 2369261.
- Vardi, Ilan (1991). Computational Recreations in Mathematica. Addison-Wesley. pp. 82–89. ISBN 0-201-52989-0.