Mahamad adil ahmed

Group: B
Please answer these questions
1- find the greatest common divisor of 4147 and 10672: 29
2- apply Euclid’s algorithm for computing gcd(155, −275): (-275 shouldn’t be
negative) and gcd is=5 if -275 is positive
3- find all solutions to 9x ≡ 12 mod 15:we have 3 solutions and they are: 3
(mod 15) , 8 (mod 15) , 13 (mod 15)
4- Find all solutions to 7x ≡ 1 mod 31:there are no solution (the only solution
is 1/7 and it’s not integer)
5- compute gcd(2261; 1275):17
6- Prove that “Every natural number is a product of primes”: the proof: let’s
assume that (n) is a natural number, by the fundamental theorem of
arithmetic , n is either prime or composite , if n was prime then it’s fixed and
the product of primes of n will just be itself multiplied by 1 , if n is composite
then n=ab , b will be further more be simplified to prime numbers therefore,
Every natural number is a product of primes.
7- Factor these numbers 2007, 765, 588:
2007: 3^2 x 223^1
765: 3^2 x 5^1 x 17^1
588: 2^2 x 3^1 x 7^2
8. Evaluate the expression 6359 mod 320: 279
9. According to congruence relation, find the remainder of 56 mod 24. 6 : 6.8
10 . Determine the value of x, where y = 7, e = 12 and n = 566 using modular
exponentiation method(x ≡ ye (mod n)): x=581
11-If the multiplicative inverse of “53 modulo 21” exists, then which of the
following is true?
a) GCD(53,21) = 1
b) GCD(53,21) = 29
c) GCD(53,21) = 53
d) GCD(53,21) = 12
12 The least common multiple of 41.42 and 42.41 is ____________
a) 42
b) 41
c) 84
d) 41.42
13-The binary number 100110 in octal is reprsented by
________46_______-.
14- using Fermat’ theorem find 15222 mod 11 : 5
15- Find the remainder when is divided 3111 by 7: 6