Find the number of unordered triplets of boolean operations (AND, OR, XOR, XNOR, NOR, NAND, IMP, and IMPBY) that are sufficient to uniquely determine the values of two ordered bits.
Share
Find the number of unordered triplets of boolean operations (AND, OR, XOR, XNOR, NOR, NAND, IMP, and IMPBY) that are sufficient to uniquely determine the values of two ordered bits.
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Verified answer
Answer:
Let us say there are two natural numbers "L" and "R".
We performed eight operations on these two numbers as
Step-1: L = R
Step-2: L x L = R x L
Step-3: L^2 - R^2 = LR - R^2
Step-4: (L + R)( L - R) = R(L - R)
Step-5: L + R = R
Step-6: R + R = R
Step-7: 2R = R
Step- 8: 2 = 1
Let us say there are two natural numbers "L" and "R".
We performed eight operations on these two numbers as
Step-1: L = R
Step-2: L x L = R x L
Step-3: L^2 - R^2 = LR - R^2
Step-4: (L + R)( L - R) = R(L - R)
Step-5: L + R = R
Step-6: R + R = R
Step-7: 2R = R
Step- 8: 2 = 1
hello Aayush amm I'm Kashish rajput urf kashu uh remember me ? bhai tu Aayush hi hai na