Let p = Z k t + 1 be a prime where t > 1 is an odd integer, k 2 2. Methods of constructing a Z-cyclic triple whist tournament TWh(p) are given. By such methods we construct a Z-cyclic TWh(p) for d l primes p , p = l(mod 4), 29 5 p 5 16097, except p = 257. Let p , = 2ktt, + 1, q = Zk0oto + 3 be prime
New Product Theorems for Z-Cyclic Whist Tournaments
β Scribed by Ian Anderson; Norman J. Finizio; Philip A. Leonard
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 86 KB
- Volume
- 88
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
The aim of this note is to show how existing product constructions for cyclic and 1-rotational block designs can be adapted to provide a highly effective method of obtaining product theorems for whist tournaments.
π SIMILAR VOLUMES
A Z-cyclic triplewhist tournament for 4n+1 players, or briefly a TWh(4n+1), is equivalent to a . The existence problem for Z-cyclic TWh( p)'s with p a prime has been solved for p 1 (mod 16). I. Anderson
## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a βFull Textβ option. The original article is trackable v