in Quantitative Aptitude
402 views
0 votes
0 votes

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

  1. $\frac{1}{2} \: n$
  2. $(n-1)$
  3. $n$
  4. None of these
in Quantitative Aptitude
13.4k points
402 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true