Search Results for ""

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 ...

Every real number is negative, 0, or positive. The law is sometimes stated as "For arbitrary real numbers a and b, exactly one of the relations a<b, a=b, a>b holds" (Apostol ...

To truncate a real number is to discard its noninteger part. Truncation of a (positive) number x therefore corresponds to taking the floor function |_x_|. Truncation also ...

The polyhedron compound of the truncated icosahedron and its dual, the pentakis dodecahedron. The compound can be constructed from a truncated icosahedron of unit edge length ...

For a set of positive gamma_k, k=0, 1, 2..., Turán's inequalities are given by gamma_k^2-gamma_(k-1)gamma_(k+1)>=0 for k=1, 2, ....

An error in a statistical test which occurs when a false hypothesis is accepted (a false positive in terms of the null hypothesis).

Let (K,|·|) be a valuated field. The valuation group G is defined to be the set G={|x|:x in K,x!=0}, with the group operation being multiplication. It is a subgroup of the ...

A sequence of numbers V={nu_n} is said to be weakly complete if every positive integer n beyond a certain point N is the sum of some subsequence of V (Honsberger 1985). ...

An infinite sequence {a_i} of positive integers is called weakly independent if any relation sumepsilon_ia_i with epsilon_i=0 or +/-1 and epsilon_i=0, except finitely often, ...

A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...