Search Results for ""
221 - 230 of 1656 for Fibonacci SequenceSearch Results
Lehmer's totient problem asks if there exist any composite numbers n such that phi(n)|(n-1), where phi(n) is the totient function? No such numbers are known. However, any ...
For every positive integer n, there is a unique finite sequence of distinct nonconsecutive (not necessarily positive) integers k_1, ..., k_m such that ...
Krall and Fink (1949) defined the Bessel polynomials as the function y_n(x) = sum_(k=0)^(n)((n+k)!)/((n-k)!k!)(x/2)^k (1) = sqrt(2/(pix))e^(1/x)K_(-n-1/2)(1/x), (2) where ...
The silver ratio is the quantity defined by the continued fraction delta_S = [2,2,2,...] (1) = 2+1/(2+1/(2+1/(2+...))) (2) (Wall 1948, p. 24). It follows that ...
A random matrix is a matrix of given type and size whose entries consist of random numbers from some specified distribution. Random matrix theory is cited as one of the ...
A number of the form 2^n-1 obtained by setting x=1 in a Fermat-Lucas polynomial, more commonly known as a Mersenne number.
Pascal's triangle is a number triangle with numbers arranged in staggered rows such that a_(nr)=(n!)/(r!(n-r)!)=(n; r), (1) where (n; r) is a binomial coefficient. The ...
Given four points chosen at random inside a unit cube, the average volume of the tetrahedron determined by these points is given by ...
A fallacy is an incorrect result arrived at by apparently correct, though actually specious reasoning. The great Greek geometer Euclid wrote an entire book on geometric ...
An extension field F subset= K is called finite if the dimension of K as a vector space over F (the so-called degree of K over F) is finite. A finite field extension is ...
...
View search results from all Wolfram sites (12619 matches)

