The first, Proposition 2 of Book VII, is a procedure for finding the greatest common divisor of two whole numbers.
Sieve of Eratosthenes, systematic procedure for finding prime numbers that begins by arranging all of the natural numbers (1, 2, 3, …) in numerical order.
Euclidean algorithm, procedure for finding the greatest common divisor (GCD) of two numbers, described by the Greek mathematician Euclid in his Elements (c. 300 bc).
Other properties of the sequence suggest that the scribe knew the general procedure for finding all such number triples that for any integers p and q, 2d/h = p/q + q/p and 2b/h = p/q − q/p.
The procedure for finding quotients in this form merely extends the usual method for the division of integers, where one now inspects the entries for 2/3, 1/3, 1/6, etc., and 1/2, 1/4, 1/8, etc., until the corresponding multiples of the divisor sum to the dividend.
(1) We develop a systematic procedure for finding canonical message kernels.
This approach provides an analytic procedure for finding the fading parameter.
In Figure 6 we illustrate the step of our procedure for finding roots or poles.
A systematic procedure for finding suitable controlled variables based on only steady-state information is presented.
The new procedure for finding optimal integration has been proposed based on new cogeneration targeting.
A homogenization procedure for finding the bending stiffness of a 2D regular lattice with random local interactions is proposed.
