The Chinese Remainder Problem (Ch. R.P) is to find an integer x such that x = a sub i(mod m sub i) (i=1 ..., n), where mi are pairwise relatively prime moduli and a sub i are given integers. In the 1950's I learnt orally from Marcel Riesz that the CH. R.P. is an analogue of the polynomial interpolation problem P(x sub i) = Y sub i(i=1 ..., n), P(x) is a subset of pi sub n-1, and that the Ch. R.P. can be solved by an analogue of Lagrange's interpolation formula. The author now adds the remark that the Ch. R.P. can be solved, even more economically, by an analogue of Newton formula using successive divided differences.