Modular Arithmetic

1
 Exercise - 1
Type 1:
Sr. no. Questions Answers
Type-A Evaluate the given Problem:
I) 27 (Mod 12) 03
II) 490 (Mod 31) 25
III) 324 (Mod 25) 24
IV) 6720(Mod 17) 05
V) 14641 (Mod 54) 07
VI) 6561 (Mod 100) 61
Type-B Evaluate the given Problem:
I) -41 (Mod 11) 03
II) -13 (Mod 5) 03
III) -115 (Mod 20) 05
IV) -1000(Mod 15) 05
V) -1000 (Mod 17) 03
Type-C Evaluate the given Problem:
I) 11 (Mod 15) 11
II) 17 (Mod 25) 17
III) 23 (Mod 30) 23
IV) 2 (Mod 5) 02
V) 3 (Mod 10) 03
Type-D Evaluate the given Problem:
I) -2 (Mod 5) 03
II) -8 (Mod 13) 05
III) -4 (Mod 17) 13
IV) -5 (Mod 20) 15
V) -13 (Mod 17) 04
Type-E Verify the given Congruence:
I) 53 ≡ 8 (mod 9) -
II) 54 ≡ 10 (mod 4) -
III) 17 ≡ -1 (mod 6) -
IV) 52 ≡ -13 (mod 5) -
V) -41 ≡ 14 (mod 11) -
Type-F Evaluate the Following
I) Find the least positive residue of Modulo 13
a)1001 b)-1000 0,1
II) Find the least positive residue of Modulo 17
a)115 b)-115 13,04

2
Type 2: Find ‘m’ for given congruence.
Sr no. Questions Answers
1. 223 ≡ 103 (mod m) 1,2,3,4,5,6,8,10,12,15,20,24,30,40,60,120
2. 1331 ≡ 0 (mod m) 1,11,121,1331
3. 61 ≡ 33 (mod m) 1,2,4,7,14,28
4. 171 ≡ 111 (mod m) 1,2,3,4,5,6,10,12,15,20,30,60
5. 1 ≡ 1000 (mod m) 1,3,9,27,37,111,333,999

Type 3:
1. If a = 11, b = 15 and m = 8 then verify commutative law and association law.
2. If a = 27, b = 23 and m = 11 then verify commutative law and association law.

Type 4: Find GCD using Euclidean Algorithm

Sr. no. Questions Answers
1. GCD (1575, 231) 21
2. GCD (90, 60) 30
3. GCD (138, 24) 6
4. GCD (718, 193) 1
5. GCD (143, 227) 1
6. GCD (306, 699) 3
7. GCD (674, 1565) 1
8. GCD (987, 1597) 1
9. GCD (3083, 2893) 1
10. GCD (1598, 987) 47
11. GCD (3255, 1785) 105
12. GCD (232, 136) 8
13. GCD (34, 55) 1
14. GCD (194, 669) 1
15. (-81, 15) 3
16. (-41, 5) 1
17. (-84, -24) 12
18.
( 306 , 786 ) 1

19.
( 1598
47 47 )
,
987 1

20.
( 112
16 16 )
,
144 1

Exercise-2:
3
Type 1:

Sr. no Question Answers

1. Find ‘X’ and ‘Y’ such that 1575X + 231Y = 21 X =5+11.t , Y=-34-75.t
2. Find ‘X’ and ‘Y’ such that 3857X +1819Y = 17 X=-36+107.t, Y=71-211.t
3. Find ‘X’ and ‘Y’ such that 333X + 707Y =1 X= -138 + 707t
Y= 65-333t
4. Find the integer ‘X’ & ‘Y’ such that 51X + 111Y = X=-26 + 74t, Y=12-34t
6
5. Find all solutions of the equation X=39+82t, Y=-29-61t
1769X + 2378Y=29
For integral values of ‘X’ and ‘Y’.
6. Find the GCD (1575, 231) using Euclid algorithm (1575)*(5)+(231)*(-34)=21
and express GCD as linear combination of given
number.
7. Find the GCD (3587, 1819) using Euclidean (3587) * (-36) + (1819) * (71) = 17
algorithm and express GCD as linear
combination of given number
8. Find the following GCD (a, b) as a sum of
multiple of ‘a’ and ‘b’.
I) (136,232) 8=(232)*(-7)+(136)*(12)
II) (187,221) 17=(-5)*(221)+(187)*(6)
III) (1565,674) 1=(1565)*(205)+(674)*(-476)
9. Find X and Y such that.
I) 24X+138Y=18 X=18+69t, Y=-3-12t
II) 252X+198Y=18 X=4+11t,Y=-5-14t
III) 53X+34Y=36 X=26+68t.,Y=-41-110t
IV) 4X+Y=44 X=11+t,Y=-4t

