<?xml version="1.0" encoding="UTF-8"?>

<record version="2" id="695">
 <title>Beatty's theorem</title>
 <name>BeattysTheorem</name>
 <created>2001-11-06 00:30:11</created>
 <modified>2002-05-15 00:49:03</modified>
 <type>Theorem</type>
 <creator id="3" name="drini"/>
 <author id="3" name="drini"/>
 <classification>
	<category scheme="msc" code="11B83"/>
 </classification>
 <related>
	<object name="Sequence"/>
	<object name="Irrational"/>
	<object name="Partition"/>
	<object name="Floor"/>
	<object name="Ceiling"/>
	<object name="BeattySequence"/>
	<object name="FraenkelsPartitionTheorem"/>
	<object name="FraenkelsPartitionTheorem2"/>
	<object name="ConjugateIndex"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}</preamble>
 <content>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&amp;=&amp;\lfloor p\rfloor,\lfloor 2p\rfloor,\lfloor 3p\rfloor,\ldots\\
\{\lfloor nq\rfloor\}_{n=1}^\infty&amp;=&amp;\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.</content>
</record>
