Q: Ax plus bx plus c equals 0?

Write your answer...

Submit

Still have questions?

Continue Learning about Other Math

Two: one is 0, the other is -b/a ax2 + bx + c = 0, but c = 0 ⇒ ax2 + bx + 0 = 0 ⇒ ax2 + bx = 0 ⇒ x(ax + b) = 0 ⇒ x = 0 or (ax + b) = 0 ⇒ x = -b/a

It's ax squared x bx x c = 0 So (ax x ax) x bx x c = 0 This is the quadratic formula, then you'll move onto the quadratic equation.

2x^2 + 8x + 3 = 0

x2-5-4x2+3x = 0 -3x2+3x-5 = 0 or as 3x2-3x+5 = 0

This equation is referred to the type of math known as Quadratics, and is used to find the probela ( probela is a high curve ark , a type of shape) PLEASE SEE, don't look up Quadratics on answers.com, made mistake on equation to find probela.

Related questions

It is: 3x2+6x-11 = 0

a = 0, b = 0.

The equation ax2 + bx + c = 0, where a != 0 is called quadratic.

Two: one is 0, the other is -b/a ax2 + bx + c = 0, but c = 0 ⇒ ax2 + bx + 0 = 0 ⇒ ax2 + bx = 0 ⇒ x(ax + b) = 0 ⇒ x = 0 or (ax + b) = 0 ⇒ x = -b/a

It's ax squared x bx x c = 0 So (ax x ax) x bx x c = 0 This is the quadratic formula, then you'll move onto the quadratic equation.

The graph of the first form passes through the origin while the second does not - unless c = 0.

.code main proc mov ax,@data mov ds,ax lea dx,msg ;printing msg mov ah,09h int 21h mov ax,x ;ax=x 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

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^2 + bx + c = 0

A discriminant that is less than zero.

ax^2+bx+c=0 is the standard form of a quadratic function.

A linear equation.