1,387 views
0 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

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
3.8k
3.8k views
go_editor asked May 11, 2016
3,779 views
There is a square field of side 500 m long each. It has a compound wall along its perimeter. At one of its corners, a triangular area of the field is to be cordoned off b...
0 0 votes
0 0 answers
1.5k
1.5k views
go_editor asked May 11, 2016
1,454 views
There is a circle of radius 1 cm. Each member of a sequence of regular polygons S1(n), n = 4, 5, 6, ..., where n is the number of sides of the polygon, is circumscribing ...
0 0 votes
1 1 answer
5.4k
5.4k views
go_editor asked May 11, 2016
5,426 views
Navjivan Express from Ahmedabad to Chennai leaves Ahmedabad at 6.30 a.m. and travels at 50 kmph towards Baroda situated 100 km away. At 7.00 a.m. Howrah-Ahmedabad Express...
0 0 votes
2 answers 2 answers
6.8k
6.8k views
go_editor asked May 10, 2016
6,763 views
Abraham, Border, Charlie, Dennis and Elmer, and their respective wives recently dined together and were seated at a circular table. The seats were so arranged that men an...
0 0 votes
1 answers 1 answer
2.0k
2.0k views
go_editor asked May 10, 2016
1,967 views
If $n^2= 12345678987654321$, what is n?12344321123578911111111111111111