TOPICS
Search

Search Results for ""


661 - 670 of 13135 for Highly Composite NumberSearch Results
A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.
A matrix is ill-conditioned if the condition number is too large (and singular if it is infinite).
The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.
To color any map on the sphere or the plane requires at most six-colors. This number can easily be reduced to five, and the four-color theorem demonstrates that the necessary ...
Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...
Consider the process of taking a number, taking its digit sum, then adding the digits of numbers derived from it, etc., until the remaining number has only one digit. The ...
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 ...
Write down the positive integers in row one, cross out every k_1th number, and write the partial sums of the remaining numbers in the row below. Now cross off every k_2th ...
The number one (1), also called "unity," is the first positive integer. It is an odd number. Although the number 1 used to be considered a prime number, it requires special ...
Consecutive numbers (or more properly, consecutive integers) are integers n_1 and n_2 such that n_2-n_1=1, i.e., n_2 follows immediately after n_1. Given two consecutive ...
1 ... 64|65|66|67|68|69|70 ... 1314 Previous Next

...