Search Results for ""
61 - 70 of 581 for FactorSearch Results
Any linear combination of real spherical harmonics A_lP_l(costheta)+sum_(m=1)^l[A_l^mcos(mphi)+B_l^msin(mphi)]P_l^m(costheta) for l fixed whose sum is not premultiplied by a ...
For an integer n>=2, let lpf(n) denote the least prime factor of n. A pair of integers (x,y) is called a twin peak if 1. x<y, 2. lpf(x)=lpf(y), 3. For all z, x<z<y implies ...
Bessel's correction is the factor (N-1)/N in the relationship between the variance sigma and the expectation values of the sample variance, <s^2>=(N-1)/Nsigma^2, (1) where ...
The Feit-Thompson conjecture asserts that there are no primes p and q for which (p^q-1)/(p-1) and (q^p-1)/(q-1) have a common factor. Parker noticed that if this were true, ...
A Hajós group is a group for which all factorizations of the form (say) Z_n=A direct sum B have A or B periodic, where the period is a divisor of n. Hajós groups arose after ...
A semiprime which English economist and logician William Stanley Jevons incorrectly believed no one else would be able to factor. According to Jevons (1874, p. 123), "Can the ...
A rational function P(x)/Q(x) can be rewritten using what is known as partial fraction decomposition. This procedure often allows integration to be performed on each term ...
Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...
If {a_j} subset= D(0,1) (with possible repetitions) satisfies sum_(j=1)^infty(1-|a_j|)<=infty, where D(0,1) is the unit open disk, and no a_j=0, then there is a bounded ...
The sequence of numbers obtained by letting a_1=2, and defining a_n=lpf(1+product_(k=1)^(n-1)a_k) where lpf(n) is the least prime factor. The first few terms are 2, 3, 7, 43, ...
...
View search results from all Wolfram sites (5561 matches)

