Search Results for ""
2071 - 2080 of 2910 for Integer complexitySearch Results
A number n with prime factorization n=product_(i=1)^rp_i^(a_i) is called k-almost prime if it has a sum of exponents sum_(i=1)^(r)a_i=k, i.e., when the prime factor ...
An alternating group is a group of even permutations on a set of length n, denoted A_n or Alt(n) (Scott 1987, p. 267). Alternating groups are therefore permutation groups. ...
A series of the form sum_(k=1)^infty(-1)^(k+1)a_k (1) or sum_(k=1)^infty(-1)^ka_k, (2) where a_k>0. A series with positive terms can be converted to an alternating series ...
Andrica's conjecture states that, for p_n the nth prime number, the inequality A_n=sqrt(p_(n+1))-sqrt(p_n)<1 holds, where the discrete function A_n is plotted above. The ...
Anomalous cancellation is a "canceling" of digits of a and b in the numerator and denominator of a fraction a/b which results in a fraction equal to the original. Note that ...
Archimedes' spiral is an Archimedean spiral with polar equation r=atheta. (1) This spiral was studied by Conon, and later by Archimedes in On Spirals about 225 BC. Archimedes ...
The arf invariant is a link invariant that always has the value 0 or 1. A knot has Arf invariant 0 if the knot is "pass equivalent" to the unknot and 1 if it is pass ...
Arithmetic is the branch of mathematics dealing with integers or, more generally, numerical computation. Arithmetical operations include addition, congruence calculation, ...
Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...
The associated Stirling numbers of the first kind d_2(n,k)=d(n,k) are defined as the number of permutations of a given number n having exactly k permutation cycles, all of ...
...
View search results from all Wolfram sites (340627 matches)

