Let a, b and c be sets. prove a\ (buc) = (a\ b)n (a\c). hint. how to show two sets are equal? problem 1.3. for each function fi, determine whether it is injective but not surjective, or neither injective nor surjective. explain why where ro={r erlz> 0} =[0.00). surjective but not injective, bijective, (1) f. r r with f.(r) 2 for all re r

hi there!

first we need to find out how much they are adding to each number to make the next number.

ex: 4 + 4 = 8, 8 + 8 = 16, and so on.

so continuing with 32,

32 + 32 = 64

64 + 64 = 128

128 + 128 = 256

256 + 256 = 512

4, 8, 16, 32, 64, 128, 256, 512

the 8th term of the sequence will be 512

hope this ! ~

5

step-by-step explanation:

answer: c

substitute in the values.

for a:

f(0) = 0 + 9

f(0) = 9

a is a solution.

for b:

f(7) = 14 + 9

f(7) = 23

b is a solution.

for c:

f (3) = 6 + 9

f(3) = 15

c is not a solution. it's supposed to be 14.

for d:

f(2) = 4 + 9

f(2)= 13

d is a solution.