TOPICS
Search

Search Results for ""


761 - 770 of 8520 for 1Search Results
The triangle T that is externally tangent to the excircles and forms their triangular hull is called the extangents triangle (Kimberling 1998, p. 162). It is homothetic to ...
A root-finding algorithm which makes use of a third-order Taylor series f(x)=f(x_n)+f^'(x_n)(x-x_n)+1/2f^('')(x_n)(x-x_n)^2+.... (1) A root of f(x) satisfies f(x)=0, so 0 ...
Let sumu_k be a series with positive terms and let f(x) be the function that results when k is replaced by x in the formula for u_k. If f is decreasing and continuous for ...
A predictor-corrector method for solution of ordinary differential equations. The third-order equations for predictor and corrector are y_(n+1) = ...
Let f:A->B be a map between sets A and B. Let Y subset= B. Then the preimage of Y under f is denoted by f^(-1)(Y), and is the set of all elements of A that map to elements in ...
Any ideal of a ring which is strictly smaller than the whole ring. For example, 2Z is a proper ideal of the ring of integers Z, since 1 not in 2Z. The ideal <X> of the ...
The pseudosmarandache function Z(n) is the smallest integer such that sum_(k=1)^(Z(n))k=1/2Z(n)[Z(n)+1] is divisible by n. The values for n=1, 2, ... are 1, 3, 2, 7, 4, 3, 6, ...
If alpha is any number and m and n are integers, then there is a rational number m/n for which |alpha-m/n|<=1/n. (1) If alpha is irrational and k is any whole number, there ...
A generalization of the binomial coefficient whose notation was suggested by Knuth, |_n; k]=(|_n]!)/(|_k]!|_n-k]!), (1) where |_n] is a Roman factorial. The above expression ...
Define f(x_1,x_2,...,x_n) with x_i positive as f(x_1,x_2,...,x_n)=sum_(i=1)^nx_i+sum_(1<=i<=k<=n)product_(j=i)^k1/(x_j). (1) Then minf=3n-C+o(1) (2) as n increases, where the ...
1 ... 74|75|76|77|78|79|80 ... 852 Previous Next

...