I will outline some of the ideas behind the developments in ergodic theory and combinatorial number theory starting with Szemeredi's theorem on arithmetic progressions in dense subsets of the integers and its ergodic theoretic proof by Furstenberg, and culminating with the recent proof of the Hardy-Littlewood estimates for the number of solutions to systems of linear equations of finite complexity.