Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9655155 | Discrete Applied Mathematics | 2005 | 10 Pages |
Abstract
We obtain a lower bound f(n) for μ(n) and determine infinite sequences of values of n for which μ(n)=f(n) and μ(n)>f(n), respectively. We derive upper bounds for μ(n) and prove that μ(n)=f(n)(1+o(1)). We conjecture that there is a constant c such that μ(n)⩽f(n)+c. Methods and results of design theory and number theory are used.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
G. Gutin, N. Jones, A. Rafiey, S. Severini, A. Yeo,