Answer to Question #51206 in Discrete Mathematics for promise

Question

A rule which associates every element of a non-empty set A exactly on element of a non-empty set B is called a ……….

a. equation
b. function
c. subset
d. set

Answer 1

Definition: Let A and B be two non-empty sets. Suppose there exists a rule of correspondence, denoted by f which associates to each member of A, a unique member of B. Then ‘f’ is called a function or a mapping from set A to set B.
So, a rule which associates every element of a non-empty set A exactly on element of a non-empty set B is called a function.