Is there any way to represent XOR of two decimal Numbers using Arithmetic Operators (+,-,*,/,%).
How to represent XOR of two decimal Numbers with Arithmetic Operators
7
$\begingroup$
number-theory
logic
notation
-
4What is the definition of the XOR of two decimal numbers? – 2011-09-03
-
0@Rickey Demer: Thanks for bringing this question. My actual Question should be like this ? – 2011-09-03
-
0@Ricky, every natural number is the sum of different powers of 2 in exactly one way; this establishes a bijection between $\mathbb N$ and the set of finite subsets of $\{1,2,4,8,...\}$. Then bitwise XOR is the binary operation on natural numbers that corresponds to the operation $(A,B) \mapsto (A\cup B)\setminus(A\cap B)$ on sets-of-powers-of-2. – 2011-09-03
-
0I believe the question actually concerns two numbers represented in binary, not decimal numbers as the title says. – 2011-09-04
-
0i want the formula for xor of two decimal numbers using arthimetic operators made up of decimal numbers – 2011-09-04
-
0@Sunny Does the formula have to work for *any* pair of decimal numbers, or can it work for a particular pair like (0, 1)? – 2011-09-04
-
0the formula should have to work for any pair of decimal numbers. in this way we will derive square of two numbers x and y (x+y)2=x2+y2+2xy in the same way is there any formula for x^y=(?) the right side equation(?) should be constructed with x,y and with some algebra. – 2011-09-04
-
0possible duplicate of [Expressing bitwise operations in terms of other functions](http://math.stackexchange.com/questions/15141/expressing-bitwise-operations-in-terms-of-other-functions) – 2011-10-04