Search Results for ""
931 - 940 of 13135 for Triangular NumberSearch Results
The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.
Let p be an odd prime and b a positive integer not divisible by p. Then for each positive odd integer 2k-1<p, let r_k be r_k=(2k-1)b (mod p) with 0<r_k<p, and let t be the ...
Let K be a number field and let O be an order in K. Then the set of equivalence classes of invertible fractional ideals of O forms a multiplicative Abelian group called the ...
The above two figures are rearrangements of each other, with the corresponding triangles and polyominoes having the same areas. Nevertheless, the bottom figure has an area ...
A number n is called a barrier of a number-theoretic function f(m) if, for all m<n, m+f(m)<=n. Neither the totient function phi(n) nor the divisor function sigma(n) has a ...
For any algebraic number x of degree n>2, a rational approximation p/q to x must satisfy |x-p/q|>1/(q^n) for sufficiently large q. Writing r=n leads to the definition of the ...
Legion's number of the first kind is defined as L_1 = 666^(666) (1) = 27154..._()_(1871 digits)98016, (2) where 666 is the beast number. It has 1881 decimal digits. Legion's ...
An addition chain for a number n is a sequence 1=a_0<a_1<...<a_r=n, such that each member after a_0 is the sum of two earlier (not necessarily distinct) ones. The number r is ...
An analog of the determinant for number triangles defined as a signed sum indexed by set partitions of {1,...,n} into pairs of elements. The Pfaffian is the square root of ...
The base-2 transcendental number 0.11011011111011011111..._2 (1) (OEIS A014578), where the nth bit is 1 if n is not divisible by 3 and is the complement of the (n/3)th bit if ...
...
View search results from all Wolfram sites (50106 matches)

