This paper considers the NP (Non-deterministic Polynomial)-hard problem of finding a minimum value of a quadratic program (QP), subject to m non-convex inhomoge
In this paper, we prove two formulas involving Mertens and Chebyshev functions. The first formula was done by Mertens himself without a proof. The second formul
In point set topology, it is well known that the Kuratowski 14-set problem is one of the most interesting results. In this note, we first give a brief survey of