TOPICS
Search

Search Results for ""


171 - 180 of 726 for Combinations of operations on fractionsSearch Results
1 calcus=1/(2304).
The least common denominator of a collection of fractions (p_1)/(q_1),...,(p_n)/(q_n) is the least common multiple LCM(q_1,...,q_n) of their denominators.
int_0^z(t^mu)/(1+t)dt=z/(mu+1+((mu+1)^2z)/((mu+2)-(mu+1)z+((mu+2)^2z)/((mu+3)-(mu+2)z+...))) for mu>-1 and -1<z<=1 (Perron 1954-1957, p. 18; Borwein et al. 2004, p. 35).
1 uncia=1/(12). The word uncia was Latin for a unit equal to 1/12 of another unit called the as. The words "inch" (1/12 of a foot) and "ounce" (originally 1/12 of a pound and ...
Consider the problem of comparing two real numbers x and y based on their continued fraction representations. Then the mean number of iterations needed to determine if x<y or ...
A branch of mathematics which encompasses many diverse areas of minimization and optimization. Optimization theory is the more modern term for operations research. ...
Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...
Gaussian brackets are notation published by Gauss in Disquisitiones Arithmeticae and defined by [ ]=1 (1) [a_1]=a_1 (2) [a_1,a_2]=[a_1]a_2+[ ] (3) ...
The algorithm of constructing and interpreting a quotient-difference table which allows interconversion of continued fractions, power series, and rational functions ...
A pair of matrices ND^(-1) or D^(-1)N, where N is the matrix numerator and D is the denominator.
1 ... 15|16|17|18|19|20|21 ... 73 Previous Next

...