Plato said:
That is not a complete question.
I am so sorry. The infimum is to be proved to be equal to zero as Makarov has pointed out.
---------- Post added at 11:16 PM ---------- Previous post was at 11:05 PM ----------
Actually this can be done using Pigeon hole principle.
Denote $x_n=\text{frac}(n \sqrt{3})$
Let $n \in \mathbb{Z}^{+}$. Partition the interval $(0,1)$ into $n$ parts, viz, $(0,\frac{1}{n}),(\frac{1}{n},\frac{2}{n}), \ldots, (\frac{n-1}{n},1)$
Consider $n+1$ numbers, $x_1, x_2, \ldots, x_{n+1}$.
By PHP there exist $i,j, i \neq j$ such that $x_i,x_j \in (\frac{k}{n},\frac{k+1}{n})$.
This implies $\text{frac}(|i-j|\sqrt{3}) < \frac{1}{n}$. Thus $x_{|i-j|} < \frac{1}{n}$.
I can't think of any other proof.