The quality of approximation of Brun's algorithm in three dimensions (Q5957813)

This paper describes the quality of approximation of Brun's algorithm in dimension three, showing the exponent of convergence is \(1+d\). That is, there is a constant \(d>0\) such that for almost all \((x_1,x_2,x_3)\) there is a \(t\geq t(x)\) such that \(|x_i-p_i^{(t)}/q_i^{(t)}|\leq 1/(q^{(t)})^{1+d}\).