Divam kumar Asked a Question
December 12, 2020 1:18 pmpts 30 pts
84. A positive integer is divisible by 9 iff the sum of the digits in js decimal representation is divisible by 3 (B) 9 (C) 81 (D) None of these 85. Ifp is a peime and ar be any integer such that pta. Then the solution of luncar congruence ax u b(modp) is given by (A) rP- modp (B) x p mod a (C)xaP modp (D) None of these 86. The integer p is prime if and only if: LP-1=-D(mod p) C)1P-1 #1 (mod p) (B) p-11(mad p) (D) None of these 87. L.el p be a us nd be uny integer, then -1y"(mod p) (A) prime, positive (B) odd. positive (C) odd, negative (D) None of these 88. The quadratic congruence r= -l(nmod p). p is a has a solution if p-1 (mod4) (A) composite (B) prime (C) perfect (D) None of these 89. Ifn is not divisible by any prime s vn, then n is a'an.. (A) Even (B) Odd (C) Prime (D) None of these (16) YEIH 3-MAT(8)8
  • 1 Answer(s)
  • 0 Likes
  • 1 Comments
  • Shares
  • Sonu Best Answer
    ans
    • cropped550194003036235865.jpg
    Likes(0) Reply(0)