(ax)(ax) = a2 + 2ax + x2
I have a code for 16 bit subtraction.. just replace ax by al,bx by bl etc... .code main proc mov ax,@data mov ds,ax lea dx,msg ;printing msg mov ah,09h int 21h mov ax,x ;ax=x(any number) mov bx,y ;bx=y( " ") cmp ax,0 ;jump to l3 if ax is negtive jb l3 cmp bx,0 ;jump to l6 if bx is negative jb l6 cmp ax,bx ;if ax<bx,then jump to l1 jl l1 sub ax,bx ;else normal sub mov diff,ax ;diff=result is stored jmp l2 l1: ;iff (+)ax<(+)bx neg bx ;bx=-bx clc add ax,bx neg ax ;-ans=ans mov diff,ax mov dx,2dh ;print '-' mov ah,02h int 21h jmp l2 l3: ;iff (-)ax neg ax ;-ax=ax cmp bx,0 ;jump to l4 if bx is negative jb l4 clc add ax,bx ;ax=(+)ax+(+)bx mov ax,diff mov dx,2dh ;print '-' mov ah,02h int 21h jmp l2 l4: ;if (-)ax & (-)bx neg bx ;-bx=bx cmp ax,bx ;if ax>bx then jump to l5 jg l5 sub ax,bx ;else ax-bx mov diff,ax mov dx,2dh ;print '-' mov ah,02h int 21h jmp l3 l5: ;if(-)ax>(-)bx xchg ax,bx ;exchange ax and bx sub ax,bx ;ax-bx mov diff,ax ;ans is positive jmp l2 l6: ;iff (-)bx neg bx ;-bx=bx add ax,bx ;ax-(-)bx mov diff,ax ;ans will be positive mov ah,4ch int 21h main endp
[ Ax + By = C ] If 'A', 'B', and 'C' are numbers, then the graph is always a straight line, and the equation is a "linear" one.
AX-BY+C cannot be simplified any farther because none of them are like terms. unless, of course, one of these variables had a definite value.
Ax + By = C By = -Ax + C y = (-A/B)x + C/B
an ax
use an ax
They kill animal with guns bow arrows knife ax
One tool that a hominid used is a hand ax.
yes he killed his wife with a ax because she did not do what he told her to do
Da program pa yakho obo olambawa
She doesn't have one
an Indian stone ax is a stone that has one long lip in it for the wood piece to go on the ax its self
well i suggest u kill it. wwith a battle ax.
Mov ax,1234 mov bx,2345 add ax,bx mov @(some memory location ) say 2200,ax hlt
There is no one called ax people who think there are more people in the game are idiots
The difference is in the shape of the head of the ax.