Ulam number

In mathematics, the Ulam numbers comprise 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 U₁ = 1 and U₂ = 2. Then for n > 2, U_n is defined to be the smallest integer that is the sum of two distinct earlier terms in exactly one way and larger than all earlier terms.

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, 102, 106, 114, 126, 131, 138, 145, 148, 155, 175, 177, 180, 182, 189, 197, 206, 209, 219, 221, 236, 238, 241, 243, 253, 258, 260, 273, 282, ... (sequence A002858 in the OEIS).

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: U_n−1 + U_n 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.07398.^[4]

Properties[edit]

Apart from 1 + 2 = 3 any subsequent Ulam number cannot be the sum of its two prior consecutive Ulam numbers.

Proof: Assume that for n > 2, U_n−1 + U_n = U_n+1 is the required sum in only one way; then so does U_n−2 + U_n produce a sum in only one way, and it falls between U_n and U_n+1. This contradicts the condition that U_n+1 is the next smallest Ulam number.^[5]

For n > 2, any three consecutive Ulam numbers (U_n−1, U_n, U_n+1) as integer sides will form a triangle.^[6]

Proof: The previous property states that for n > 2, U_n−2 + U_n ≥ U_{n + 1}. Consequently U_n−1 + U_n > U_n+1 and because U_n−1 < U_n < U_n+1 the triangle inequality is satisfied.

The sequence of Ulam numbers forms a complete sequence.

Proof: By definition U_n = U_j + U_k where j < k < n and is the smallest integer that is the sum of two distinct smaller Ulam numbers in exactly one way. This means that for all U_n with n > 3, the greatest value that U_j can have is U_n−3 and the greatest value that U_k can have is U_n−1.^[5]^[7]

Hence U_n ≤ U_n−1 + U_n−3 < 2U_n−1 and U₁ = 1, U₂ = 2, U₃ = 3. This is a sufficient condition for Ulam numbers to be a complete sequence.

For every integer n > 1 there is always at least one Ulam number U_j such that n ≤ U_j < 2n.

Proof: It has been proved that there are infinitely many Ulam numbers and they start at 1. Therefore for every integer n > 1 it is possible to find j such that U_j−1 ≤ n ≤ U_j. From the proof above for n > 3, U_j ≤ U_j−1 + U_j−3 < 2U_j−1. Therefore n ≤ U_j < 2U_j−1 ≤ 2n. Also for n = 2 and 3 the property is true by calculation.

In any sequence of 5 consecutive positive integers {i, i + 1,..., i + 4}, i > 4 there can be a maximum of 2 Ulam numbers.^[7]

Proof: Assume that the sequence {i, i + 1,..., i + 4} has its first value i = U_j an Ulam number then it is possible that i + 1 is the next Ulam number U_j+1. Now consider i + 2, this cannot be the next Ulam number U_j+2 because it is not a unique sum of two previous terms. i + 2 = U_j+1 + U₁ = U_j + U₂. A similar argument exists for i + 3 and i + 4.

Inequalities[edit]

Ulam numbers are pseudo-random and too irregular to have tight bounds. Nevertheless from the properties above, namely, at worst the next Ulam number U_n+1 ≤ U_n + U_n−2 and in any five consecutive positive integers at most two can be Ulam numbers, it can be stated that

.mw-parser-output .sfrac{white-space:nowrap}.mw-parser-output .sfrac.tion,.mw-parser-output .sfrac .tion{display:inline-block;vertical-align:-0.5em;font-size:85%;text-align:center}.mw-parser-output .sfrac .num{display:block;line-height:1em;margin:0.0em 0.1em;border-bottom:1px solid}.mw-parser-output .sfrac .den{display:block;line-height:1em;margin:0.1em 0.1em}.mw-parser-output .sr-only{border:0;clip:rect(0,0,0,0);clip-path:polygon(0px 0px,0px 0px,0px 0px);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}5/2n−7

≤ U_n ≤ N_n+1 for n > 0,^[7]

