Skip to main content
1 of 4

Mixed Integer Program and Continuous Diophantine Approximation

Let $n\in\mathbb{N}$ such that $n\geq 2$ and let $0<r<1$ be a real number. We wish to solve the following problem.

$\min_{(t,(z_j)_{j=2}^n) \in \mathbb{R}\times \mathbb{Z}^{n-1}} t$

subject to :

$|\Big(\frac{\ln(j)}{2\pi}\Big)t - z_j| \leq \frac{r}{2\pi} \mbox{ } \forall 2 \leq j \leq n$.

$z_j\geq 0 \mbox{ } \forall 2 \leq j \leq n$.

$\sum_{j=2}^n z_j \geq 1$.

$t \geq 0$.

Note that $(z_j)_{j=2}^n$ is a non-zero vector of natural numbers. Suppose, we write the optimal value $t^*$ as a function of $n$ and $r$ i.e. say

$t^* = t^*(n,r)$.

i) How does $t^*(n,r)$ depend on $n$ and $r$?

ii) Is it independent of $n$ and only dependent on $r$?

iii) Is it polynomial or exponential in $n$?

iv) Could we derive a good upper bound for $t^*(n,r)$?