Let ${\delta }_k$ be such that in any $2$-colouring of $\{1,\dots ,n\}$ there exist at least $({\delta }_k+o(1))n^2$ many monochromatic $k$-term arithmetic progressions. Give reasonable bounds (or even an asymptotic formula) for ${\delta }_k$.