Search Results for ""

An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...

The successive overrelaxation method (SOR) is a method of solving a linear system of equations Ax=b derived by extrapolating the Gauss-Seidel method. This extrapolation takes ...

A figurate number Te_n of the form Te_n = sum_(k=1)^(n)T_k (1) = 1/6n(n+1)(n+2) (2) = (n+2; 3), (3) where T_k is the kth triangular number and (n; m) is a binomial ...

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...

The Zernike polynomials are a set of orthogonal polynomials that arise in the expansion of a wavefront function for optical systems with circular pupils. The odd and even ...

Informally, an elliptic curve is a type of cubic curve whose solutions are confined to a region of space that is topologically equivalent to a torus. The Weierstrass elliptic ...

There are many mathematical and recreational problems related to folding. Origami, the Japanese art of paper folding, is one well-known example. It is possible to make a ...

The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

A number is said to be simply normal to base b if its base-b expansion has each digit appearing with average frequency tending to b^(-1). A normal number is an irrational ...