Search Results for ""
481 - 490 of 1277 for Chebyshev PolynomialSearch Results
![](/common/images/search/spacer.gif)
The rhombic triacontahedral graph is Archimedean dual graph which is the skeleton of the rhombic triacontahedron, great rhombic triacontahedron, and small triambic ...
The rook numbers r_k^((m,n)) of an m×n board are the number of subsets of size k such that no two elements have the same first or second coordinate. In other word, it is the ...
The semigroup algebra K[S], where K is a field and S a semigroup, is formally defined in the same way as the group algebra K[G]. Similarly, a semigroup ring R[S] is a ...
A sequence is an ordered set of mathematical objects. Sequences of object are most commonly denoted using braces. For example, the symbol {2n}_(n=1)^infty denotes the ...
Squarefree factorization is a first step in many factoring algorithms. It factors nonsquarefree polynomials in terms of squarefree factors that are relatively prime. It can ...
A subset of an algebraic variety which is itself a variety. Every variety is a subvariety of itself; other subvarieties are called proper subvarieties. A sphere of the ...
The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...
There exist points A^', B^', and C^' on segments BC, CA, and AB of a triangle, respectively, such that A^'C+CB^'=B^'A+AC^'=C^'B+BA^' (1) and the lines AA^', BB^', CC^' ...
A unique factorization domain, called UFD for short, is any integral domain in which every nonzero noninvertible element has a unique factorization, i.e., an essentially ...
Following Yates (1980), a prime p such that 1/p is a repeating decimal with decimal period shared with no other prime is called a unique prime. For example, 3, 11, 37, and ...
![](/common/images/search/spacer.gif)
...