TOPICS
Search

Search Results for ""


71 - 80 of 276 for ComputeSearch Results
The integer sequence 1, 0, 1, 1, 2, 1, 3, 2, 4, 3, 5, 4, 7, 5, 8, 7, 10, 8, 12, 10, 14, 12, 16, 14, 19, 16, 21, 19, ... (OEIS A005044) given by the coefficients of the ...
An Anosov diffeomorphism is a C^1 diffeomorphism phi of a manifold M to itself such that the tangent bundle of M is hyperbolic with respect to phi. Very few classes of Anosov ...
Given a module M over a commutative unit ring R and a filtration F:... subset= I_2 subset= I_1 subset= I_0=R (1) of ideals of R, the associated graded module of M with ...
Polynomials b_n(x) which form a Sheffer sequence with g(t) = t/(e^t-1) (1) f(t) = e^t-1, (2) giving generating function sum_(k=0)^infty(b_k(x))/(k!)t^k=(t(t+1)^x)/(ln(1+t)). ...
A set S in a metric space (S,d) is bounded if it has a finite generalized diameter, i.e., there is an R<infty such that d(x,y)<=R for all x,y in S. A set in R^n is bounded ...
The Brent-Salamin formula, also called the Gauss-Salamin formula or Salamin formula, is a formula that uses the arithmetic-geometric mean to compute pi. It has quadratic ...
The second part of Pollard rho factorization method concerns detection of the fact that a sequence has become periodic. Pollard's original suggestion was to use the idea ...
A check which can be used to verify correct computations in a table of grouped classes. For example, consider the following table with specified class limits and frequencies ...
Using a Chebyshev polynomial of the first kind T(x), define c_j = 2/Nsum_(k=1)^(N)f(x_k)T_j(x_k) (1) = 2/Nsum_(k=1)^(N)f[cos{(pi(k-1/2))/N}]cos{(pij(k-1/2))/N}. (2) Then f(x) ...
Clark's triangle is a number triangle created by setting the vertex equal to 0, filling one diagonal with 1s, the other diagonal with multiples of an integer f, and filling ...
1 ... 5|6|7|8|9|10|11 ... 28 Previous Next

...