Use Riemann sum to approximate int,int_R x/y dA, R=[0,6]x[1,5] w/ m=3, n=2

smith1993123

New member
Joined
Jul 28, 2016
Messages
3
\(\displaystyle \mbox{Use a Riemann sum to approximate }\,\)\(\displaystyle \displaystyle \iint \limits_R\, \dfrac{x}{y}\, dA,\)

. . . . .\(\displaystyle \mbox{where }\, R\, =\, [0,\, 6]\, \times\, [1,\, 5],\, \mbox{ using }\, m\, =\, 3\, \mbox{ and }\, n\, =\, 2.\)

. . . . .\(\displaystyle \mbox{a. Take the sample points to be lower-left corners.}\)

. . . . .\(\displaystyle \mbox{b. Take the sample points to be upper-right corners.}\)

. . . . .\(\displaystyle \mbox{c. Take the sample points to be midpoints.}\)
 

Attachments

  • image1.JPG
    image1.JPG
    228.5 KB · Views: 9
Last edited by a moderator:
attachment.php
What are your thoughts?

Please share your work with us ...even if you know it is wrong

If you are stuck at the beginning tell us and we'll start with the definitions.

You need to read the rules of this forum. Please read the post titled "Read before Posting" at the following URL:

http://www.freemathhelp.com/forum/announcement.php?f=33
 
\(\displaystyle \mbox{Use a Riemann sum to approximate }\,\)\(\displaystyle \displaystyle \iint \limits_R\, \dfrac{x}{y}\, dA,\)

. . . . .\(\displaystyle \mbox{where }\, R\, =\, [0,\, 6]\, \times\, [1,\, 5],\, \mbox{ using }\, m\, =\, 3\, \mbox{ and }\, n\, =\, 2.\)

. . . . .\(\displaystyle \mbox{a. Take the sample points to be lower-left corners.}\)

. . . . .\(\displaystyle \mbox{b. Take the sample points to be upper-right corners.}\)

. . . . .\(\displaystyle \mbox{c. Take the sample points to be midpoints.}\)
Okay. They gave you a formula, from which the "m" and the "n" are referenced. What have you done with plugging the given information into the given formula, and applying the explained algorithm? Where are you stuck?

When you reply, please start with your book's particular formula, so we can know what they're meaning by the "m" and the "n", and continuing on with your steps, as far as you've been able to get. Thank you! ;)
 
Top