lap, using LCKurtz' notation, consider any function [itex]f(x)[/itex] on the closed interval [itex][a,b][/itex]. I think we will both agree that any such function has a min and a max. Not knowing what this function is, we do know that the set of values that [itex]f(x)[/itex] takes on [itex][a,b][/itex] has a value at some [itex]A[/itex] in [itex][a,b][/itex] and some [itex]B[/itex] in [itex][a,b][/itex] such that [itex]f(A)[/itex] is a least upper bound and [itex]f(B)[/itex] is a greatest lower bound. This means that [itex]f(B)[/itex] is less than or equal to all other elements of [itex]f([a,b])[/itex] and [itex]f(A)[/itex] is greater than or equal to all other elements of [itex]f([a,b])[/itex], this is just the extreme value theorem (I'm pretty sure that's what it is called), as you might recall from your first year of calculus. What LCKurtz is asking is that you consider the case where the function [itex]f(x)=m[/itex] and the case where [itex]f(x)=M[/itex], in these cases, we can easily see the inequality that LCKurtz gave [itex]m\le{f(x)}\le{M}[/itex]. Because of the properties of this minimum and maximum, what do you think that this says about [itex]\int{m\cdot{g(x)}}dx[/itex] and [itex]\int{M\cdot{g(x)}}dx[/itex]?