Help me please .......
1 answer:
Answer:
Step-by-step explanation:
<u>The ordered pairs for the given relation are:</u>
=> {(6,2)(-1,2)(-1,-1)(4,3)}
Domain => x-inputs of the ordered pairs
Domain => (6,-1,4)
Range => y-inputs of the ordered pairs
Range = (2,-1,3)
Since, <em>the values in the domain (-1) are being repeated, this relation is not a function.</em>
<em />
Hope this helped!
~AnonymousHelper1807
You might be interested in
Answer:
32760 ways
Step-by-step explanation:
Given
Number of Candidates = 15
Job Positions = 4
Required:
Number of outcomes
This question represent selection; i.e. selecting candidates for job positions;
This question can be solved in any of the following two ways
Method 1.
The first candidate can be chosen from any of the 15 candidates
The second candidate can be chosen from any of the remaining 14 candidates
The third candidate can be chosen from any of the remaining 13 candidates
The fourth candidate can be chosen from any of the remaining 12 candidates
Total Possible Selection = 15 * 14 * 13 * 12
<em>Total Possible Selection = 32760 ways</em>
<em></em>
Method 2:
This can be solved using permutation method which goes thus;
Where n = 15 and r = 4
So;
becomes
<em>Hence, there are 32760 ways</em>