Search Results for ""
2061 - 2070 of 13135 for Fibonacci NumberSearch Results
Various handshaking problems are in circulation, the most common one being the following. In a room of n people, how many different handshakes are possible? The answer is (n; ...
A sequence whose terms are integers. The most complete printed references for such sequences are Sloane (1973) and its update, Sloane and Plouffe (1995). Neil Sloane ...
If an integrable quasiperiodic system is slightly perturbed so that it becomes nonintegrable, only a finite number of n-map cycles remain as a result of mode locking. One ...
The German mathematician Kronecker proved that all the Galois extensions of the rationals Q with Abelian Galois groups are subfields of cyclotomic fields Q(mu_n), where mu_n ...
The signature s(K) of a knot K can be defined using the skein relationship s(unknot)=0 (1) s(K_+)-s(K_-) in {0,2}, (2) and 4|s(K)<->del (K)(2i)>0, (3) where del (K) is the ...
Every finite Abelian group can be written as a group direct product of cyclic groups of prime power group orders. In fact, the number of nonisomorphic Abelian finite groups ...
The Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...
A set of n distinct numbers taken from the interval [1,n^2] form a magic series if their sum is the nth magic constant M_n=1/2n(n^2+1) (Kraitchik 1942, p. 143). The numbers ...
In number theory (e.g., Ivić 2003), the symbol log_kx is commonly used to mean the nested logarithm (also called the repeated logarithm or iterated logarithm) ...
A mapping of random number triples to points in spherical coordinates according to theta = 2piX_n (1) phi = piX_(n+1) (2) r = sqrt(X_(n+2)) (3) in order to detect unexpected ...
...
View search results from all Wolfram sites (50915 matches)

