Binary Operation True or False statements

  • Thread starter Thread starter Solid Snake
  • Start date Start date
  • Tags Tags
    Binary
Solid Snake
Messages
26
Reaction score
0
State True or False for each statement:
1. A binary operation on a set S assigns AT LEAST ONE element of S to each ordered pair of elements of S.

2. A binary operation on a set S assigns AT MOST ONE element of S to each ordered pair of elements of S.

3. A binary operation on a set S assigns EXACTLY ONE element of S to each ordered pair of elements of S.

4. A binary operation on a set S may assign more than one element of S to some ordered pair of elements of S.




I already know from the answer reference in the book I'm using, that numbers 1, 2, 3 are true and 4 is false. To me, the 3rd one being true makes perfect sense, no explanation needed. I know the definition of a binary operator. Also the 4th one being false makes 100% perfect sense to me. But I don't understand why the 1st and 2nd statements are true.



When reading the words "AT LEAST ONE" in the first statement, I interpret that the sentence opens the possibility of there existing 2 or 3 or 4, etc elements assigned. If this is the case, the statement would be false. Yet the books says it is true.

Same with the second statement. When reading the words "AT MOST ONE", I understand that the possibility exists that there could be NO element assigned because zero is less than one, or there could be one. If there is no element assigned, then it is false. But if there is one element assigned, it is true. The wording of the sentences confuse me.

Someone please explain this better for me! Thank you.
 
Last edited by a moderator:
Physics news on Phys.org
Think about this: <br /> 1 \ge 1<br /> \\ 1 \le 1<br /> Are these true or false?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top