
addition


	a	2384764
	b	9284027

	c	1568781		temp result
	d      1 1   1		carry flags 

	c+d    11668791		final result


repeat until carry flag vect is empty


	binary values, 	carry flags = left-shift(a AND B)
			temp result = a XOR b


effectively parallel bitwise operations, 3 to 4 logic operations on total value to generate result





sub


	carry/(borrow) flags right-shift if b value > a value




mult

	if last bit of b set, add a to temp result
	left-shift a
	right-shift b
	repeat


		a xxxxxxxx
		b xxxxxyxx	

		
		value in the result due to item y is 'y x 1000 x a'







	