Search Results for ""
311 - 320 of 371 for Permutation combinationsSearch Results
The golden ratio has decimal expansion phi=1.618033988749894848... (OEIS A001622). It can be computed to 10^(10) digits of precision in 24 CPU-minutes on modern hardware and ...
Let the sum of the squares of the digits of a positive integer s_0 be represented by s_1. In a similar way, let the sum of the squares of the digits of s_1 be represented by ...
A sequence {a_n}_(n=1)^N forms a (binary) heap if it satisfies a_(|_j/2_|)<=a_j for 2<=j<=N, where |_x_| is the floor function, which is equivalent to a_i<a_(2i) and ...
A labeled graph G=(V,E) is a finite series of graph vertices V with a set of graph edges E of 2-subsets of V. Given a graph vertex set V_n={1,2,...,n}, the number of ...
A noncayley graph is a graph which is not a Cayley graph. All graphs that are not vertex-transitive are noncayley graphs. However, some vertex-transitive graph are noncayley. ...
In algebraic topology, the Reidemeister torsion is a notion originally introduced as a topological invariant of 3-manifolds which has now been widely adapted to a variety of ...
In database structures, two quantities are generally of interest: the average number of comparisons required to 1. Find an existing random record, and 2. Insert a new random ...
A triangle center function (sometimes simply called a center function) is a nonzero function f(a,b,c) that is homogeneous f(ta,tb,tc)=t^nf(a,b,c) (1) bisymmetry in b and c, ...
A connection on a vector bundle pi:E->M is a way to "differentiate" bundle sections, in a way that is analogous to the exterior derivative df of a function f. In particular, ...
A "weird number" is a number that is abundant (i.e., the sum of proper divisors is greater than the number) without being pseudoperfect (i.e., no subset of the proper ...
...
View search results from all Wolfram sites (6288 matches)

