Search Results for ""
2541 - 2550 of 3040 for Special Unitary MatrixSearch Results
Sexy primes are pairs of primes of the form (p, p+6), so-named since "sex" is the Latin word for "six.". The first few sexy prime pairs are (5, 11), (7, 13), (11, 17), (13, ...
A Sierpiński number of the first kind is a number of the form S_n=n^n+1. The first few are 2, 5, 28, 257, 3126, 46657, 823544, 16777217, ... (OEIS A014566). Sierpiński proved ...
An algorithm for making tables of primes. Sequentially write down the integers from 2 to the highest number n you wish to include in the table. Cross out all numbers >2 which ...
The most common "sine integral" is defined as Si(z)=int_0^z(sint)/tdt (1) Si(z) is the function implemented in the Wolfram Language as the function SinIntegral[z]. Si(z) is ...
Consider the consecutive number sequences formed by the concatenation of the first n positive integers: 1, 12, 123, 1234, ... (OEIS A007908; Smarandache 1993, Dumitrescu and ...
The number of cells in a generalized Chinese checkers board (or "centered" hexagram). Unlike the polygonal numbers, there is ambiguity in the case of the star numbers as to ...
Stirling's approximation gives an approximate value for the factorial function n! or the gamma function Gamma(n) for n>>1. The approximation can most simply be derived for n ...
The asymptotic series for the gamma function is given by (1) (OEIS A001163 and A001164). The coefficient a_n of z^(-n) can given explicitly by ...
A symmetric polynomial on n variables x_1, ..., x_n (also called a totally symmetric polynomial) is a function that is unchanged by any permutation of its variables. In other ...
A figurate number Te_n of the form Te_n = sum_(k=1)^(n)T_k (1) = 1/6n(n+1)(n+2) (2) = (n+2; 3), (3) where T_k is the kth triangular number and (n; m) is a binomial ...
...
View search results from all Wolfram sites (53947 matches)

