XOR operation and GCD calculation

[Amit Goel]

how to calculate gcd of two numbers . like gcd(a,m)=p. how to get p??
h2. how to calcuate xor of two numbers . like q=n(xor)x???

[Manfred Leonhardt]

Hi Amit,
Use the code below to figure out the GCD.

  public int gcd( int i1, int i2 )
  {
    // Find largest of both numbers
    int largest = Math.max( i1, i2 );
    // Find smallest of both numbers
    int smallest = Math.min( i1, i2 );
    // Start by dividing larger number by smallest
    int mod = largest % smallest;
    // Start off with assuming the smaller value is the answer.
    int last = smallest;
    // Loop until we get no remainder
    while( mod != 0 )
    {
      // Save the last good value
      last = mod;
      // Check for remainder again
      mod = smallest % mod;
    }
    // Return last divider value that resulted in no remainder.
    return( last );
  }

For your second question, I don't understand what you want. You can just go ahead and do it:
byte b = 4 ^ 2;
Regards,
Manfred.