So we divide ''R'' into ''n'' square subregions <math>R_k, 1\leq k\leq n</math>, and in each region pick a point <math>(x_k,y_k)\in R_k</math>. Note that all the <math>R_k</math> might not cover all of our original region ''R''; but as the size of our squares decreases, they approximate the region better and better - in the limit, they will cover the whole thing. | So we divide ''R'' into ''n'' square subregions <math>R_k, 1\leq k\leq n</math>, and in each region pick a point <math>(x_k,y_k)\in R_k</math>. Note that all the <math>R_k</math> might not cover all of our original region ''R''; but as the size of our squares decreases, they approximate the region better and better - in the limit, they will cover the whole thing. |