N-ary relations of sets

Question

How can I solve n-ary relations, is there a formula or something.I solved the first one but how can I solve more complicated than just with two, like the one in example $(d)$

EDIT: The problem is correct this way:

a. Give an explict subset of A for the given set.
b. Give an explict subset of $A^2$ for the given relation.
c. Give an explict subset of $A^3$ for the given relation.
d. Give an explict subset of $A^4$ for the given relation.

Answer 1

The problem is incorrect. The correct problem is:
a. Give an explict subset of A for the given set.
b. Give an explict subset of $A^2$ for the given relation.
c. Give an explict subset of $A^3$ for the given relation.
d. Give an explict subset of $A^4$ for the given relation.

Answer 2

For c, $A^2$ is the set of ordered pairs with elements from $A$. One of them is $(1,5)$ and that one satisfies the requirement. Another is $(4,4)$, which does not. You are expected to list all the pairs that satisfy the requirement. You should find $15$ of them. b seems like a lot of work because there are $216$ triplets in $A^3$ and most of them will satisfy the requirement.