|
|
|
|
Beatty's theorem
|
(Theorem)
|
|
|
If $p$ and $q$ are positive irrationals such that $$\frac{1}{p}+\frac{1}{q}=1$$ then the sequences \begin{eqnarray*} \{\lfloor np\rfloor\}_{n=1}^\infty&=&\lfloor p\rfloor,\lfloor 2p\rfloor,\lfloor 3p\rfloor,\ldots\\ \{\lfloor nq\rfloor\}_{n=1}^\infty&=&\lfloor q\rfloor,\lfloor 2q\rfloor,\lfloor 3q\rfloor,\ldots\\ \end{eqnarray*}where $\lfloor x\rfloor$ denotes the floor (or greatest integer function) of $x$ constitute a
partition of the set of positive integers.
That is, every positive integer is a member exactly once of one of the two sequences and the two sequences have no common terms.
|
"Beatty's theorem" is owned by drini. [ owner history (1) ]
|
|
(view preamble | get metadata)
Cross-references: terms, integers, partition, floor, sequences, irrationals, positive
There is 1 reference to this entry.
This is version 2 of Beatty's theorem, born on 2001-11-06, modified 2002-05-15.
Object id is 695, canonical name is BeattysTheorem.
Accessed 3892 times total.
Classification:
| AMS MSC: | 11B83 (Number theory :: Sequences and sets :: Special sequences and polynomials) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|