Search Results for ""
441 - 450 of 494 for Leading CoefficientSearch Results
A generating function f(x) is a formal power series f(x)=sum_(n=0)^inftya_nx^n (1) whose coefficients give the sequence {a_0,a_1,...}. The Wolfram Language command ...
The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...
Given a finitely generated Z-graded module M over a graded ring R (finitely generated over R_0, which is an Artinian local ring), the Hilbert function of M is the map ...
The hypercube is a generalization of a 3-cube to n dimensions, also called an n-cube or measure polytope. It is a regular polytope with mutually perpendicular sides, and is ...
The inverse sine is the multivalued function sin^(-1)z (Zwillinger 1995, p. 465), also denoted arcsinz (Abramowitz and Stegun 1972, p. 79; Harris and Stocker 1998, p. 307; ...
The Jack polynomials are a family of multivariate orthogonal polynomials dependent on a positive parameter alpha. Orthogonality of the Jack polynomials is proved in Macdonald ...
The Jacobi triple product is the beautiful identity product_(n=1)^infty(1-x^(2n))(1+x^(2n-1)z^2)(1+(x^(2n-1))/(z^2))=sum_(m=-infty)^inftyx^(m^2)z^(2m). (1) In terms of the ...
Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...
The least common multiple of two numbers a and b, variously denoted LCM(a,b) (this work; Zwillinger 1996, p. 91; Råde and Westergren 2004, p. 54), lcm(a,b) (Gellert et al. ...
A one-person game played on a rectangular lattice of lamps which can be turned on and off. A move consists of flipping a "switch" inside one of the squares, thereby toggling ...
...
View search results from all Wolfram sites (6661 matches)

