MBA Exam

let H(a,b)=greatest common factor of a and b.Let A be set of n positive integers,G(A)=G.C.F. of elements(greatest common factor) of 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) n/2
2) n-1
3) n
4) none

Read Solution (Total 0)

MBA Other Question

A palindrome is a positive integer which is unchanged if you reverse the order of its digits.If all palindromes are written in an increasing order how many prime values can the difference between successive palindromes take?

1) 1
2) 2
3) 3
4) none of these
If the roots of equation (q – r) x^2 + (r – p) x + p –q = 0 are equal then p, q, r are in:

1) ap
2) gp
3) hp
4) nothing