TOPICS
Search

Search Results for ""


2701 - 2710 of 3308 for Totient FunctionSearch Results
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, ...
The Euler-Gergonne-Soddy circle, a term coined here for the first time, is the circumcircle of the Euler-Gergonne-Soddy triangle. Since the Euler-Gergonne-Soddy triangle is a ...
For |z|<1, product_(k=1)^infty(1+z^k)=product_(k=1)^infty(1-z^(2k-1))^(-1). (1) Both of these have closed form representation 1/2(-1;z)_infty, (2) where (a;q)_infty is a ...
The exponent laws, also called the laws of indices (Higgens 1998) or power rules (Derbyshire 2004, p. 65), are the rules governing the combination of exponents (powers). The ...
On a Lie group, exp is a map from the Lie algebra to its Lie group. If you think of the Lie algebra as the tangent space to the identity of the Lie group, exp(v) is defined ...
An exponential moving average, also known as an exponentially weighted moving average and abbreviated EMA or EWMA, is a moving filter that applied weights to older values in ...
Given a field F and an extension field K superset= F, if alpha in K is an algebraic element over F, the minimal polynomial of alpha over F is the unique monic irreducible ...
An efficient version of the Walsh transform that requires O(nlnn) operations instead of the n^2 required for a direct Walsh transform (Wolfram 2002, p. 1072).
The Fermat quotient for a number a and a prime base p is defined as q_p(a)=(a^(p-1)-1)/p. (1) If pab, then q_p(ab) = q_p(a)+q_p(b) (2) q_p(p+/-1) = ∓1 (3) (mod p), where the ...
The Fibonacci factorial constant is the constant appearing in the asymptotic growth of the fibonorials (aka. Fibonacci factorials) n!_F. It is given by the infinite product ...
1 ... 268|269|270|271|272|273|274 ... 331 Previous Next

...