Ulam number

From Wikipedia, the free encyclopedia
Jump to: navigation, search

An Ulam number is a member of an integer sequence devised by and named after Stanislaw Ulam, who introduced it in 1964.[1] The standard Ulam sequence (the (1, 2)-Ulam sequence) starts with U1 = 1 and U2 = 2. Then for n > 2, Un is defined to be the smallest integer that is the sum of two distinct earlier terms in exactly one way.

Examples[edit]

As a consequence of the definition, 3 is an Ulam number (1+2); and 4 is an Ulam number (1+3). (Here 2+2 is not a second representation of 4, because the previous terms must be distinct.) The integer 5 is not an Ulam number, because 5 = 1 + 4 = 2 + 3. The first few terms are

1, 2, 3, 4, 6, 8, 11, 13, 16, 18, 26, 28, 36, 38, 47, 48, 53, 57, 62, 69, 72, 77, 82, 87, 97, 99 (sequence A002858 in OEIS).

The first Ulam numbers that are also prime numbers are

2, 3, 11, 13, 47, 53, 97, 131, 197, 241, 409, 431, 607, 673, 739, 751, 983, 991, 1103, 1433, 1489 (sequence A068820 in OEIS).

Infinite sequence[edit]

There are infinitely many Ulam numbers. For, after the first n numbers in the sequence have already been determined, it is always possible to extend the sequence by one more element: Un − 1 + Un is uniquely represented as a sum of two of the first n numbers, and there may be other smaller numbers that are also uniquely represented in this way, so the next element can be chosen as the smallest of these uniquely representable numbers.[2]

Ulam is said to have conjectured that the numbers have zero density,[3] but they seem to have a density of approximately 0.07396.[4]

Generalizations[edit]

The idea can be generalized as (uv)-Ulam numbers by selecting different starting values (uv). A sequence of (uv)-Ulam numbers is regular if the sequence of differences between consecutive numbers in the sequence is eventually periodic. When v is an odd number greater than three, the (2, v)-Ulam numbers are regular. When v is congruent to 1 (mod 4) and at least five, the (4, v)-Ulam numbers are again regular. However, the Ulam numbers themselves do not appear to be regular.[5]

A sequence of numbers is said to be s-additive if each number in the sequence, after the initial 2s terms of the sequence, has exactly s representations as a sum of two previous numbers. Thus, the Ulam numbers and the (uv)-Ulam numbers are 1-additive sequences.[6]

If one forms a sequence by appending the largest number with a unique representation as a sum of two earlier numbers, instead of appending the smallest uniquely representable number, then the resulting sequence is the sequence of Fibonacci numbers.[7]

Notes[edit]

  1. ^ Ulam (1964a, 1964b).
  2. ^ Recaman (1973) gives a similar argument, phrased as a proof by contradiction. He states that, if there were finitely many Ulam numbers, then the sum of the last two would also be an Ulam number – a contradiction. However, although the sum of the last two numbers would in this case have a unique representation as a sum of two Ulam numbers, it would not necessarily be the smallest number with a unique representation.
  3. ^ The statement that Ulam made this conjecture is in OEIS OEISA002858, but Ulam does not address the density of this sequence in Ulam (1964a), and in Ulam (1964b) he poses the question of determining its density without conjecturing a value for it. Recaman (1973) repeats the question from Ulam (1964b) of the density of this sequence, again without conjecturing a value for it.
  4. ^ OEIS OEISA002858
  5. ^ Queneau (1972) first observed the regularity of the sequences for u = 2 and v = 7 and v = 9. Finch (1992) conjectured the extension of this result to all odd v greater than three, and this conjecture was proven by Schmerl & Spiegel (1994). The regularity of the (4, v)-Ulam numbers was proven by Cassaigne & Finch (1995).
  6. ^ Queneau (1972).
  7. ^ Finch (1992).

References[edit]

External links[edit]