Search Results for ""
1461 - 1470 of 3301 for Circular FunctionsSearch Results
The cubefree part is that part of a positive integer left after all cubic factors are divided out. For example, the cubefree part of 24=2^3·3 is 3. For n=1, 2, ..., the first ...
Let X be a set and S a collection of subsets of X. A set function mu:S->[0,infty] is said to possess finite monotonicity provided that, whenever a set E in S is covered by a ...
The Gram series is an approximation to the prime counting function given by G(x)=1+sum_(k=1)^infty((lnx)^k)/(kk!zeta(k+1)), (1) where zeta(z) is the Riemann zeta function ...
Given a nonzero finitely generated module M over a commutative Noetherian local ring R with maximal ideal M and a proper ideal I of R, the Hilbert-Samuel function of M with ...
The Hilbert transform (and its inverse) are the integral transform g(y) = H[f(x)]=1/piPVint_(-infty)^infty(f(x)dx)/(x-y) (1) f(x) = ...
A type of plot invented by M. Trott that shows the behavior of a function near and far from the origin simultaneously. Inside a given radius, the plot shows the actual value ...
The number of different triangles which have integer side lengths and perimeter n is T(n) = P(n,3)-sum_(1<=j<=|_n/2_|)P(j,2) (1) = [(n^2)/(12)]-|_n/4_||_(n+2)/4_| (2) = ...
Given a unit line segment [0,1], pick two points at random on it. Call the first point x_1 and the second point x_2. Find the distribution of distances d between points. The ...
A triangle center alpha:beta:gamma is called a major triangle center if the triangle center function alpha=f(a,b,c,A,B,C) is a function of angle A alone, and therefore beta ...
A method for computing the prime counting function. Define the function T_k(x,a)=(-1)^(beta_0+beta_1+...+beta_(a-1))|_x/(p_1^(beta_0)p_2^(beta_1)...p_a^(beta_(a-1)))_|, (1) ...
...


