OFFSET
1,1
COMMENTS
Suppose that r and c are real numbers, 0 < c < 1, and
...
s(m) = Sum_{k=1..m} (<c+k*r> - <k*r>)
...
where < > denotes fractional part. The inequalities s(m) < 0, s(m) = 0, s(m) > 0 yield up to three sequences that partition the set of positive integers, as in the examples cited below. Of particular interest are choices of r and c for which s(m) >= 0 for every m >= 1.
.
Note that s(m) = m*c - Sum_{k=1..m} floor(c + <k*r>). This shows that if c is a rational number p/q, then the range of s(m) is a set of rational numbers having denominator q. In this case, it is easy to prove that if s(m)=0, then m is an integer multiple of q, yielding a sequence of quotients denoted by [[m/q>]] in the following list:
.
r..........p/q....s(m)<0....s(m)=0....[[m/q]]...s(m)>0
.
Next, suppose that r and c are chosen so that s(m)=0 for all m. Then the sets X={m : s(m)<0} and Y={m : s(m)>0} represent a pair of "generalized Beatty sequences" in this sense: if c=1/<r>, the sets X and Y represent the Beatty sequences of 1/<r> and 1<-r>. Examples:
...
r..........c.........X.........Y......
REFERENCES
Ivan Niven, Diophantine Approximations, Interscience Publishers, 1963.
LINKS
Ronald L. Graham, Shen Lin, Chio-Shih Lin, Spectra of numbers, Math. Mag. 51 (1978), 174-176.
MATHEMATICA
r = Sqrt[2]; c = 1/2;
x[n_] := Sum[FractionalPart[k*r], {k, 1, n}]
y[n_] := Sum[FractionalPart[c + k*r], {k, 1, n}]
t1 = Table[If[y[n] < x[n], 1, 0], {n, 1, 100}];
Flatten[Position[t1, 1]] (* empty *)
t2 = Table[If[y[n] == x[n], 1, 0], {n, 1, 800}];
Flatten[Position[t2, 1]] (* A194368 *)
%/2 (* A194369 *)
t3 = Table[If[y[n] > x[n], 1, 0], {n, 1, 100}];
Flatten[Position[t3, 1]] (* A194370 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Aug 23 2011
STATUS
approved