TOPICS
Search

Search Results for ""


1511 - 1520 of 3312 for Clausen_functionSearch Results
A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...
Let t(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Then if S_m=sum_(t(m))1/t, (1) then {S_m=0 (mod m^2) ...
Let n be a positive number having primitive roots. If g is a primitive root of n, then the numbers 1, g, g^2, ..., g^(phi(n)-1) form a reduced residue system modulo n, where ...
If a function f has a pole at z_0, then the negative power part sum_(j=-k)^(-1)a_j(z-z_0)^j (1) of the Laurent series of f about z_0 sum_(j=-k)^inftya_j(z-z_0)^j (2) is ...
Let P(1/x) be a linear functional acting according to the formula <P(1/x),phi> = Pint(phi(x))/xdx (1) = ...
If a sequence has the property that the block growth function B(n)=n+1 for all n, then it is said to have minimal block growth, and the sequence is called a Sturmian ...
The W-transform of a function f(x) is defined by the integral where Gamma[(beta_m)+s, 1-(alpha_n)-s; (alpha_p^(n+1))+s, 1-(beta_q^(m+1))-s] =Gamma[beta_1+s, ..., beta_m+s, ...
There are at least two statements which go by the name of Artin's conjecture. If r is any complex finite-dimensional representation of the absolute Galois group of a number ...
The complementary Bell numbers, also called the Uppuluri-Carpenter numbers, B^~_n=sum_(k=0)^n(-1)^kS(n,k) (1) where S(n,k) is a Stirling number of the second kind, are ...
A convex polyomino containing at least one edge of its minimal bounding rectangle. The perimeter and area generating function for directed polygons of width m, height n, and ...
1 ... 149|150|151|152|153|154|155 ... 332 Previous Next

...