TOPICS
Search

Search Results for ""


631 - 640 of 4217 for Strong Lawof Small NumbersSearch Results
Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).
A Euclidean number is a number which can be obtained by repeatedly solving the quadratic equation. Euclidean numbers, together with the rational numbers, can be constructed ...
There are several results known as the Morgado identity. The first is (1) where F_n is a Fibonacci number and L_n is a Lucas number (Morgado 1987, Dujella 1995). A second ...
The nth Smarandache-Wellin number is formed from the consecutive number sequence obtained by concatenating of the digits of the first n primes. The first few are 2, 23, 235, ...
The least number of crossings that occur in any projection of a link. In general, it is difficult to find the crossing number of a given link. Knots and links are generally ...
The ratio of two numbers r and s is written r/s, where r is the numerator and s is the denominator. The ratio of r to s is equivalent to the quotient r/s. Betting odds ...
1 1 2 2 3 5 5 7 10 15 15 20 27 37 52 The Bell triangle, also called Aitken's array or the Peirce triangle (Knuth 2005, p. 28), is the number triangle obtained by beginning ...
Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...
A graph or directed graph together with a function which assigns a positive real number to each edge (Harary 1994, p. 52).
Let H_n denote the nth hexagonal number and S_m the mth square number, then a number which is both hexagonal and square satisfies the equation H_n=S_m, or n(2n-1)=m^2. (1) ...
1 ... 61|62|63|64|65|66|67 ... 422 Previous Next

...