TOPICS
Search

Search Results for ""


191 - 200 of 322 for Show AllSearch Results
Arrange copies of the n digits 1, ..., n such that there is one digit between the 1s, two digits between the 2s, etc. For example, the unique (modulo reversal) n=3 solution ...
The Lehmer cotangent expansion for which the convergence is slowest occurs when the inequality in the recurrence equation b_k>=b_(k-1)^2+b_(k-1)+1. (1) for ...
Li's criterion states that the Riemann hypothesis is equivalent to the statement that, for lambda_n=1/((n-1)!)(d^n)/(ds^n)[s^(n-1)lnxi(s)]|_(s=1), (1) where xi(s) is the ...
There are several types of numbers that are commonly termed "lucky numbers." The first is the lucky numbers of Euler. The second is obtained by writing out all odd numbers: ...
There are two versions of the moat-crossing problem, one geometric and one algebraic. The geometric moat problems asks for the widest moat Rapunzel can cross to escape if she ...
A Moiré pattern is an interference pattern produced by overlaying similar but slightly offset templates. A simple example is obtained by taking two identical ruled ...
The continued fraction for ln10 is [0; 1, 2, 3, 1, 6, 3, 1, 1, 2, 1, 1, 1, 1, 3, 10, ...] (OEIS A016730). The Engel expansion is 2, 3, 7, 9, 104, 510, 1413, ... (OEIS ...
The continued fraction for ln2 is [0; 1, 2, 3, 1, 6, 3, 1, 1, 2, 1, 1, 1, 1, 3, 10, ...] (OEIS A016730). It has been computed to 9702699208 terms by E. Weisstein (Aug. 21, ...
The number of partitions of n in which no parts are multiples of k is sometimes denoted b_k(n) (Gordon and Ono 1997). b_k(n) is also the number of partitions of n into at ...
The term "pathological" is used in mathematics to refer to an example specifically cooked up to violate certain almost universally valid properties. Pathological problems ...
1 ... 17|18|19|20|21|22|23 ... 33 Previous Next

...