The requirement is that every element in the domain must be connected to one - and one only - element in the codomain.
A classic visualization consists of two sets, filled with dots. Each dot in the domain must be the start of an arrow, pointing to a dot in the codomain.
So, the two things can't can't happen is that you don't have any arrow starting from a point in the domain, i.e. the function is not defined for that element, or that multiple arrows start from the same points.
But as long as an arrow start from each element in the domain, you have a function. It may happen that two different arrow point to the same element in the codomain - that's ok, the relation is still a function, but it's not injective; or it can happen that some points in the codomain aren't pointed by any arrow - you still have a function, except it's not surjective.
Answer:
The 50th term is 288.
Step-by-step explanation:
A sequence that each term is related with the prior by a sum of a constant ratio is called a arithmetic progression, the sequence in this problem is one of those. In order to calculate the nth term of a setence like that we need to use the following formula:
an = a1 + (n-1)*r
Where an is the nth term, a1 is the first term, n is the position of the term in the sequence and r is the ratio between the numbers. In this case:
a50 = -6 + (50 - 1)*6
a50 = -6 + 49*6
a50 = -6 + 294
a50 = 288
The 50th term is 288.
Answer:
8
Step-by-step explanation:
32 + 72 = __(4 + 9)
The greatest common factor of 32 and 72 is 8.
Divide 32 by 8. Divide 72 by 8.
Plug in 8 for the blank space.
32 + 72 = _8_(4 + 9)
Hope this helps!
Answer:
<h2>yes this is right and true</h2>