Search Results for ""
1531 - 1540 of 1833 for Disk covering problemSearch Results
A prime number (or prime integer, often simply called a "prime" for short) is a positive integer p>1 that has no positive integer divisors other than 1 and p itself. More ...
The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...
The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...
A harmonic number is a number of the form H_n=sum_(k=1)^n1/k (1) arising from truncation of the harmonic series. A harmonic number can be expressed analytically as ...
The number two (2) is the second positive integer and the first prime number. It is even, and is the only even prime (the primes other than 2 are called the odd primes). The ...
The alternating factorial is defined as the sum of consecutive factorials with alternating signs, a(n)=sum_(k=1)^n(-1)^(n-k)k!. (1) They can be given in closed form as ...
There are a number of meanings for the word "arc" in mathematics. In general, an arc is any smooth curve joining two points. The length of an arc is known as its arc length. ...
An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...
Place two solid spheres of radius 1/2 inside a hollow sphere of radius 1 so that the two smaller spheres touch each other at the center of the large sphere and are tangent to ...
Bridge is a card game played with a normal deck of 52 cards. The number of possible distinct 13-card hands is N=(52; 13)=635013559600, (1) where (n; k) is a binomial ...
...
View search results from all Wolfram sites (161691 matches)

