## An Efficient Method for Computing Ulam Numbers

**Authors:** Philip Gibbs

The Ulam numbers form an increasing sequence beginning 1,2 such that each subsequent number can be uniquely represented as the sum of two smaller Ulam numbers. An algorithm is described and implemented in Java to compute the first billion Ulam numbers.

**Comments:** 16 Pages.

**Download:** **PDF**

### Submission history

[v1] 2015-08-11 11:37:07

[v2] 2015-08-27 14:39:38

**Unique-IP document downloads:** 386 times

**Add your own feedback and questions here:**

*You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.*

*
*