Changes

129 bytes added ,  05:03, January 13, 2010
Line 26: Line 26:     
While technically it doesn't matter too much what shapes we divide the region into, or that they be the same size, etc., we're going to use as simple and straightforward a definition as we can, to make our lives easier when we try to actually compute these things.   
 
While technically it doesn't matter too much what shapes we divide the region into, or that they be the same size, etc., we're going to use as simple and straightforward a definition as we can, to make our lives easier when we try to actually compute these things.   
−
 
+
[[Image:Approximation.jpg|thumb|200px|right|As the size of the squares decrease, they approximate the region better and better.]]
 
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.  
  
3,552

edits