TOPICS
Search

Search Results for ""


8921 - 8930 of 13135 for Probability TheorySearch Results
A set of m distinct positive integers S={a_1,...,a_m} satisfies the Diophantus property D(n) of order n (a positive integer) if, for all i,j=1, ..., m with i!=j, ...
A two-player game, also called crosscram, in which player H has horizontal dominoes and player V has vertical dominoes. The two players alternately place a domino on a board ...
The double factorial of a positive integer n is a generalization of the usual factorial n! defined by n!!={n·(n-2)...5·3·1 n>0 odd; n·(n-2)...6·4·2 n>0 even; 1 n=-1,0. (1) ...
The Earls sequence gives the starting position in the decimal digits of pi (or in general, any constant), not counting digits to the left of the decimal point, at which a ...
A function built up of a finite combination of constant functions, field operations (addition, multiplication, division, and root extractions--the elementary operations)--and ...
A beautiful approximation to the Euler-Mascheroni constant gamma is given by pi/(2e)=0.57786367... (1) (OEIS A086056; E. W. Weisstein, Apr. 18, 2006), which is good to three ...
Euler conjectured that at least n nth powers are required for n>2 to provide a sum that is itself an nth power. The conjecture was disproved by Lander and Parkin (1967) with ...
The Fano plane is the configuration consisting of the two-dimensional finite projective plane over GF(2) ("of order two"), illustrated above. It is a block design with nu=7, ...
A Ferrers diagram represents partitions as patterns of dots, with the nth row having the same number of dots as the nth term in the partition. The spelling "Ferrars" (Skiena ...
The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...
1 ... 890|891|892|893|894|895|896 ... 1314 Previous Next

...