Search Results for ""

A reciprocity theorem for the case n=3 solved by Gauss using "integers" of the form a+brho, when rho is a root of x^2+x+1=0 (i.e., rho equals -(-1)^(1/3) or (-1)^(2/3)) and ...

A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

A cyclotomic field Q(zeta) is obtained by adjoining a primitive root of unity zeta, say zeta^n=1, to the rational numbers Q. Since zeta is primitive, zeta^k is also an nth ...

The regular polygon of 17 sides is called the heptadecagon, or sometimes the heptakaidecagon. Gauss proved in 1796 (when he was 19 years old) that the heptadecagon is ...

The Theodorus spiral, also known as the Einstein spiral, Pythagorean spiral, square root spiral, or--to contrast it with certain continuous analogs--the discrete spiral of ...

The natural norm induced by the L2-norm. Let A^(H) be the conjugate transpose of the square matrix A, so that (a_(ij))^(H)=(a^__(ji)), then the spectral norm is defined as ...

The substitution of re^(itheta) for z in a polynomial p(z). p(z) is then plotted as a function of theta for a given r in the complex plane. By varying r so that the curve ...

Trigonometric functions of npi/7 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 7 is not a ...

A root-finding algorithm which makes use of a third-order Taylor series f(x)=f(x_n)+f^'(x_n)(x-x_n)+1/2f^('')(x_n)(x-x_n)^2+.... (1) A root of f(x) satisfies f(x)=0, so 0 ...