✦ LIBER ✦

Beatty sequences and Langford sequences

✍ Scribed by Roger B. Eggleton; Aviezri S. Fraenkel; R.Jaime Simpson

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 830 KB
Volume: 111
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90153-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Langford sequences: perfect and hooked

✍ James E. Simpson 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Asequence{d,d+l...., d f m -1) of m consecutive positive integers is said to be perfect if the integers {1,2, . . . , 2m} can be arranged in disjoint pairs {(q, bi): 1 si G m} so that {bi-a,: l~i~m}={d,d+l,..., d+m-1). A sequence is hooked if the set {1,2,...,2m-1,2m + 1) can be arranged in pairs to

Prime divisors in Beatty sequences

✍ William D. Banks; Igor E. Shparlinski 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 137 KB

We study the values of arithmetic functions taken on the elements of a non-homogeneous Beatty sequence αn + β , n = 1, 2, . . . , where α, β ∈ R, and α > 0 is irrational. For example, we show that where Ω(k) and ω(k) denote the number of prime divisors of an integer k = 0 counted with and without m

Extended Langford Sequences with Small D

Extended Langford Sequences with Small Defects

✍ Václav Linek; Zhike Jiang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 284 KB

A k-extended Langford sequence of defect d and length m is a sequence s 1 , s 2 , ..., s 2m+1 in which s k ==, where = is the null symbol, and each other member of the sequence comes from the set [d, d+1, ..., d+m&1]. Each j # [d, d+1, ..., d+m&1] occurs exactly twice in the sequence, and the two oc

A Generating Function Technique for Beat

A Generating Function Technique for Beatty Sequences and Other Step Sequences

✍ Kevin O'Bryant 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Let g(x, n), with x ¥ R + , be a step function for each n. Assuming certain technical hypotheses, we give a constant a and function f such that ; . n=1 g(x, n) can be written in the form a+; 0 < r < x f(r), where the summation is extended over all points in (0, x) at which some g( • , n) is not cont

Disjoint covering systems of rational Be

Disjoint covering systems of rational Beatty sequences

✍ R.J. Simpson 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 518 KB

Disjoint covering systems of rational be

Disjoint covering systems of rational beatty sequences

✍ Marc A Berger; Alexander Felzenbaum; Aviezri S Fraenkel 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 128 KB