10 questions
a|1 if and only if ……………
a=1
a=-1
a=±1
a=0
The Diophantine equation
has ................. solns
one soln
two solns
no soln
many solns
The lcm(a,b) =ab if and only if …………………
gcd(a,b)=0
gcd(a,b)=1
gcd(a,b) 1
gcd(a,b)=2
Let a=qb+r and if r=0, then b/a and gcd(a,b)= …………..
a
b
q
0
If a|b then a|bc.
true
false
Identify the solutions of the linear congruence 9x≡21(mod30).
0
1
3
2
The linear congruence ax≡b(mod n) has how many solutions if gcd(a,n)=1
no soln
one soln
two soln
three soln
The linear congruence 36x≡8(mod102) has no solution
true
false
16!≡…………………..(mod 17)
-1
1
0
2
In division algorithm, the possible remainders of r when b=2 are …………….
0 and 1
1 and 2
1
0