An integer optimization problem with mixed algebraic and number-theoretic constraints Original Research Article

Two problems dealing with theory of numbers are considered. First, an unusual integer optimization problem characterized by mixed algebraic and number-theoretic constraints is studied, which has application in the sharing of secrets or sensitive resources. Next, a linear difference algorithm is proposed for generating sequences of prime numbers with accelerated growth rate in the number of digits produced.