66. 1ff(n) is a multiplicative function and f (n)= fld), then f is : (a) multiplicative (b) multiplicative inverse (c) gaussian (d) none of these 67. for any po

66. 1ff(n) is a multiplicative function and F (n)= fld), then f is : (A) multiplicative (B) multiplicative inverse (C) Gaussian (D) None of these 67. For any positive integer n, ju (n). ju (n+ 1Du (+2) ju (r +3) is cqual to: (A) 0 (B) 1 (C) tn (D) None of these 68. For any positive integer n, ()= f and only if n is prime. (A) n+1 (B)-1 (C)ntl (D) None of these 69. Ifn is a. number, then the smallest prime divisor of n is s n (A) prime (B) composite (C) odd prime (D) None of these 70. Ifa=b (mod m), a = b(mod m) and k (m, m), then : (A) a-b (mod n) (B) a = bmod m) (C) a -b (mod k) (D) None of these 71. Let a, b and c be integers with not both a and b equal to 0 and let g g.c.d. (a, b). if głe, then the equation ax + byc has. S0lutions in integers. (B) finite (A) unique (D) None of these (C) no 72. If a = b (mod nm); a, = b,(mod m), then (B) -a, = b - b, (mod m) (A) a+ a, =bh + b(mod m) (D) Nonc of these (C) Both (A) and (B) 113)