For each of the following, find an indexed collection {Annen of distinct sets (that is, no two sets are equal) satisfying the given conditions. (a) {0} and U1 An = [0, 1] =1 (b) 1 An = {−1, 0, 1} and U1 An = Z. 1 An :1 =

Yes,  you did not say what a is and what b is. Their values

the answer is not provided, what's going on?

I just realize I could follow the question. It seems like not right . Could you check it for me?

How large should n be to guarantee that the Trapezoidal Rule approximation to x - 12x- 48x² + 2x + 5) dæ is accurate to within 0.1. n = How large should n be to guarantee that the Simpsons Rule approximation to 2 1(-a - 12a - 48z? + 2x + 5) dx is accurate to within 0.1. n = Hint: Remember your answers should be a whole numbers, and Simpson's Rule requires even values for n Question Help: Video 1 D Video 2 Submit Question P Type here to search hp

Doesn't quite answer my question...I asked if there's a way to reason the answer WITHOUT plugging in numbers, and if not, what would be the METHOD for choosing what numbers to plug in. I didn't ask to just solve the problem. Please explain. Thank you

It is the same question