NEW
Font size
WorksheetsIAT III - ANT(MCQ)
Total questions: 30
Worksheet time: 30mins
When the LDE is solvable
d|c
c|d
d|a
d|b
The LDE has ---- number of solution
1
2
infinite
None of the above
In Fibonacci series which one is the 9th position
21
25
34
45
Reflexive
Transitive
Symmetric
Anti Symmetric
The product of four consecutive integers is divisible by
5
10
12
14
When the linear congruence
ax≡b(mod m) has a unique solution
[a, m]=1
(a, m)=1
(a, m)=1
(a, m)=d
The congruence
12x≡24(mod 6) has how many number of incongruent solution
6
4
2
1
Using casting out nines, find the value of 68464
2
0
5
1
In CRT the moduli are
Prime
Composite
Pairwise prime
Pairwise relatively prime
check the following statement: The linear system has a more number of solution modulo if and only if
(Δ, m)=1Statement is correct
Statement is wrong
A palindrome with an even number of digits is
divisible by 10
Not divisible by 11
divisible by 11
not divisible by 10
Which one of the following statement is correct
Every odd integer is congruent to 1 or 3 modulo 4
The square of every integer is congruent to 1 modulo 4
Both a and b
None of the above
What is the remainder of 5! Is divided by 15
0
3
1
5
Whether the LDE
1076x+2076y=3076 is solvable
Yes, it is solvable
It is not solvable
Not defined
Whether the number 548152 is divisible by 11
Yes
No
Whether the statement is true or false. If the congruence
x2≡1(mod m) has exactly
two solutions, then m is a prime.
True
False
If p is a prime, then (p−1)!≡−1(mod p) is called
Fermat’s theorem
Wilson’s theorem
Euler’s theorem
Multiplicative function
Find the remainder when 2416 is divided by 17.
1
-1
2
3
Which one is wrong
Let p be a prime and a any positive integer. Then ap≡a(mod p)
If p is a prime and p be odd, then 2(p−3)!≡−1(mod p)
A positive integer n≥2 is a prime if and only if (n−2)!≡−1(mod n)
All the above
Is the statement (12+18)17≡1211+1817 correct
Yes
No
A number theoretic function f is multiplicative if
f(mn)=f(n)f(m)
f(mn)=f(m)−f(n)
f(mn)=f(n)
Let (a, m)=1 and then solution of the linear congruence ax≡b(mod m) is
x≡aϕ(m)−1b(mod m)
x≡αϕ(p)−1b(mod p)
x≡aϕ(m)−1b(mod p)
x≡aϕ(m)−1(mod m)
Which one is correct from the following statements?
If p be a positive integer then ϕ(p)=p−1
If p be a prime number then ϕ(p)=p−1
If p be a positive integer then ϕ(p)=pe−1
All the above
What is the canonical decomposition of the number 24
7.3
22.6
22.32
Let m be a positive integer and a any integer with (a, m) = 1 then aϕ(m)−1 is
an inverse of a modulo m
an inverse of am modulo m
called Fermat's little theorem
Euler's Phi function
The sigma function denote the ---- of the positive factors of n
multiple
sum
number
function
The sum of the positive factor of pq is
1+p+q
1−p+q+pq
p+q+pq
None of the above
What is the value of σ(p) , where p is a prime
2
1
p−1
p+1
The Tau and Sigma functions are
Additive
Multiplicative
both a and b
neither a nor b
The value of d|n∑ϕ(d) for n=9
7
9
11
13
