TOPICS
Search

Search Results for ""


1591 - 1600 of 3444 for Doubly_periodic_functionSearch Results
Let the divisor function d(n) be the number of divisors of n (including n itself). For a prime p, d(p)=2. In general, sum_(k=1)^nd(k)=nlnn+(2gamma-1)n+O(n^theta), where gamma ...
The largest value of a set, function, etc. The maximum value of a set of elements A={a_i}_(i=1)^N is denoted maxA or max_(i)a_i, and is equal to the last element of a sorted ...
"The" Smarandache constant is the smallest solution to the generalized Andrica's conjecture, x approx 0.567148 (OEIS A038458). The first Smarandache constant is defined as ...
The symmetric group S_n of degree n is the group of all permutations on n symbols. S_n is therefore a permutation group of order n! and contains as subgroups every group of ...
A normal distribution in a variate X with mean mu and variance sigma^2 is a statistic distribution with probability density function ...
The centroid is center of mass of a two-dimensional planar lamina or a three-dimensional solid. The mass of a lamina with surface density function sigma(x,y) is ...
Debye's asymptotic representation is an asymptotic expansion for a Hankel function of the first kind with nu approx x. For 1-nu/x>epsilon, nu/x=sinalpha, ...
If f(x) is an even function, then b_n=0 and the Fourier series collapses to f(x)=1/2a_0+sum_(n=1)^inftya_ncos(nx), (1) where a_0 = 1/piint_(-pi)^pif(x)dx (2) = ...
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) ...
1 ... 157|158|159|160|161|162|163 ... 345 Previous Next

...