Search Results for ""
4911 - 4920 of 13134 for Extremal graph theorySearch Results
A colossally abundant number is a positive integer n for which there is a positive exponent epsilon such that (sigma(n))/(n^(1+epsilon))>=(sigma(k))/(k^(1+epsilon)) for all ...
A composite number n is a positive integer n>1 which is not prime (i.e., which has factors other than 1 and itself). The first few composite numbers (sometimes called ...
While many computations admit shortcuts that allow them to be performed more rapidly, others cannot be sped up. Computations that cannot be sped up by means of any shortcut ...
The term "continued fraction" is used to refer to a class of expressions of which generalized continued fraction of the form b_0+(a_1)/(b_1+(a_2)/(b_2+(a_3)/(b_3+...))) ...
Conway's knot is the prime knot on 11 crossings with braid word sigma_2^3sigma_1sigma_3^(-1)sigma_2^(-2)sigma_1sigma_2^(-1)sigma_1sigma_3^(-1). The Jones polynomial of ...
If a discrete group of displacements in the plane has more than one center of rotation, then the only rotations that can occur are by 2, 3, 4, and 6. This can be shown as ...
The cuban primes, named after differences between successive cubic numbers, have the form n^3-(n-1)^3. The first few are 7, 19, 37, 61, 127, 271, ... (OEIS A002407), which ...
Instead of picking two points from the interior of the cube, instead pick two points on different faces of the unit cube. In this case, the average distance between the ...
A cubic spline is a spline constructed of piecewise third-order polynomials which pass through a set of m control points. The second derivative of each polynomial is commonly ...
A cyclic number is an (n-1)-digit integer that, when multiplied by 1, 2, 3, ..., n-1, produces the same digits in a different order. Cyclic numbers are generated by the full ...
...
View search results from all Wolfram sites (34319 matches)

