How many one-to-one functions are there from a set with two elements to a set with one elements? monitor

0

Step-by-step explanation:

ONE TO ONE FUNCTION : It is the function in which each element of the range of the function is connected with one element of the domain

Now let the set which contain 2 elements are m and the set which contain one element is n

For existence of one-to-one function there should be n\geq m . but here in m there are 2 elements and n there is 1 element so one-to-one function will not be defined

So 0 one-to-one function are formed

step-by-step explanation:

descending order means to order the polynomials from the term with the largest exponent to the term with the smallest exponent.  

therefore, the correct answer is d.  

1. sometimes

2.   never

3   .08c = 7.50+.05c   250 pages

step-by-step explanation:

1.   sometimes

the theoretical probability of rolling a 1 is 1/6.   perhaps you got really lucky and never rolled a 1   in those 60 times.   your experimental probability is 0.   or perhaps you rolled a 1   20 times.   your experimental probability is 20/60 is 1/3.     it really just depends on how you rolled in that experiment.

2.   never

the probability of the event occurring is 1.   that is being 100 % sure it will happen.   that is the maximum amount of confidence we have.

3.   no customer card cost:   .08 times number of pages

customer card cost:   7.50 + .05 times number of pages

we want to find when it costs the same amount, so we will set these equal

let c = number of pages

.08c = 7.50+.05c

subtract .05c from each side

.08c-.05c = 7.5+.05c-.05c

.03c=7.5

divide each side by .03

.03c/.03 = 7.5/03

c =250  

the cost is the same at 250 pages