where N_n are the numbers in Narayana’s cows sequence: 1,1,1,2,3,4,6,9,13,19,... with the recurrence relation N_n = N_n−1 +N_n−3 that starts at N₀.

Hidden structure[edit]

It has been observed^[8] that the first 10 million Ulam numbers satisfy $\cos {(2.5714474995\,U_{n})}<0$ except for the four elements $\left\{2,3,47,69\right\}$ (this has now been verified for the first $10^{9}$ Ulam numbers). Inequalities of this type are usually true for sequences exhibiting some form of periodicity but the Ulam sequence does not seem to be periodic and the phenomenon is not understood. It can be exploited to do a fast computation of the Ulam sequence (see External links).

Generalizations[edit]

The idea can be generalized as (u, v)-Ulam numbers by selecting different starting values (u, v). A sequence of (u, v)-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.^[9]

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 (u, v)-Ulam numbers are 1-additive sequences.^[10]

If a sequence is formed 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.^[11]

Notes[edit]

^ Ulam (1964a, 1964b).
^ 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.
^ The statement that Ulam made this conjecture is in OEIS OEIS: A002858, 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.
^ OEIS OEIS: A002858
^ Jump up to: ^a ^b Recaman (1973)
^ OEIS OEIS: A330909
^ Jump up to: ^a ^b ^c Philip Gibbs and Judson McCranie (2017). "The Ulam Numbers up to One Trillion". p. 1(Introduction).
^ Steinerberger (2015)
^ 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).
^ Queneau (1972).
^ Finch (1992).

References[edit]

Cassaigne, Julien; Finch, Steven R. (1995), "A class of 1-additive sequences and quadratic recurrences" (PDF), Experimental Mathematics, 4 (1): 49–60, doi:10.1080/10586458.1995.10504307, MR 1359417, S2CID 9985793
Finch, Steven R. (1992), "On the regularity of certain 1-additive sequences", Journal of Combinatorial Theory, Series A, 60 (1): 123–130, doi:10.1016/0097-3165(92)90042-S, MR 1156652
Guy, Richard (2004), Unsolved Problems in Number Theory (3rd ed.), Springer-Verlag, pp. 166–167, ISBN 0-387-20860-7
Queneau, Raymond (1972), "Sur les suites s-additives", Journal of Combinatorial Theory, Series A (in French), 12 (1): 31–71, doi:10.1016/0097-3165(72)90083-0, MR 0302597
Recaman, Bernardo (1973), "Questions on a sequence of Ulam", American Mathematical Monthly, 80 (8): 919–920, doi:10.2307/2319404, JSTOR 2319404, MR 1537172
Schmerl, James; Spiegel, Eugene (1994), "The regularity of some 1-additive sequences", Journal of Combinatorial Theory, Series A, 66 (1): 172–175, doi:10.1016/0097-3165(94)90058-2, MR 1273299
Ulam, Stanislaw (1964a), "Combinatorial analysis in infinite sets and some physical theories", SIAM Review, 6 (4): 343–355, Bibcode:1964SIAMR...6..343U, doi:10.1137/1006090, JSTOR 2027963, MR 0170832
Ulam, Stanislaw (1964b), Problems in Modern Mathematics, New York: John Wiley & Sons, Inc, p. xi, MR 0280310
Steinerberger, Stefan (2015), A Hidden Signal in the Ulam sequence, Experimental Mathematics, arXiv:1507.00267, Bibcode:2015arXiv150700267S

External links[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 OEIS: A002858, 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 OEIS: A002858

[Recaman-5] Jump up to: ^a ^b Recaman (1973)

[6] OEIS OEIS: A330909

[Gibbs-7] Jump up to: ^a ^b ^c Philip Gibbs and Judson McCranie (2017). "The Ulam Numbers up to One Trillion". p. 1(Introduction).

[8] Steinerberger (2015)

[9] 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).

[10] Queneau (1972).

[11] Finch (1992).

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]