Search Results for ""
921 - 930 of 1543 for Aliquot SequenceSearch Results
Pick two real numbers x and y at random in (0,1) with a uniform distribution. What is the probability P_(even) that [x/y], where [r] denotes the nearest integer function, is ...
A system in which words (expressions) of a formal language can be transformed according to a finite set of rewrite rules is called a reduction system. While reduction systems ...
A prime which does not divide the class number h(p) of the cyclotomic field obtained by adjoining a primitive pth root of unity to the field of rationals. A prime p is ...
In the 1930s, Reidemeister first rigorously proved that knots exist which are distinct from the unknot. He did this by showing that all knot deformations can be reduced to a ...
For |q|<1, the Rogers-Ramanujan identities are given by (Hardy 1999, pp. 13 and 90), sum_(n=0)^(infty)(q^(n^2))/((q)_n) = 1/(product_(n=1)^(infty)(1-q^(5n-4))(1-q^(5n-1))) ...
A rook polynomial is a polynomial R_(m,n)(x)=sum_(k=0)^(min(m,n))r_kx^k (1) whose number of ways k nonattacking rooks can be arranged on an m×n chessboard. The rook ...
Hoffman (1998, p. 90) calls the sum of the exponents in the prime factorization of a number its roundness. The first few values for n=1, 2, ... are 0, 1, 1, 2, 1, 2, 1, 3, 2, ...
Rubik's Clock is a puzzle consisting of 18 small clocks, 14 of which are independent, each of which may be set to any 12-hour position. There are therefore 12^(14) possible ...
The exponent of the largest power of 2 which divides a given number 2n. The values of the ruler function for n=1, 2, ..., are 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, ... (OEIS A001511).
Sarnak's constant is the constant C_(Sarnak) = product_(p>=3)(1-(p+2)/(p^3)) (1) = 0.7236484022... (2) (OEIS A065476), where the product is over the odd primes.
...
View search results from all Wolfram sites (10972 matches)

