Search Results for ""
1881 - 1890 of 3828 for Aleph 0Search Results
Faà di Bruno's formula gives an explicit equation for the nth derivative of the composition f(g(t)). If f(t) and g(t) are functions for which all necessary derivatives are ...
The Farey sequence F_n for any positive integer n is the set of irreducible rational numbers a/b with 0<=a<=b<=n and (a,b)=1 arranged in increasing order. The first few are ...
The first practical algorithm for determining if there exist integers a_i for given real numbers x_i such that a_1x_1+a_2x_2+...+a_nx_n=0, or else establish bounds within ...
Consider a Lucas sequence with P>0 and Q=+/-1. A Fibonacci pseudoprime is a composite number n such that V_n=P (mod n). There exist no even Fibonacci pseudoprimes with ...
The ring of fractions of an integral domain. The field of fractions of the ring of integers Z is the rational field Q, and the field of fractions of the polynomial ring ...
A filtration of ideals of a commutative unit ring R is a sequence of ideals ... subset= I_2 subset= I_1 subset= I_0=R, such that I_iI_j subset= I_(i+j) for all indices i,j. ...
For any sequence of integers 0<n_1<...<n_k, there is a flag manifold of type (n_1, ..., n_k) which is the collection of ordered sets of vector subspaces of R^(n_k) (V_1, ..., ...
Let M^n be an n-manifold and let F={F_alpha} denote a partition of M^n into disjoint pathwise-connected subsets. Then F is called a foliation of M^n of codimension c (with ...
The Fourier cosine transform of a real function is the real part of the full complex Fourier transform, F_x^((c))[f(x)](k) = R[F_x[f(x)](k)] (1) = ...
Given a semicircular hump f(x) = sqrt(L^2-(x-L)^2) (1) = sqrt((2L-x)x), (2) the Fourier coefficients are a_0 = 1/2piL (3) a_n = ((-1)^nLJ_1(npi))/n (4) b_n = 0, (5) where ...
...
View search results from all Wolfram sites (190853 matches)

