CAT 1999 — QA Question 12
MiscellaneousEasy
For two positive integers a and b define the function h(a,b) as the greatest common factor (G.C.F) of a, b. Let A be a set of n positive integers. G(A), the G.C.F of the elements of set A is computed by repeatedly using the function h. The minimum number of times h is required to be used to compute G is
Answer & solution
Correct answer: (n - 1)
- A
(n - 1)
- C
n
- D
None of these
Solution
If there are n numbers, the function h has to be performed one time less.
Hence, option (b).
Related Miscellaneous questions
- Three labelled boxes containing red and white cricket balls are all mislabelled.…
- Among the four values given below, which is the least upper bound on e, where e …
- Let the number of white vessels needed be n 1 for the emptying process described…