TOPICS
Search

Search Results for ""


321 - 330 of 2098 for Prime FormulasSearch Results
Let (a)_i be a sequence of complex numbers and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as f_(nk)=(product_(j=k)^(n-1)(a_j+k))/((n-k)!) and ...
Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_4=f(x_4). Then Simpson's 3/8 rule ...
The 2-point Newton-Cotes formula int_(x_1)^(x_2)f(x)dx=1/2h(f_1+f_2)-1/(12)h^3f^('')(xi), where f_i=f(x_i), h is the separation between the points, and xi is a point ...
For any set theoretic formula f(x,t_1,t_2,...,t_n), In other words, for any formula and set A there is a subset of A consisting exactly of those elements which satisfy the ...
A Cullen number is a number of the form C_n=2^nn+1. The first few are 3, 9, 25, 65, 161, 385, ... (OEIS A002064). Cullen numbers are divisible by p=2n-1 if p is a prime of ...
The set of terms of first-order logic (also known as first-order predicate calculus) is defined by the following rules: 1. A variable is a term. 2. If f is an n-place ...
A composite knot is a knot that is not a prime knot. Schubert (1949) showed that every knot can be uniquely decomposed (up to the order in which the decomposition is ...
The Wolstenholme numbers are defined as the numerators of the generalized harmonic number H_(n,2) appearing in Wolstenholme's theorem. The first few are 1, 5, 49, 205, 5269, ...
An idoneal number, also called a suitable number or convenient number, is a positive integer D for which the fact that a number is a monomorph (i.e., is expressible in only ...
There are at least two theorems known as Chebyshev's theorem. The first is Bertrand's postulate, proposed by Bertrand in 1845 and proved by Chebyshev using elementary methods ...
1 ... 30|31|32|33|34|35|36 ... 210 Previous Next

...