66. 1ff(n) is a multiplicative fianction and f(n)= fd), then fis di (a) multiplicative (b) multiplicative inverse (c) gaussian (d) none of these 67. for any pos

66. 1ff(n) is a multiplicative fianction and F(n)= fd), then fis di (A) multiplicative (B) multiplicative inverse (C) Gaussian (D) None of these 67. For any positive integer n, ju (n), Lu (n + 1)u(n+2)u(+3) is cqual to: (A) 0 (B) 1 (C) t (D) None of these 68. For any positive integer n, ¢ (n) if and only if n is prime. (A) n+1 (B)-1 (C)n1 (D) None of these 69. ltn18 a. Dumber, then the smallest prime divisor of n is s wn. (A) prime (B) composite (C) odd prime (D) None of these 70. Ifa =b (mod m), a = b(mod n) and k (m, n), then : (A) a-b(mod n) (B) a= b (mod m) C) a=b (mod k) (D) Nonc of these 71. Let a, b and c be integers with not both a and b equal to 0 and let g g.cd. (a, b). if gte, then the equation ax + by c has .. Solutions in integers (B) finite (A) unique (D) None of these (C) no 72. If a = b (mod nm); a, = b,(mod m), then (B) -az = b -b (mod m) (A) a+ a = b + b, (mod m) (D) Nonc of these (C) Both (A) and (B) (13