Search Results for ""
561 - 570 of 886 for application definition recordSearch Results
A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...
The integer sequence defined by the recurrence P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=3, P(1)=0, P(2)=2. This recurrence relation is the same as that for the ...
The beautiful arrangement of leaves in some plants, called phyllotaxis, obeys a number of subtle mathematical relationships. For instance, the florets in the head of a ...
A polygonal number is a type of figurate number that is a generalization of triangular, square, etc., to an n-gon for n an arbitrary positive integer. The above diagrams ...
Closed forms are known for the sums of reciprocals of even-indexed Fibonacci numbers P_F^((e)) = sum_(n=1)^(infty)1/(F_(2n)) (1) = ...
Given a polynomial p(x)=a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0 (1) of degree n with roots alpha_i, i=1, ..., n and a polynomial q(x)=b_mx^m+b_(m-1)x^(m-1)+...+b_1x+b_0 (2) of ...
The base-3 method of counting in which only the digits 0, 1, and 2 are used. Ternary numbers arise in a number of problems in mathematics, including some problems of ...
A ternary diagram is a triangular diagram which displays the proportion of three variables that sum to a constant and which does so using barycentric coordinates. The ...
Thurston's conjecture proposed a complete characterization of geometric structures on three-dimensional manifolds. Before stating Thurston's geometrization conjecture in ...
The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...
...
View search results from all Wolfram sites (23884 matches)

