Linear Combination - Number Theory - Exam, Exams of Number Theory

This is the Exam of Number Theory which includes Residues Modulo, Nonnegative Integers, Positive Integers, Elements, Prime Divisor, Exist Infinitely, Integer Solution, Congruence etc. Key important points are: Linear Combination, Euclidean Algorithm, Compute, Integer, Divisibility, Missing Digit, Divisible, Linear Diophantine Equations, General Solution, Least Residue

Typology: Exams

2012/2013

Uploaded on 02/18/2013

samudrai
samudrai 🇮🇳

4.6

(9)

76 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
pg score/32
Name:
MATH 506 Number Theory Exam I
Wednesday February 15, 2012
Check that that you have all three pages - note that page two is on the back of page one
1. (16 points) (a) Use the Euclidean algorithm to compute gcd(4331,1342) = .
(b) Compute lcm(4331,1342) = .
(c) Write gcd(4331,1342) as a linear combination of 4331 and 1342.
2. (8 points) Show that n6+ 6
7is an integer for all integers n6≡ 0 mod 7.
3. (8 points) Use the definition of divisibility to prove that if a|band b|cthen a2|(b2+ 3bc).
1
pf3

Partial preview of the text

Download Linear Combination - Number Theory - Exam and more Exams Number Theory in PDF only on Docsity!

pg score/

Name:

MATH 506 Number Theory – Exam I

Wednesday February 15, 2012 Check that that you have all three pages - note that page two is on the back of page one

  1. (16 points) (a) Use the Euclidean algorithm to compute gcd(4331, 1342) =.

(b) Compute lcm(4331, 1342) =. (c) Write gcd(4331, 1342) as a linear combination of 4331 and 1342.

  1. (8 points) Show that n

7 is an integer for all integers^ n^6 ≡^ 0 mod 7.

  1. (8 points) Use the definition of divisibility to prove that if a | b and b | c then a^2 | (b^2 + 3bc).

pg score/

  1. (16 points) The following number has a missing digit x. n = 136000045x 0004142772.

(a) If 2k||n then k =.

(b) If n is divisible by 9 then x =.

(c) If instead n has remainder 5 when divided by 11 then x =.

  1. (12 points) Decide whether the following linear Diophantine equations have any solutions. If so give the general solution, if not say why there are no solutions. There is no need to go through the Euclidean algorithm to find obvious gcds or solutions. (a) 42x − 30 y = 77, x, y ∈ Z. (b) 42x + 30y = 24, x, y ∈ Z.
  2. (7 points) The least residue of 815^95 − 81795 modulo 8 is.