Hello ManizzleWhen a relation is defined on a set, it forms a set ofordered pairs, like . (An ordered pair is just a pair of 'things' - often, but not always, numbers - in a certain order.) The 'things', and , that make up the ordered pair, are related in the way that is described in the definition of the relation.

So, for instance, if on the set the relation is defined, then will form a set of ordered pairs in which the first number, , is less than the second number, . So the set that's formed is:

(Obviously, if is defined on a different set of numbers - all the integers, for instance - then you'll get a different, but similar, set of ordered pairs.)

Now the inverse relationship simply reverses the order of the numbers in the ordered pair. So if is

, then

.

So your job in finding is to define this new set of ordered pairs using a rule, so that it looks like:

and are related by such-and-such a rule

Clearly, then, if , then

For , where the rule is " divides " typical ordered pairs might be (depending on which numbers are in the original set)

because in each ordered pair, the first number divides into the second without leaving a remainder.

When we reverse these to form some typical ordered pairs in we get:

So, can you see how we could describe the inverse rule? (The word 'multiple' comes to mind!)

Yes, it's is a multiple of

Combining relationsmeans first forming one set of ordered pairs using the first relation (which, confusingly is written down second, because we don't work from left to right!), and then using the second relation to form a second set of ordered pairs from the first.

So, for instance, we might start with , and form the ordered pair using the first relation . Then use the from this ordered pair with the relation to form another ordered pair .

Finally, if we're going to say what's happened when these relations are combined, we will need to describe the relation that gives all the ordered pairs like

In your question, then,

and

and we want to know what is. So we do first, getting ordered pairs like:

where the second number in the pair is never greater than the first.

Then we take thesecondnumber from each ordered pair, and with it form a new ordered pair using . For instance, we could get:

where the second number in the pair is now definitely smaller than the first.

Looking at the overall effect, using these examples, we get the ordered pairs:

Notice that we can't get now, because insists that the first number is strictly greater than the second. So the combined relation is simply:

In other words, it's the same as .

Sorry if that was a bit long, but I hope you understand it a bit better now.

Grandad