Scribd
Upload
34 views

EE720: Problem Set 2.2: Euclidean Division, Groups, CRT, Fermat and Euler Theorems

This document provides problems related to number theory concepts including: 1) Euclidean division and properties of sums of digits modulo 9 2) Integer factorization and modular arithmetic 3) Solving congruences and finding solutions to linear equations modulo integers 4) Finding orders and primitive elements in cyclic groups such as Z*_p

Uploaded by

Paras Bodke
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
34 views

EE720: Problem Set 2.2: Euclidean Division, Groups, CRT, Fermat and Euler Theorems

This document provides problems related to number theory concepts including: 1) Euclidean division and properties of sums of digits modulo 9 2) Integer factorization and modular arithmetic 3) Solving congruences and finding solutions to linear equations modulo integers 4) Finding orders and primitive elements in cyclic groups such as Z*_p

Uploaded by

Paras Bodke
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

EE720: Problem Set 2.

2: Euclidean division, groups, CRT,


Fermat and Euler theorems

February 2, 2017

Solve the problems using SAGE or Maple or using calculators. SAGE can be used directly
on the net at cloud.sagenb.org after registering yourself. Similarly Maple is available on
your LDAP Id.

1. Show that a decimal number a1 a2 . . . an = (a1 + a2 + . . . + an ) mod 9. For example


738864 = (7 + 3 + 8 + 8 + 8 + 6 + 4) mod 9. Using this solve the following without
using a calculator

(a) Show that 123456789123456789 + 234567891234567891 6= 358025680358025680


(b) Show that

123456789123456789 × 234567891234567891 6=
28958998683279996179682996625361999

2. Using only calculator with no more than 12 digit display find the exact integer product

4444555566669 × 1111222233338

3. Solve without calculator. Show that 39|53103 + 10353 , 7|111333 + 333111 . (Appeared
in IB 12th class exam).

4. Show that 7|52n + 3 × 25n−2 , 13|3n+2 + 42n+1 , 27|25n+1 + 5n+2 , 17|11104 + 1 without
using calculators. (Appeared in IB 12th class exam).

5. Find ( 100 5
P
j=1 j ) mod 4.

6. For m = 67862310031 find x = 2−1 mod m. If n = 1 mod b, what integer between


1 and n − 1 equals b−1 mod n?

7. If g is an integer such that g a = 1 mod m and g b = 1 mod m then show that


g gcd(a,b) = 1 mod m.

8. Problems on p-adic expansion. Denote by (a0 , a1 , . . . , am−1 )p the positive integer


m−1
X
a= ai p i
i=0

1
Carry out by high school method 1) (101101)2 × (1110011)2 , 2) (50AB89F )16 ×
(879CD)16 , 3) (4400327)8 ÷ (5763)8 , 4) Write last two digits of 11-adic expansion
of the decimal number 87900547, 5) write the number (3402133)5 as an octal number.

9. Find whether following equations are solvable and find all solutions when they exist.
Give reasons if they dont exit.

(a) 122X = 1 mod 343.


(b) (227 − 1)X = 73 mod 221 − 1.
(c) (193707721)X = 1 mod 761838257287.

10. Solve the linear equation aX + bY = c for given a, b, c. Find the solution X which is
the smallest positive integer.

(a) a = 765355768, b = 76354890023, c = 863429


(b) a = 2100 − 1, b = 2102 − 1, c = 6442450941
(c) a = 3014774729910783238001, b = 15733624667337520130581. Find at least
three integers c for each of which there are solutions. Find these solutions.

11. Solve the following simultaneous congruances or explain why there is no solution.

(a) X = 37 mod 43, X = 22 mod 49, X = 18 mod 71.


(b) X = 3 mod 299593, X = 2 mod 19173961, (54525951)X = 2 mod (222 − 1).
(c) X = 133 mod 451, X = 237 mod 697.

12. Find the order of a in Z∗n for given a, n.

(a) a = 5, n = 2202 − 1.
(b) a = 5342, n = 2200 − 1.
(c) a = 2222574487, n = 7.

13. Given prime factorization n = 413 × 1013 × 2512 find 372549625 mod n using the CRT.

14. Use CRT to find 2477 mod 1000, 11507 mod 1237.

15. If p is prime what are orders of all subgroups of Z∗p ? Find a primitive element of Z∗p
for the prime number p = 87449423397425857942678833145441 by trial and error and
then using factorization of p − 1. Find generators of all cyclic subgroups of all orders
of Z∗p .

16. Show that if n = pq for primes p, q and d = gcd(p − 1, q − 1) then for any a coprime
to n, aφ(n)/d = 1 mod n.

You might also like