## Received 19 Ianu~y 19% WC show that the modular n-queen prohlcm has a solutton if and only if gcd(n, 6,) = I. We give a class of solutions for all thcsc n.
The continuous multiple-modular design problem
β Scribed by Timothy L. Shaftel; Gerald L. Thompson
- Publisher
- John Wiley and Sons
- Year
- 1983
- Tongue
- English
- Weight
- 830 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Heden, O., On the modular n-queen problem, Discrete Mathematics 102 (1992) 155-161. Let M(n) denote the maximum number of queens on a modular chessboard such that no two attack each other. We prove that if 4 or 6 divides n then M(n) c n -2 and if gcd(n, 24) = 8 then M(n) 2 n -2. We also show that M
## Abstract Many problems in engineering analysis and design involve searching solutions of a system of equations. In most cases, because these equations are highly coupled and nonβlinear and thus unlikely to yield closeβform solutions, researchers seek possible solutions using numerical techniques