Beruflich Dokumente
Kultur Dokumente
net
t
ne
UNIT I - GROUPS AND RINGS
Groups : Definition - Properties - Homomorphism - Isomorphism - Cyclic groups - Cosets - Lagrange's
theorem. Rings: Definition - Sub rings - Integral domain - Field - Integer modulo n - Ring homomorphism
PART-A
.
Bloom’s
pz
Q.No. Question Taxonomy Domain
Level
1. Define group and State any two properties of a group. BTL -1 Remembering
2.
3.
ee
Prove that identity element in a group is unique.
Find the idempotent elements of 𝐺 = {1, −1, 𝑖, −𝑖} under the binary
operation multiplication
BTL -4
BTL -2
Analyzing
Understanding
Let Z be a group of integers with binary operation * defined by
4. 𝑎 ∗ 𝑏 = 𝑎 + 𝑏 − 2 for all 𝑎, 𝑏 ∈ 𝑍. Find the identity element of the BTL -2 Understanding
ad
group 〈𝑍,∗〉.
5. Prove that if 𝐺 is abelian group,
BTL -4 Analyzing
then for all 𝑎, 𝑏 ∈ 𝐺, (𝑎 ∗ 𝑏)2 = 𝑎2 ∗ 𝑏 2
6. Show that every cyclic group is abelian. BTL -2 Understanding
7. If 𝑎 is a generator of a cyclic group𝐺, then show that 𝑎−1 is also a
.p
BTL -6 Creating
generator of 𝐺.
8. Show that (𝑍5 , +5 ) is a cyclic group. BTL -6 Creating
9. Find the left cosets of {[0], [3]} in the addition modulo group
w
BTL -3 Applying
(𝑍6 , +6 ).
10. State Lagrange’s theorem. BTL -1 Remembering
11. Prove that the order of an element 𝑎 of a group 𝐺 is the same as that
w
BTL -1 Remembering
of its inverse (𝑎−1 )
12. Define a ring and give an example BTL -1 Remembering
13. Define ring homomorphism and Ring Isomorphism
w
BTL -1 Remembering
14. Define sub ring with example BTL -1 Remembering
15. Define ideal with example BTL -1 Remembering
16. In 𝑍72 , find 25−1 BTL -2 Understanding
17. Find 𝑥 such that 25𝑥 ≡ 3𝑚𝑜𝑑72 BTL -2 Understanding
www.padeepz.net
www.padeepz.net
18. Give an example of a ring which is not a field. BTL -6 Creating
19. Define integral domain and give an example. BTL -4 Analyzing
20. Find 𝑛 > 1 such that 401 ≡ 323(𝑚𝑜𝑑𝑛) BTL -2 Understanding
PART – B
1.(a) Show that group homomorphism preserves identity, inverse, and sub BTL -1 Remembering
group.
Prove that, if (G,*) is a finite cyclic group generated by an element
t
1. (b) 𝑎𝜖𝐺 and is of order n then 𝑎𝑛 = 𝑒 so that 𝐺 = {𝑎, 𝑎2 , … 𝑎𝑛 (= 𝑒)} . BTL -2 Understanding
ne
Also n is the least positive integer for which 𝑎𝑛 = 𝑒.
2. (a) Prove that the intersection of two subgroups of a group 𝐺 is again a BTL -2
Understanding
subgroup of 𝐺
Let 𝐺 be a group and 𝑎 ∈ 𝐺. Let 𝑓: 𝐺 → 𝐺 be given by
2.(b) 𝑓(𝑥) = 𝑎𝑥𝑎 −1 , ∀ 𝑥 ∈ 𝐺. Prove that 𝑓 is an isomorphism of BTL -2 Understanding
𝐺 onto 𝐺
.
Show that 𝑀2 , the set of all 2𝑋2 non singular matrices over 𝑅 is a
pz
3. (a) BTL -6 Creating
group under usual matrix multiplication. Is it abelian?
3.(b) Show that the union of two subgroups of a group G is again a
BTL -4 Analyzing
subgroup of 𝐺 if and only if one is contained in the other.
4. (a) State and prove Lagrange’s theorem BTL -4 Analyzing
4.(b)
5. (a)
ee
In any ring (𝑅, +, . ) (a) The zero element of 𝑅 is unique (b) The
additive inverse of each element is unique
Prove that the set 𝑍4 = {0,1,2,3} is a commutative ring with respct
BTL -5
BTL -1
Evaluating
Remembering
ot the binary operation +4 𝑎𝑛𝑑 ×4
5.(b) Determine whether 𝐻1 = {0, 5, 10} 𝑎𝑛𝑑 𝐻2 = {0, 4, 8, 12} are
BTL -5 Evaluating
ad
subgroups of 𝑍15 .
6.(a) Discuss Ring and Fields with suitable examples. BTL -4 Analyzing
6.(b) State and prove the fundamental theorem of group homomorphism BTL -1 Remembering
7. (a) Find the left cosets of the subgroup 𝐻 = {[0], [3]} of the group [Z6,
BTL -5 Evaluating
.p
+6].
7. (b) If G is a group of prime order, then G has no proper subgroups. BTL -6 Creating
Prove that the necessary and sufficient condition for a non-empty BTL -1 Remembering
8. (a) subset H of a group (𝐺,∗)to be a subgroup is
w
𝑎, 𝑏 ∈ 𝐻 ⇒ 𝑎 ∗ 𝑏 −1 ∈ 𝐻
8.(b) If (𝐹, +, . ) is a filed then it is an integral domain BTL -4 Analyzing
w
9. (a) Prove that every subgroup of a cyclic group is cyclic. BTL -5 Evaluating
10.(a) Define a cyclic group. Prove that any group of prime order is cyclic. BTL -6 Creating
Let f and g be the permutations of the elements of {1 , 2 , 3 , 4 , 5} BTL -2 Understanding
10.(b) 1 2 3 4 5 1 2 3 4 5
Given 𝑓 = ( ) and 𝑔 = ( ) then find
2 3 1 4 5 5 4 3 1 2
𝑔𝑓 2 𝑔−1 𝑎𝑛𝑑 𝑔−1 𝑓𝑔𝑓 −1 .
Prove that in a group G the equations BTL -3 Applying
11. (a) 𝑎 ∗ 𝑥 = 𝑏 𝑎𝑛𝑑 𝑦 ∗ 𝑎 = 𝑏 have unique solutions for the unknowns 𝑥
and 𝑦 as 𝑥 = 𝑎−1 ∗ 𝑏, 𝑦 = 𝑏 ∗ 𝑎 −1 when 𝑎, 𝑏 ∈ 𝐺.
www.padeepz.net
www.padeepz.net
𝑎 𝑏 BTL -1 Remembering
11. (b) Prove that the set of all matrices [ ]forms an abelian group
−𝑏 𝑎
with respect to matrix multiplication.
12. (a) Find [777]−1 𝑖𝑛 𝑡ℎ𝑒 𝑟𝑖𝑛𝑔 𝑍1009 . BTL -2 Understanding
12. (b) Show that(𝑄 + ,∗) is an abelian group where ∗ is defined as BTL -1 Remembering
𝑎 ∗ 𝑏 = 𝑎𝑏⁄2, ∀𝑎, 𝑏 ∈ 𝑄 +
13. (a) Show that the group ({1, 2, 3, 4}, 𝑋5 ) is cyclic. BTL -6 Creating
1 0 −1 0 1 0 −1 0 BTL -2 Understanding
t
13.(b) Prove that 𝐺 = {( ),( ),( ),( )} forms
0 1 0 1 0 −1 0 −1
ne
an abelian group under matrix multiplication.
14. (a) Prove that the set {1, −1, 𝑖, −𝑖} is a finite abelian group with respect BTL -1 Remembering
to the multiplication of complex numbers.
14. (b) Prove that 𝑍𝑛 is a field if and only if n is prime. BTL -1 Remembering
.
pz
Rings - Polynomial rings - Irreducible polynomials over finite fields - Factorization of polynomials over finite
fields.
PART- A
Bloom’s
Q.No. Question Taxonomy Domain
1
ee
Define polynomial.
Level
BTL -1 Remembering
Determine whether 𝑥 2 + 1 is an irreducible polynomial over the
2 BTL-3 Applying
field {0,1}.
ad
Does the set 𝐹 = {0,1,2,3) form a filed with respect to addition
3 BTL-4 Analyzing
modulo 4 and multiplication modulo 4? Why?
4 Define irreducible polynomial. BTL -1 Remembering
Show that 𝑥 2 + 𝑥 + 1 is irreducible over 𝑍5 .
.p
5 BTL-4 Analyzing
6 Find the roots for the function 𝑓(𝑥) = 𝑥 2 + 3𝑥 + 2 ∈ ℤ6 [𝑥]. BTL-2 Understanding
7 What are the roots of 𝑓(𝑥) = 𝑥 2 − 6𝑥 + 9 ∈ ℝ[𝑥]. BTL-2 Understanding
w
8 Find the roots for the function 𝑓(𝑥) = 𝑥 2 − 2 𝑖𝑛 𝑅[𝑥]𝑎𝑛𝑑 𝑄[𝑥]. BTL-2 Understanding
9 Obtain reducible polynomial of degree six with no roots inℤ2 . BTL-5 Evaluating
w
www.padeepz.net
www.padeepz.net
If 𝑓(𝑥) = 7𝑥 4 + 4𝑥 3 + 3𝑥 2 + 𝑥 + 4 & 𝑔(𝑥) = 3𝑥 3 + 5𝑥 2 + 6𝑥 +
16 Understanding
1, 𝑓(𝑥), 𝑔(𝑥) ∈ 𝑍7 [𝑥], then find 𝑓(𝑥) + 𝑔(𝑥) & deg(𝑓(𝑥) + 𝑔(𝑥)). BTL-2
t
PART-B
ne
Let ℝ[𝑥] be a polynomial ring, then Prove the following
1. (a) If ℝ is commutative then ℝ[𝑥] is commutative.
BTL-3 Applying
(b) If ℝ is a ring with unity then ℝ[𝑥] is a ring with unity.
(c) ℝ[𝑥] is an integral domain if and only if ℝ is an integral domain.
If 𝐹 is a field and 𝑓(𝑥) ∈ 𝐹[𝑥] has degree ≥ 1 , then prove that 𝑓(𝑥)
.
2. a) Applying
has at most n roots in 𝐹. BTL-3
pz
If 𝑓(𝑥) = 3𝑥 5 − 8𝑥 4 + 𝑥 3 − 𝑥 2 + 4𝑥 − 7, 𝑔(𝑥) = 𝑥 +
2. b) 9 𝑎𝑛𝑑 𝑓(𝑥), 𝑔(𝑥) ∈ ℤ[𝑥] , find the remainder when 𝑓(𝑥) is divided BTL-2 Understanding
by 𝑔(𝑥).
If ℝ is a ring then prove that (ℝ[𝑥], +, . ) is a ring called a
ee
3 Applying
polynomial ring over ℝ. BTL-3
6. a) BTL-2 Understanding
has degree 8 and degree 6, it is reducible but it has no real roots.
6. b) Discuss whether 𝑥 4 − 2 is reducible over ℚ , ℝ , ℂ. BTL-4 Analyzing
w
7. b)
𝑓(𝑥) = 𝑥 2 + 𝑥 + 1 over 𝑍3 , 𝑍5 , 𝑍7 BTL-5 Evaluating
8. Show that: A finite field F has order 𝑝𝑡 where p is a prime 𝑡 ∈ 𝑧 + . BTL-3 Applying
Find the remainder when 𝑔(𝑥) = 6𝑥 4 + 4𝑥 3 +5𝑥 2 + 3𝑥 + 1 is
9. a)
divided by 𝑓(𝑥) = 3𝑥 2 + 4𝑥 + 2 over polynomials in ℤ7 [𝑥]. BTL-2 Understanding
www.padeepz.net
www.padeepz.net
Let (𝐹 , + , . ) be a field. If Char (F) > 0, then prove that
9. b) BTL-3 Applying
Char (F) must be Prime.
Detemine whether the following polynomial is irreducible or not?
10. a)
𝑓(𝑥) = 𝑥 2 + 3𝑥 − 1 in ℝ[𝑥] , ℚ[𝑥], ℂ[𝑥]. BTL-5 Evaluating
t
Write 𝑓(𝑥) = (2𝑥 2 + 1)(5𝑥 3 − 5𝑥 + 3)(4𝑥 − 3) ∈ 𝑍7 [𝑥] as a
11. a)
ne
product of the unit and three Monic polynomial. BTL-2 Understanding
.
If 𝑓(𝑥) = 2𝑥 4 +5𝑥 2 + 2 , 𝑔(𝑥) = 6𝑥 2 + 4, then determine
pz
12. b)
𝑞(𝑥)𝑎𝑛𝑑 𝑟(𝑥)𝑖𝑛 ℤ7 [𝑥], where 𝑓(𝑥) is divided by 𝑔(𝑥). BTL-5 Evaluating
14. a)
ee
Check whether 𝑓(𝑥) = 𝑥 4 + 𝑥 3 + 𝑥 2 + 𝑥 + 1 ∈ 𝑍2 [𝑥] is
irreducible or not? BTL-4 Analyzing
Find the number of positive integers ≤ 3076 that are not divisible
5 BTL-2 Understanding
by 17
w
6 Express (10110)2 in base 10 and express (1076)10 in base two BTL-4 Analyzing
7 Express (1776)8 in base 10 and express (676)10 as octagonal BTL-4 Analyzing
8 Express (1976)16 in base 10 and express (2076)10 as hexadecimal BTL-4 Analyzing
9 Find the six consecutive integers that are composite BTL-2 Understanding
www.padeepz.net
www.padeepz.net
10 Express (12,15,21) as a linear combination of 12,15,and 21 BTL-4 Analyzing
Prove that the product of any two integers of the form 4n+1 is also
11 BTL-3 Applying
the same form
12 Use canonical decomposition to Evaluate the GCD of 168 and 180 BTL-5 Evaluating
13 Use canonical decomposition to evaluate LCM of 1050 and 2574 BTL-5 Evaluating
14 Find the canonical decomposition of 2520 BTL-2 Understanding
t
15 Find the prime factorization of 420, 135, 1925
ne
BTL-2 Understanding
16 Using (252,360) construct [252,360] BTL-6 Creating
17 Using recursion evaluate [24,28,36,40] BTL-5 Evaluating
18 Using recursion evaluate (18,30,60,75,132) BTL-5 Evaluating
.
19 Find the GCD (414,662) using Euclidean algorithm
pz
BTL-2 Understanding
20 Find the LCM (120.500) BTL-2 Understanding
PART -B
If 𝑎, 𝑏, 𝑐 ∈ 𝑍 then (i) 𝑎⁄𝑎 , 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑎 ≠ 0 ∈ 𝑍
1. a)
ee
(ii) 𝑎⁄𝑏 𝑎𝑛𝑑 𝑏⁄𝑐 𝑡ℎ𝑒𝑛 𝑎⁄𝑐 , ∀ 𝑎, 𝑏 ≠ 0, 𝑐 ≠ 0 ∈ 𝑍
(iii) 𝑎⁄𝑏 𝑡ℎ𝑒𝑛 𝑎⁄𝑏 𝑐, ∀𝑎 ≠ 0, 𝑏 ∈ 𝑍
BTL-1 Remembering
3. b) BTL-2 Understanding
that are divisible by 13 and not divisible by 17
Prove that (i) If 𝑝 is a prime and 𝑝/𝑎𝑏 then 𝑝/𝑎 or 𝑝/𝑏 (ii) If p is a
w
4. a) prime and 𝑝/𝑎1 𝑎2 𝑎3 ⋯ 𝑎𝑛 , where 𝑎1, 𝑎2, 𝑎3, ⋯ , 𝑎𝑛 are positive BTL-3 Applying
integers then 𝑝/𝑎𝑖 for some i, 1 ≤ 𝑖 ≤ 𝑛
Find the number of integers from 1 to 250 that are divisible by any
w
4. b) BTL-2 Understanding
of the integers 2,3,5,7
5. a) Prove that (𝑎, 𝑎 − 𝑏) = 1 if and only if (𝑎, 𝑏) = 1 BTL-3 Applying
Prove by induction that 2𝑛3 + 3𝑛2 + 𝑛 is divisible by 6 for all
5. b) BTL-3 Applying
integers 𝑛 ≥ 0
6. State and prove Fundamental Theorem of Arithmetic. BTL-1 Remembering
www.padeepz.net
www.padeepz.net
7. a) Prove that every integer 𝑛 ≥ 2 has a prime factor. BTL-3 Applying
Use Euclidean algorithm to find the GCD of (1819, 3587). Also
7. b) BTL-4 Analyzing
express the GCD as a linear combination of the given numbers
8. a) Prove that: (Euclid) There are infinitely many primes. BTL-3 Applying
8. b) Evaluate (625,1000) by using canonical decomposition BTL-5 Evaluating
9. a) Prove that there are infinitely many primes of the form 4𝑛 + 3 BTL-3 Applying
t
Use Euclidean algorithm to find the GCD of (12345,54321). Also
ne
9. b) BTL-4 Analyzing
express the GCD as a linear combination of the given numbers
10. a) Prove that every composite number n has prime factor ≤ [√𝑛] BTL-3 Applying
Use Euclidean algorithm to find the GCD of (2076,1776). Also
10. b) Analyzing
.
express the GCD as a linear combination of the given numbers BTL-4
pz
Prove that for every positive integer 𝑛 there are 𝑛 consecutive
11. a) BTL-3 Applying
integers that are composite numbers
Use Euclidean algorithm to find the GCD of (4076,1024). Also
11. b) BTL-4 Analyzing
express the GCD as a linear combination of the given numbers
ee
12. a) Construct the canonical decomposition of 23! BTL-6 Creating
Use Euclidean algorithm to find the GCD of (3076,1976). Also
12. b) BTL-4 Analyzing
express the GCD as a linear combination of the given numbers
Prove that two positive integers 𝑎 and 𝑏 are relatively prime iff
ad
13. a) BTL-3 Applying
[𝑎, 𝑏] = 𝑎𝑏
Use Euclidean algorithm to evaluate the GCD of (2024,1024). Also
13. b) BTL-5 Evaluating
express the GCD as a linear combination of the given numbers
𝑎.𝑏
.p
14. a) If a and b are positive integers then prove that [𝑎, 𝑏] = (𝑎,𝑏) BTL-3 Applying
For any positive integer , Prove that 8𝑛 + 3and 5𝑛 + 2 are
14. b) BTL-3 Applying
relatively prime
w
PART – A
1 Define linear Diophantine Equation in two variables. BTL-1 Remembering
w
www.padeepz.net
www.padeepz.net
6 Find the remainder when 1! + 2! + ⋯ + 100! is divided by 15. BTL-2 Understanding
7 Find the remainder when 1! + 2! + ⋯ + 1000! is divided by 10. BTL-2 Understanding
8 Find the remainder when 1! + 2! + ⋯ + 1000! is divided by 12. BTL-2 Understanding
If 𝑎 ≡ 𝑏(𝑚𝑜𝑑 𝑚), then prove that 𝑎𝑛 ≡ 𝑏 𝑛 (𝑚𝑜𝑑 𝑚) for any
9 Analyzing
positive integer 𝑛. BTL-4
t
𝑚
If 𝑎𝑐 ≡ 𝑏𝑐(𝑚𝑜𝑑 𝑚) and (𝑐 , 𝑚) = 𝑑 , 𝑡ℎ𝑒𝑛 𝑎 ≡ 𝑏 (𝑚𝑜𝑑
ne
11
𝑑
). BTL-3 Applying
12 Determine if the congruence 8𝑥 ≡ 10(𝑚𝑜𝑑 6) is solvable. BTL-4 Analyzing
13 Determine if the congruence 2𝑥 ≡ 3(𝑚𝑜𝑑 4) is solvable. BTL-4 Analyzing
Determine if the congruence 4𝑥 ≡ 7(𝑚𝑜𝑑 5) is solvable.
.
14 BTL-4 Analyzing
pz
Using Chinese Remainder theorem, determine whether the linear
15
system is solvable 𝑥 ≡ 7(𝑚𝑜𝑑 9) , 𝑥 ≡ 11(𝑚𝑜𝑑 12). BTL-2 Understanding
2. b) BTL-2 Understanding
Determine if each linear Diophantine equation is solvable (𝑖)12𝑥 +
3. a) 16𝑦 = 18 (𝑖𝑖)28𝑥 + 91𝑦 = 119, BTL -5 Evaluating
w
4. a) Applying
iff 𝑑/𝑐 𝑤ℎ𝑒𝑟𝑒 𝑑 = (𝑎, 𝑏) BTL-3
Find the least positive integer that leaves the remainder 3 when
4. b) BTL-2 Understanding
divided by 7,4 when divided by 9 and 8 when divided by 11
5. a) Prove that the relation ′ ≡ ′ (congruence) is an equivalence relation BTL-3 Applying
5. b) Solve 𝑥 ≡ 1(𝑚𝑜𝑑 3) , 𝑥 ≡ 3(𝑚𝑜𝑑 4), 𝑥 ≡ 4(𝑚𝑜𝑑 7), 𝑥 ≡ BTL-3 Applying
www.padeepz.net
www.padeepz.net
7(𝑚𝑜𝑑 11).
Prove that 𝑎 ≡ 𝑏(𝑚𝑜𝑑𝑚) iff 𝑎 and 𝑏 leave the same remainder
6. a) BTL-3 Applying
when divided by 𝑚.
6. b) Solve 3𝑥 + 13𝑦 ≡ 8(𝑚𝑜𝑑 55), 5𝑥 + 21𝑦 ≡ 34(𝑚𝑜𝑑 55)P BTL-3 Applying
Prove that the integer 𝑟 is the remainder when 𝑎 is divided by 𝑚 iff
7. a) BTL-3 Applying
𝑎 ≡ 𝑟(𝑚𝑜𝑑𝑚)𝑤ℎ𝑒𝑟𝑒 0 ≤ 𝑟 < 𝑚
t
7. b) Solve 2𝑥 + 3𝑦 ≡ 4(𝑚𝑜𝑑 13), 3𝑥 + 4𝑦 ≡ 5(𝑚𝑜𝑑 13) BTL-3 Applying
ne
Show that every integer is congruent to exactly one of the least
8. a)
residues 0,1,2, ⋯ , (𝑚 − 1)𝑚𝑜𝑑𝑢𝑙𝑜 𝑚 BTL-4 Analyzing
A fruit basket contains apples and oranges. Each apple cost 65 Rs.
8. b) Each orange cost 45Rs. For a total of 810 Rs. Find the minimum BTL-2 Understanding
.
possible numbers of apple in the basket.
pz
Verify that whether the number of prime of the form 4𝑛 + 3 be
9. a) BTL-4 Analyzing
expressed as the sum of two squares
9. b) Compute the remainder when 3247 is divided by 25 BTL-4 Analyzing
10. a)
ee
Prove that , let 𝑎 ≡ 𝑏(𝑚𝑜𝑑𝑚)𝑎𝑛𝑑 𝑐 ≡ 𝑑(𝑚𝑜𝑑𝑚) then
(𝑖)𝑎 + 𝑐 ≡ 𝑏 + 𝑑(𝑚𝑜𝑑𝑚) BTL-4 Analyzing
(𝑖𝑖)𝑎𝑐 ≡ 𝑏𝑑(𝑚𝑜𝑑𝑚)
12. b) (ii) Prove that an integer is divisible by 5 iff its unit digit is zero or
BTL-2 Understanding
five (iii) Prove that an integer ‘n’ is divisible by 2𝑖 iff the number
formed by the last ‘i’ digits in ‘n’ is divisible by 2𝑖
w
14. a)
𝑑/𝑏, where 𝑑 = (𝑎, 𝑚). If 𝑑/𝑏, then it has d incongruent solutions BTL-2 Understanding
www.padeepz.net
www.padeepz.net
UNIT-V CLASSICAL THEOREMS AND MULTIPLICATIVE FUNCTIONS
Wilson‘s theorem – Fermat‘s little theorem – Euler‘s theorem – Euler‘s Phi functions – Tau and Sigma
functions
PART -A
1 State Wilsons Theorem BTL-1 Remembering
2 State Fermat’s Theorem BTL-1 Remembering
3 State Euler’s Theorem BTL-1 Remembering
t
4 Define Euler Phi Function BTL-1 Remembering
ne
5 Define Tau Function BTL-1 Remembering
6 Define Sigma Function BTL-1 Remembering
7 Show that 11 is self invertible. BTL-4 Analyzing
.
(𝑛𝑝)!
8 Evaluate 𝑛! 𝑝𝑛 if n=46, p=5
pz
BTL-5 Evaluating
9 How many primes are there of the form m! + 1 when m≤ 100? BTL-2 Understanding
10 Find the self invertible least residue modulo each prime 7 and 19 BTL-2 Understanding
11 Solve 𝑥 2 ≡ 1 𝑚𝑜𝑑(6)
ee BTL-2 Understanding
12 Find the least residues of 1,2, … , 𝑝 − 1 𝑚𝑜𝑑𝑢𝑙𝑜 7 BTL-3 Applying
Let p be a prime number and a any integer such that 𝑝 × 𝑎 then
13
prove that 𝑎𝑝−2 is an inverse of a modulo p BTL-3 Applying
ad
14 Evaluate the inverse of 12 modulo 7 BTL-5 Evaluating
15 Solve the linear congruence of 12x ≡ 6 (mod 7) BTL-2 Understanding
16 Solve the linear congruence of 24x ≡ 11 (mod 17) BTL-2 Understanding
.p
BTL-1 Remembering
20 Compute ∅ (15,625) BTL-5 Evaluating
PART-B
w
1. b) BTL-2 Understanding
2. a) State and Prove Wilson’s Theorem. BTL-1 Remembering
2. b) Find the remainder when 71001 is divided by 17 BTL-2 Understanding
3. a) State and Prove Fermat’s Little Theorem BTL-1 Remembering
3. b) Find the remainder when 151976 is divided by 23 BTL-2 Understanding
www.padeepz.net
(𝑛𝑝)!
www.padeepz.net
𝑛 (𝑚𝑜𝑑
Prove that
𝑛! 𝑝 𝑛 ≡ (−1) 𝑝), where p is a prime number
4.a) BTL-1 Remembering
and n any positive integer
t
Let 𝑝 be a prime and 𝑒 any positive integer then prove that
ne
5. b)
∅(𝑝𝑒) = 𝑝𝑒 − 𝑝𝑒−1 hence find ∅ (6125) BTL-4 Analyzing
.
Evaluate 𝜏 (𝑛)𝑎𝑛𝑑 𝜎 (𝑛) for each
6.b)
pz
𝑛 = 43, 1560,44982 𝑎𝑛𝑑 496 BTL-5 Evaluating
10. a) State and prove fundamental theorem for multiplicative function BTL-1 Remembering
w
BTL-4 Analyzing
𝑝1 𝑒1 +1 −1 𝑝2 𝑒2 +1 −1 𝑝𝑘 𝑒1 +1 −1
𝜎(𝑛) = 𝑝1 −1
. ,…., . Also
𝑝1 −1 𝑝1 −1
compute 𝜏(6120) 𝑎𝑛𝑑 𝜎 (6120).
w
www.padeepz.net
www.padeepz.net
12. a) Let 𝑛 be a positive integer then Prove that ∑𝑑 ∅(𝑑) = 𝑛
𝑛 BTL-3 Applying
Show that the Tau and Sigma functions are multiplicative
12. b)
function. Also compute 𝜏(36) 𝑎𝑛𝑑 𝜎 (36) BTL-4 Analyzing
t
𝑝1 𝑝2 𝑝𝑘
∅(666) 𝑎𝑛𝑑 ∅(1976)
ne
Let 𝑝1 , 𝑝2 , … , 𝑝𝑘 be any distinct primes, a any positive integer
13. b) and 𝑙 = [𝑝1 − 1, 𝑝2 − 1, … , 𝑝𝑘 − 1] Then prove that
BTL-3 Applying
𝑙+1
𝑎 ≡ 𝑎 (𝑚𝑜𝑑𝑝1 , 𝑝2 , … , 𝑝𝑘 )
.
If f is a multiplicative function. Then show that
pz
14. a) BTL-4 Analyzing
𝐹(𝑛) = ∑𝑑 𝐹(𝑑) is also multiplicative.
Let 𝑝 be a prime and 𝑎 is any integer such that 𝑝 ∤ 𝑎 then prove
14. b) that the least residues of the integers
BTL-3 Applying
𝑎, 2𝑎, 3𝑎, … , (𝑝 − 1)𝑎 𝑚𝑜𝑑𝑢𝑙𝑜 𝑝 are permutation of integers
ee
1,2,3, … , 𝑝 − 1.
*************************************************************************************
ad
.p
w
w
w
www.padeepz.net