# Has a relationship c example function

### Relations and functions (video) | Khan Academy

Example: "Multiply by 2" is a very simple function. Here are the It must work for every possible input value; And it has only one relationship for each input value. This can be . "if it contains (a, b) and (a, c), then b must equal c". Which is just a . Fire has one way of being made. Leather comes from one specific source. Amoeba have one way of reproducing. The appendix had one function. Grapes come. open is a system call from Unix systems. fopen is the standard c function to open a file. There's some advantages of using fopen rather than open.

That's not what a function does. A function says, oh, if you give me a 1, I know I'm giving you a 2. If you give me 2, I know I'm giving you 2.

Now with that out of the way, let's actually try to tackle the problem right over here. So let's think about its domain, and let's think about its range. So the domain here, the possible, you can view them as x values or inputs, into this thing that could be a function, that's definitely a relation, you could have a negative 3.

You could have a negative 2. You could have a 0. You could have a, well, we already listed a negative 2, so that's right over there. Or you could have a positive 3. Those are the possible values that this relation is defined for, that you could input into this relation and figure out what it outputs.

## Function (mathematics)

Now the range here, these are the possible outputs or the numbers that are associated with the numbers in the domain. The range includes 2, 4, 5, 2, 4, 5, 6, 6, and 8. I could have drawn this with a big cloud like this, and I could have done this with a cloud like this, but here we're showing the exact numbers in the domain and the range.

And now let's draw the actual associations.

### Function composition - Wikipedia

So negative 3 is associated with 2, or it's mapped to 2. So negative 3 maps to 2 based on this ordered pair right over there.

Then we have negative 2 is associated with 4. So negative 2 is associated with 4 based on this ordered pair right over there. Actually that first ordered pair, let me-- that first ordered pair, I don't want to get you confused. It should just be this ordered pair right over here.

## Testing if a relationship is a function

Negative 3 is associated with 2. Then we have negative we'll do that in a different color-- we have negative 2 is associated with 4. Negative 2 is associated with 4. We have 0 is associated with 5. Or sometimes people say, it's mapped to 5. We have negative 2 is mapped to 6. Now this is interesting.

Negative 2 is already mapped to something. This is one of the more common mistakes people make when they first deal with functions.

This is just a notation used to denote functions.

**Determining if a Relationship is a Function 070-03**

Next we need to talk about evaluating functions. Evaluation is really quite simple. So, when there is something other than the variable inside the parenthesis we are really asking what the value of the function is for that particular quantity.

The key here is to notice the letter that is in front of the parenthesis. In other words, we just need to make sure that the variables match up. Here are the evaluations for this part. Here are the evaluations. Now the second one. Recall that when we first started talking about the definition of functions we stated that we were only going to deal with real numbers.

### Function (mathematics) - Wikipedia

This process of building complex objects from simpler ones is called object composition. The complex object is sometimes called the whole, or the parent.

The simpler object is often called the part, child, or component. For this reason, structs and classes are sometimes referred to as composite types. This reduces complexity, and allows us to write code faster and with less errors because we can reuse code that has already been written, tested, and verified as working.

Types of object composition There are two basic subtypes of object composition: A note on terminology: