Font size
WorksheetsMA8551 / ANT - MODEL
Total questions: 100
Worksheet time: 2hrs 40mins
When the group G is called Abelian group
It's satisfies Closure
It's satisfies Commutative
It's satisfies Associative
For every group G, if a,b,c∈G and ab=ac then b=c
Left cancellation law
Right cancellation law
Abelian group
When the set G is written as (ab)−1=a−1b−1 for all a,b∈G
G is a group
G is an abelian
G is commutative
Define Subgroup
A empty subset H of a group G is called a sub-group of G whenever H itself a group under the binary operation in G
A non-empty subset H of a group G is called a sub-group of G whenever H itself a group under the binary operation in G
A non-empty subset H of a group G is called a sub-group of G
When H∩K is called Subgroup of G
H is Subgroup of G
K is subgroup of G
Both H and K are subgroup of G
Which one is the subgroups of (Z11∗, ∘)
{1, 10}
{1, 3, 4, 5, 9}
both
Which one is the subgroups of (Z11∗, ∘)
{1, 10}
{1, 3, 4, 5, 9}
both
f1 is the identity we can rotate 90° we get f2 . what is the order of f2
4
2
1
Which one is the properties of group homomorphism
f(an)=[f(a)]n
a+b=ab
Every subgroup of a cyclic group is
group
subgroup
cyclic
State Lagrange's theorem
If G is a finite group of order n with H is a subgroup of order m, then m divides n
If H is a group of order n then n divides any integer
If G is a finite group of order m with H is a subgroup of order n then m divides n
When the ring is called commutative ring
A ring R satisfies commutative law under multiplication
A ring R satisfies Closure condition
Not defined
The value of [25]−1 in Z72 is
41
24
49
For all integers n exactly one of n, 2n-1 and 2n+1 is divisible by
2
3
5
How many zero divisors are there in Z17
16
17
0
How many units are there in the ring Z7
6
4
5
How many polynomials are there of degree
n in Z11[x] ?
10(11)n
10 (11)
11n
Let f(x),g(x)∈Z7(x) where f(x)=2x2+x+2 and g(x)=6x+1 find f(x)+g(x)
7x+3
2x2+7x+3
2x2+3
If f(x)=x2+1, g(x)=x4+x3+x2+x+1, f(x), g(x)∈Z2[x],
find r(x)
1
2
0
If f(x), g(x)∈Q[x], f(x)=x8+7x5−4x4+3x3+5x2−4, g(x)=x−3
find the remainder when f(x) is divided by g(x)
8060
3
8660
If f(x)=x3+5x2+2x+6, f(x)∈Z7[x] , then determine all of the roots in Z7 and write f(x) as a product of first degree polynomials.
f(x)=(x−1)(x−3)(x−5)
f(x)=(x−1)(x−2)(x−5)
(x−2)(x−4)(x−6)
How many units are there in the ring Z5[x]
5
4
0
Let ab=ba=u , then b is called
multiplicative inverse of a
additive inverse of a
Zero element
Every non-zero polynomial of degree is less than or equal to 1 is called
irreducible
reducible
none of the above
When the polynomial is called monic
degree < 1
degree 0
its leading coefficient is 1
If ∣F∣=q and degree s(x)=n , then s(x)F[x] contains
qn element
q−n element
n element
What is the degree of 2x3+x+1
2
0
3
How many monic polynomials in Z7[x] have degree 4
75
76
74
What is the gcd of f(x)=x2+x−2, g(x)=x5−x4+x3+x2−x−1
x−1
x2−2
x−2
Check whether S(x)=x2+1 is reducible or not in Z2[x]
Yes
No
Let s(x)=x4+x3+1∈Z2[x] What is the order of the field S(x)Z2[x]?
8
32
16
How many elements in s(x)Zp[x] generate the multiplicative group of non-zero elements of this field?
pn−1
pn
pn−1
Give the characteristic for Z10[x]
10n
102
10
Construct a finite field of 27 elements
9
3
A polynomial over R that is the zero element or is of degree 0 is called
Degree 1
Constant Polynomial
Polynomial ring
Which one is remainder theorem
For
f(x)∈F[x] and a∈F, the remainder in the division of f(x) by x−a is f(a)
If f(x)∈F[x] and a∈F , then x−a is a factor of f(x) if and only if a is a root of f(x)
g(x)=q(x)f(x)+r(x)
The Division Algorithm is contains ---- parts
Two
Three
Infinite
Find the positive factor of f(19)
{1, 3, 19}
{1, 19)
{1, 3, 7, 19}
25 div 5 is
0
5
1
Every non empty set of positive integers has a least number.
a) The well ordering principle
The pigeonhole principle
The inclusion-Exclusion principle
Let f(n) denote the number of positive factors of a positive integer n, Evaluate f(12)
6
4
2
Evaluate d|18∑(181) where d is a positive integer.
1833
1839
39
The sum and the product of any two even integers are ---
Even
Odd
None of these
Whether it is true or false. Let a and b be positive integers such that a|b and b|a. Then a = b
False
True
Express 676 = ( )eight.
1244
1145
1028
Find the number of ones in the binary representation of 25−1
4
3
5
Express (1101)2 into octal integer.
15
17
21
Find the positive integer of 1976. It is divisible by 13
135
138
357
Does the conjecture hold for R102 ?
Yes
No
Using the formula of π(n) find the number primes ≤100
25
23
21
There are infinitely many primes
Euclid
Euler
Prime
Two positive integers a and b are relatively prime if their gcd is…….
2
1
None of these
In linear combination the values of α and β is
Unique
Need not be unique
None of these
Find
ab if [a,b]=156 and a and b are relatively prime.
ab=1
ab=156
ab=155
ab=157
Express (28, 12) as a linear combination of 28 and 12
(−1)28+2(12)
(−1)28+(−2)12
1(28)+2(12)
Express (1101)2 into a hexadecimal digit.
D
A
15
C
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
Reflexive
Transitive
Symmetric
Anti Symmetric
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
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
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
The LDE is of the form
ax+by=c
ax+by+c=0
Which one is the cassini's formula
Fn−1Fn+1+Fn2=(−1)n
Fn+1Fn−1−Fn2=(1)n
Fn+1Fn−1−Fn2=(−1)n
Using modulo 9, find the missing digit d in the congruence 7167 - 1776 = 53d1
either d=0 or d=9
d=−9
d=0
The solution of sun Tsu's puzzle by iteration is
x=52−105t
x=52+105t
x=−52−105t
Every integer n in base b is congruent to the sum of its digits
modulo b+1
modulo -b-1
modulo b - 1
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
In CRT the moduli are
Prime
Composite
Pairwise prime
Pairwise relatively prime
Using casting out nines, find the value of 68464
2
0
5
1
The product of four consecutive integers is divisible by
5
10
12
14
In Fibonacci series which one is the 9th position
21
25
34
45
What is the value of τ(p) where p is a prime
3
1
2
0
Is σ(pe)=p+1pe+1+1 ?
Yes
No
Let n be a positive integer, then the Tau function denotes
The number of positive number of n
The number of prime factor of n
The number of positive factors of n
The least positive factor of n
In multiplicative function the gcd of the two positive integer m and n are
Prime
Relatively Prime
Composite
Either Prime or Composite
Let m be a positive integer and ϕ(m) denotes the number of positive integers is less than or equal to m and relatively prime to is called -----
Euler's Theorem
Multiplication Function
Fermat's Theorem
Euler's Phi Function
Let p be a prime and a any integer such that p does not divide a then -----
ap+1≡1(mod p)
ap−1≡−1(mod p)
ap−1≡1(mod p)
ap+1≡−1(mod p)
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
Solve the congruence
x2≡1(mod 6)
x=1,2,5
x=1,5
x=2,5
x=1,6
When a positive integer a is self-invertible.
a≡1(mod p)
a≡−1(mod p)
Either a or b
None of the above
The Tau and Sigma functions are
Additive
Multiplicative
both a and b
neither a nor b
What is the value of σ(p) , where p is a prime
2
1
p−1
p+1
The sum of the positive factor of pq is
1+p+q
1−p+q+pq
p+q+pq
None of the above
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
What is the canonical decomposition of the number 24
7.3
22.6
22.32
A number theoretic function f is multiplicative if
f(mn)=f(n)f(m)
f(mn)=f(m)−f(n)
f(mn)=f(n)
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
If p is a prime, then (p−1)!≡−1(mod p) is called
Fermat’s theorem
Wilson’s theorem
Euler’s theorem
Multiplicative function
The value of d|n∑ϕ(d) for n=9
7
9
11
13
The sigma function denote the ---- of the positive factors of n
multiple
sum
number
function
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)
How many units are there in the ring Z2×Z2×Z2
0
2
1
3
Which one is not a group among the following?
(Z, +)
(Z, ∘)
(Q, +)
Which one is an abelian group from the following sets?
(Z, +)
(Z, ∘)
(Q, ∘)