Type 2:
Sr. no. Questions Answers
1 Find the inverse of
I) 4(mod 9) 7
II) 27(mod 392) 363
2 Evaluate
I) Find 19-1 (mod 141) 52
II) Find 306-1 (mod 47) 2

4
 3 Find x such that
I) 19x ≡ 1 (mod 141) 52
II) 6x ≡ 1 (mod 9) Not exist
4 Solve the following congruence of ‘x’
I) 32x ≡ 1 (mod 17) 8
II) 17x ≡ 1 (mod 32) 17
III) 333x ≡ 1 (mod 77) 37
IV) 47x ≡ 1 (mod 34) 21

Type 3: Solve the following Linear Congruence:

Type-A
1 14x ≡ 7 (mod 28) Not exist
Type-B
1 3x ≡ 2 (mod 7) 3
2 3x ≡ 2 (mod 5) 4
3 11x ≡ 17 (mod 24) 19
4 63x ≡ 110 (mod 23) 20
5 333x ≡ 2 (mod 707) 431
6 128x ≡ 833 (mod 1001) 812
7 1001x ≡ 1212 (mod 4) 0
Type-C
1 6x ≡ 3 (mod 9) 2,5,8
2 9x ≡ 21 (mod 30) 9,19,29
3 14x ≡ 7 (mod 35) 3,8,13,18,23,28,33,38
4 39x ≡ 27 (mod 123) 7,48,89

Type 4:

Sr. No. Question Answer

Type-A
1. Find ‘x’ using Chinese remainder theorem
x ≡ 2 mod 3 X=23
x ≡ 3 mod 5
x ≡ 2 mod 7
2. Solve the congruence using Chinese remainder theorem
x ≡ 1 mod 5 X =206
5
 x ≡ 2 mod 6
x ≡ 3 mod 7
3. Solve the simultaneous congruence
x ≡ 1 mod 2 X = 53
x ≡ 2 mod 3
x ≡ 3 mod 5
x ≡ 4 mod 7
4. Solve the simultaneous congruence
x ≡ 4 mod 4 X=1100
x ≡ 5 mod 5
x ≡ 8 mod 7
x ≡ 2 mod 9
5. Find the solution of simultaneous congruence
x ≡ 2 mod 11 X = 150990
x ≡ 3 mod 12
x ≡ 4 mod 13
x ≡ 5 mod 17
x ≡ 6 mod 19

Type-B
1. Find the positive integers which leaves remainder 1 if X = 52
divided by 3 ; remainder 2 if divided by 5 and remainder 3 if
divided by 7
2. A gang of 17 thieves stole a sack of gold biscuits. When they 3930
tried to divide the loot into equal parts three biscuits
remained. There was fight among them to get that extra
biscuit in which one thief got killed. They tried to divide the
wealth into equal parts in which 10 biscuits remained. Again
one thief was killed in the fight among them. The wealth
now got distributed among the survivors, this time they
were successful in making equal distribution with no extra
biscuits. How many biscuits were there in the sack?
3. There are some eggs in a bucket. If they removed from it 119
picking two at a time one remains in the bucket. If they are
removed three at a time two remains in the bucket, if they
are removed 5 at a time 4 remains. No egg remains if we
remove them in a group of 7. What is the smallest no. of
eggs in the bucket?
Exercise-3:
6
 Type 1:
Sr. no Question Answer
41
1. Calculate 5 mod 9 2
2. Calculate 835 mod 11 10
3. Find the remainder when 7 divides 250 4
4. Find the remainder when 7 divides 4165 6
5. Prove that 89|244 - 1 -
6. Prove that 97|248 - 1 -
7. Prove that 39 divides 53103 + 10353 -

Type 2: [Fermat’s Little Theorem]

