All Questions

Given positive integer $n$, we are looking for a set of $n$ positive integers $a_i$. The following linear integer program must have only the trivial integer solution of all ones. $0 \le x_i \le \frac{...

I would to determine the set of values $\lbrace a_1,a_2,a_3,\ldots,a_n \rbrace$ that minimizes the value of $x$ such that: $$x\equiv a_1\mod p_1$$ $$\vdots$$ $$x\equiv a_n\mod p_n$$ where every ...