Understanding and Formulas How to Find One-to-One Correspondence on the Mathematical Set
Definition and Formula How to Find One-One Correspondence [19459009 about Definition, Theory, Concepts And Types Of Mathematical Set ? In the subject matter of mathematics about the set, there is a term referred to as one-to-one correspondence, what is it? Let's just say absenteeism in a class. Every student in the attendance list must have a sequence and have their own number. There will be no student who has two serial numbers in the absence. It is a simple example of one-to-one correspondence.
Let's say in class there are 5 students, then teachers call them one by one to come to the front of the class. The five students are Dara, Indah, Gilang, Wulan, and Amir. We can separate the set of students by the absence number into the following: B = Amir, Dara, Gilang, Indah, Wulan and A = 1, 2, 3, 4, 5 then the relation of the two sets is " ". Thus the relation from set a to set b can be illustrated using the arrow diagram to be as follows:
Take a good look at the picture of the arrow diagram We can see that each member in set A matches exactly with each member in the set B. Therefore , The "absence number" relation generated from set A to set B can be referred to as a mapper An. Mapping as in the above example is called a one-to-one correspondence. Thus, one-to-one correspondence can be interpreted as:
"A function that Mapping members of a set with another set, in which each member in a set can be properly attached to each other and vice versa "
It can be concluded that the requirement to be fulfilled by a function or mapping to be called a one-to-one correspondence is the sum of the members of both sets to be equal to n (A) must be equal to n (B). Then how do I look for the one-to-one correspondence that might exist between A and B? See the following explanation:
How to Find One-to-One Correspondence on the Mathematical Set If n (A) = n (B) = n then the number of one-to-one correspondence that may occur between the sets A and B is: (1945902) [194590] [194590]] [194590]
n! = × (n - 1) × (n - 2) × (n - 3) ... 4 × 3 × 2 × 1.
n! = N factorial.
It is a formula that can be used in searching for one-on-one correspondences within the mathematical set. Well below are some examples of problems that apply the formula to solve the problems surrounding the set. Let's take a look at [1945909]
Sample Problem:
How many single correspondences can be made from the set of C = vowels and D = primes less than 13?
How to Answer:
C = vowel} {a, i, u, e, o
D = prime number less than 13 = 2, 3, 5, 7, 11
Since n (C) = n (D) = 5 then the sum of one-to-one correspondence between the sets C and D is:
5! = 5 × 4 × 3 × 2 × 1 = 120
That's how it would (19459007) Understanding and Formulas How to Seek One-to-One Correspondence on the Mathematical Set I hope you all can understand the material and examples of the problem well.