Questions Ans.
Type-A Using Fermat’s little theorem solve
I) 3100000 mod 53 28
II) 112054 mod 13 4
III) 2402 mod 11 4
IV) 350 mod 7 2
Type-B Evaluate the Following
I) Find the least positive residue of 21000000after dividing by 1
17.
II) Find the least positive residue of 31000000 modulo 13 3
III) Find the least positive residue of 3201 mod 11 3
Type-C Prove that
I) 7100000 ≡ 1 mod 11
II) 857 ≡ 3 mod 5
III) 31000 ≡ 4 mod 7
IV) 538 ≡ 4 mod 11
V) 111333 + 333111 is divisible by 7
Type-D Find the last digit of the base 7 expansion of 3100 using 4
Fermat’s theorem

Type 3: [Euler Totient Function]

Sr. no. Compute the given function. Answer
1 Φ (7) 6
2 Φ (13) 12
3 Φ (23) 22
4 Φ (17) 16
5 Φ (10) 4
7
 6 Φ (6) 2
7 Φ (35) 24
8 Φ (21) 12
9 Φ (8) 4
10 Φ (81) 54
11 Φ (100) 40
12 Φ (1000) 400
13 Φ (30) 8
14 Φ (60) 16
15 Φ (90) 24
16 Φ (1001) 720
17 Φ (390625) 312500

Type 4: Using Euler’s theorem compute

Sr. No Question Ans.

Type-A By Euler’s theorem compute

I) 71615 mod 31 25
II) 11100000 mod 54 43
III) 31000 mod 7 4
IV) If 71047 is divided by 31, what will be the remainder? 16
Type-B Find the last two digit in the decimal expression using Euler’s Theorem.
I) 3100 1
II) 7100 1
III) 11100 1
Type-C Find the last digit in the decimal expression of using Euler’s theorem.
I) 7100 1
II) 11100 1
Type-D Compute the given Congruence using Euler’s Theorem
I) 7x ≡ 2 ( mod 15) 11
II) 3x ≡ 5 ( mod 16) 7
III) 5x ≡ 3 ( mod 17) 4
IV) 9x ≡ 2 ( mod 11) 10
V) 7x ≡ 12 ( mod 17) 9
VI) 4x ≡ 11 ( mod 19) 17
VII) 5x ≡ 11 ( mod 23) 16
VIII) 11x ≡ 5 ( mod 7) 3

Exercise no-4
Type-1:

8
Sr. no. Question Answer
1. Generate prime numbers between 1 - 20 8
2. Generate prime numbers between 1 - 30 10

Type-2:
Check whether the given numbers are prime or composite numbers. If it is
composite number, then find its prime factor.

Sr. no. Question Answer

1. 509 Prime
2. 641 Prime
3. 40 2*2*2*5
4. 2093 7*13*23
5. 1037 17*61
6. 2737 7*17*23
7. 7293 3*11*13*17

Type 3:

Sr. no. Question Answer

1 If a=2 and m=7 then check whether ‘a’ is quadratic Yes
residue of m or not.
2 If a=10 and m=5 then check whether ‘10’ is quadratic Yes
residue of 5 or not.
3 If a=2 and m=5 then check whether ‘2’ is quadratic No
residue of 5 or not.
4 Test if 12, 8, 11 are quadratic residue of 13. Y,N,N

Type 4:

9
Sr. no. Question Answer

10
Type-A Find Legendre symbol value
I) a = 2, m = 5 -1
II) a = 29, m = 5 1
III) a = 4, m = 11 1
IV) a = 10, m = 5 0
Type-B Evaluate the given problems.
I)
( 27 ) 1

II)
( 132 ) -1

III)
( 117 ) -1

IV)
( 1113 ) -1

V)
( 133 ) 1

VI)
( 114 ) 1

VII)
( 134 ) 1

VIII)
( 139 ) 1

IX)
( 138 ) -1

X)
( 1013 ) 1

XI)
( 1213 ) 1

XII)
( 1272
43 )
1

11
 XIII)
( 3197 ) 1

XIV)
( 530
193 )
1

Type-C Prove the given Statements

I) Prove that 1272 is quadratic residue of 43. -

II) Prove that 319 is quadratic residue of 7. -

III) Prove that 530 is quadratic residue of 193. -

Type-D Using Jacobi symbol evaluate

I)
( 1115 ) -1

II)
( 1321 ) -1

III)
( 1135 ) 1

IV)
( 752 ) -1

V)
( 215 ) -1

Type-E Evaluate the following

I)
( 401
111 )
1

II)
( 2663
3299 )
-1

III)
( 109
385 )
-1

IV)
( 1099
631
) 1

12