Search Results for ""
6091 - 6100 of 13134 for Extremal graph theorySearch Results
Let sopfr(n) be the sum of prime factors (with repetition) of a number n. For example, 20=2^2·5, so sopfr(20)=2+2+5=9. Then sopfr(n) for n=1, 2, ... is given by 0, 2, 3, 4, ...
While the Catalan numbers are the number of p-good paths from (n,n) to (0,0) which do not cross the diagonal line, the super Catalan numbers count the number of lattice paths ...
The word "surface" is an important term in mathematics and is used in many ways. The most common and straightforward use of the word is to denote a two-dimensional ...
By analogy with the sinc function, define the tanc function by tanc(z)={(tanz)/z for z!=0; 1 for z=0. (1) Since tanz/z is not a cardinal function, the "analogy" with the sinc ...
The mean tetrahedron volume of a tetrahedron with vertices chosen at random inside another tetrahedron of unit volume is given by V^_ = (13)/(720)-(pi^2)/(15015) (1) = ...
Transfinite induction, like regular induction, is used to show a property P(n) holds for all numbers n. The essential difference is that regular induction is restricted to ...
The problem of finding the mean triangle area of a triangle with vertices picked inside a triangle with unit area was proposed by Watson (1865) and solved by Sylvester. It ...
An unordered factorization is a factorization of a number into a product of factors where order is ignored. The following table lists the unordered factorizations of the ...
A number v=xy with an even number n of digits formed by multiplying a pair of n/2-digit numbers (where the digits are taken from the original number in any order) x and y ...
Two lattice points (x,y) and (x^',y^') are mutually visible if the line segment joining them contains no further lattice points. This corresponds to the requirement that ...
...
View search results from all Wolfram sites (34319 matches)

