Answer:
See the step-by-step explanation
Step-by-step explanation:
Let c be any element of C. (I'm not sure wether you have to assume that C is non-empt or not)
C is a subset of B. That means that as c is in C, it is also in B. (
)
Now, B is a subset of A. It follows that as 
.
That means c is an element of A. The predicate Q is true for all elements of A, including c.
Because we let c be any element of C, we have proven that the predicate Q is true for all elements in C.
Hey there! :)
Answer:
a) 32 sticks.
b) 5n + 2 sticks.
Step-by-step explanation:
Solve this by finding the pattern.
Pattern # 1 = 7 sticks.
Pattern #2 = 12 sticks
Pattern #3 = 17 sticks.
We can see an increase of 5 sticks within each. We can use this to write an equation:
f(n) = 7 + 5(n-1)
***Where n is the term number
You can simplify the equation to become:
f(n) = 7 + 5n - 5
f(n) = 5n + 2.
Use this equation to solve for pattern # 6:
f(6) = 7 + 5(n-1)
f(6) = 7 + 5(5)
f(6) = 7 + 25
f(6) = 32.
Answer:
3 (10-a) = 4 i think
Step-by-step explanation:
The following integers from the greatest to least are as follows:
+3, 0, -3, -2, -8
Answer:
y=2x+1, assuming my change in the reported data was correct.
Step-by-step explanation:
The data for x had one more entry than the values for y. I removed the second "0" so that the x and y points line up, as shown in the attached image. The data indicate a straight line, with a slope of 2 (y increases by 2 for every x increase of 1). The y-intercept is 1, as per the first data point (0,1).
