Binary quadratic form

In mathematics, a binary quadratic form is a quadratic homogeneous polynomial in two variables x ≡ B 1 ( mod 2 A 1 e ) x ≡ B 2 ( mod 2 A 2 e ) B μ e x ≡ Δ + B 1 B 2 2 e ( mod 2 A ) {displaystyle {egin{aligned}x&equiv B_{1}{pmod {2{ frac {A_{1}}{e}}}}\x&equiv B_{2}{pmod {2{ frac {A_{2}}{e}}}}\{ frac {B_{mu }}{e}}x&equiv { frac {Delta +B_{1}B_{2}}{2e}}{pmod {2A}}end{aligned}}} In mathematics, a binary quadratic form is a quadratic homogeneous polynomial in two variables where a, b, c are the coefficients. When the coefficients can be arbitrary complex numbers, most results are not specific to the case of two variables, so they are described in quadratic form. A quadratic form with integer coefficients is called an integral binary quadratic form, often abbreviated to binary quadratic form. This article is entirely devoted to integral binary quadratic forms. This choice is motivated by their status as the driving force behind the development of algebraic number theory. Since the late nineteenth century, binary quadratic forms have given up their preeminence in algebraic number theory to quadratic and more general number fields, but advances specific to binary quadratic forms still occur on occasion. Pierre Fermat stated that if p is an odd prime then the equation p = x 2 + y 2 {displaystyle p=x^{2}+y^{2}} has a solution iff p ≡ 1 ( mod 4 ) {displaystyle pequiv 1{pmod {4}}} , and he made similar statement about the equations p = x 2 + 2 y 2 {displaystyle p=x^{2}+2y^{2}} , p = x 2 + 3 y 2 {displaystyle p=x^{2}+3y^{2}} , p = x 2 − 2 y 2 {displaystyle p=x^{2}-2y^{2}} and p = x 2 − 3 y 2 {displaystyle p=x^{2}-3y^{2}} x 2 + y 2 , x 2 + 2 y 2 , x 2 − 3 y 2 {displaystyle x^{2}+y^{2},x^{2}+2y^{2},x^{2}-3y^{2}} and so on are quadratic forms, and the theory of quadratic forms gives a unified way of looking at and proving these theorems Another instance of quadratic forms is Pell's equation x 2 − n y 2 = 1 {displaystyle x^{2}-ny^{2}=1}