Discrete Mathematics - MGNet

Lamé’s Theorem: Let a,b(N (a(b). Then the number of divisions used by the Euclidean algorithm to find gcd(a,b) ( 5•decimal digits in b. We can recursively define sets, too, not just functions. There is a basis step and a recursion step with the possibility of an exclusion step. Definition: The set (* of strings over an alphabet ( is defined by ................
................