Homework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn
|
|
- Prosper Watson
- 6 years ago
- Views:
Transcription
1 Homework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn Problem 1: 4.4 # 2:x 3 + 8x 2 x 1 0 (mod 1331). a) x 3 + 8x 2 x 1 0 (mod 11). This does not break down, so trial and error gives: x = 0 : f(0) = (mod 11). x = 1 : f(1) = 7 0 (mod 11). x = 2 : f(2) = = (mod 11). x = 3 : f(3) = = 7 0 (mod 11). x = 4 : f(4) = = 11 0 (mod 11). x = 5 : f(5) = = 0 0 (mod 11). x = 6 : f(6) = = (mod 11). x = 7 : f(7) = = (mod 11). x = 8 : f(8) = (mod 11). x = 9 : f(9) = = (mod 11). x = 10 : f(10) = (mod 11). Solutions to x 3 + 8x 2 x 1 0 (mod 11) are x 0 4, 5 (mod 11) b) x 3 + 8x 2 x 1 0 (mod 11). Note: f (x) = 3x x 1 x 0 4: f (4) = = (mod 11). Then, by part 1 of Hensel s Lemma, f (4) 1 1 (mod 11). Then t = (1) f(4) 11 = = 17 5 (mod 11). Then the solution to f(x) 0 (mod 121) is x 1 = = 59 (mod 121). x 0 5: f (5) = = (mod 11). Then f(5) = (mod 121), and so there are no solutions mod 121 from this case. (Part 3 of Hensel s Lemma.) c) x 3 + 8x 2 x 1 0 (mod 1331) x 59 (mod 121). Then f(59) = t = (1) = (mod 11). Then x 2 = = 1148 mod Problem 2: Since 144 = , we can use the Chinese remainder theorem and find simultaneous solutions modulo 24 and modulo 32, then the uniqueness of the Chinese remainder theorem will give solutions modulo 144. To solve each of these congruences, we use Hensel s lemma. First step: Find solutions modulo 3 2 : Step p = 3: As usual, we know that solutions modulo 3 2 are also solutions modulo 3. Hence considering the equation modulo 3, the polynomial becomes x 5 + x mod 3, since 6 is a multiple of 3. We see that plugging in 0 gives a solution, whereas plugging in 1 gives 2 and plugging in 2 gives 1 mod 3. Therefore, the only solution modulo 3 is 0. Step p 2 = 9: Now, we use Hensel s lemma to extend this solution. The derivative of the 1
2 original polynomial is 5x We see that plugging in 0 gives 1 0 mod 3. Therefore, we are in the first case of Hensel s lemma. In this case, the solution modulo 9 = 3 2 is given by 0 + t3 where t = f (0)(6/3) = 1(6/3) 2 mod 3, and f (0) is the inverse of f(0) mod 3. Thus, the solution modulo 9 is = 6. Second step: Find solutions modulo 2 4 : On the other hand, reducing this polynomial modulo 2, we get again x 5 + x mod 2, since 6 is divisible by 2. Step p = 2: By inspection we see that there are two solutions to the polynomial congruence modulo 2 namely x 0 0, 1 mod 2. Step p 2 = 4: We now want to extend these solutions modulo 4. Take the derivative 5x mod 2. Plugging in 0 gives 6 0 mod 2 and so the roots corresponding to 0 use the first case of Hensels lemma Plugging in 1 gives 6 0 mod 2. Moreover f(1) = 4 0 mod 4 so the roots corresponding to 1 use the second case of Hensels lemma. First extend x 0 0 mod 2, Hensels lemma implies that the solution modulo 4 is given by 0 + t.2 where tf (0) f(0) (1) 6 mod 2 3 mod 2 1 mod Therefore a solution modulo 4 is mod 2. Now extend x 0 = 1. We are in the second or third case of Hensel lemma and have that either 1 and 3 are roots mod 4 or neither of them are roots modulo 4. Plugging in 1 gives mod 4. Therefore we are in the second case of Hensel lemma and both 1 and 3 are roots modulo 4. Thus, the roots modulo 4 are 1, 2 and 3. Step p 3 = 8: We extend the solutions once more following the same procedure. Since 2 corresponds to the first case of Hensels lemma and plugging in 2 to the original equation gives = 28, Hensels lemma implies that the root of this modulo 8 is given by 2 + t4 where t 1 1(28/4) 1 mod 2. Therefore, Hensels lemma implies that = 6 is a solution modulo 8. For the other cases, we are in the second or third case of Hensels lemma so either 1 and 5 are solutions modulo 8 or neither of them are solutions modulo 8. Since we know that plugging in 1 gives 4 0 mod 8, it follows by the third case of Hensel s lemma that 1 is not a solution modulo 8. Finally, the second case of Hensels lemma implies that 3 and 7 are solutions modulo 8. Therefore, the solutions modulo 8 are 3, 6, 7. Step p 4 = 16: We now want to extend these solutions modulo 16 by applying Hensels lemma once again. We get following the same procedure that the solution modulo 16 are 3, 6 and 11. Now, we must combine these solutions using the Chinese remainder theorem to finish the problem. The first solution is given by x 6 mod 9 and x 3 mod 16. One finds that 51 solves this simultaneous system. The second solution is given by x 6 mod 9 and x 6 mod 16. One finds that 6 solves this simultaneous system. Finally, the third solution is given by x 6 mod 9 and x 11 mod 16. One finds that 123 solves this simultaneous system. Therefore there are three solutions, 6, 51, 123. Notice that the problem asked only to find how many solutions exist, but this is a nice example of the use of Hensel s lemma. 2
3 Problem 3: 1) We can set this problem up as a quadratic congruence. Let 2x + 1 and 2x + 3 be the two consecutive odd numbers. Then if there product is 11 more than a multiple of 83, we get (2x + 1)(2x + 3) 1 mod 83. Simplifying, we get 4x 2 + 8x 8 0 mod 83. But since 4 and 83 are relatively prime it is equivalent to x 2 + 2x 2 0 mod 83 The roots in R are 1 ± 3 We hence need to find the square roots of 3 modulo 83. By squaring every number from 0 to 82 (in fact we only need to go half-way), and reducing modulo 83, we can see that 13 mod 83 and 70 mod 83 are the square roots. (Note that mod 83, so we could write these as ±13 mod 83, which is why we actually only need to plug in the numbers 0 to 41). And x 12, 69 mod 83, which correspond to the two pairs of consecutive numbers 25, 27 and 139, 141 modulo 83. 2) 4.4 #4 x 2 + x (mod 81 = 3 4 ). x 2 + x (mod 3) x = 0 f(0) = (mod 3) x = 1 f(1) = 36 0 (mod 3) x = 2 f(2) = (mod 3) x 2 + x (mod 3 2 ). f (x) = 2x+1. f (1) = 3 0 mod (3). But f(1) = 36 0 (mod 81), so there are no solutions to this or the higher order problems, by part 3 of Hensel s Lemma. Problem 4 Proof by Induction: Base Case: j = 1. Then we have that f(x) 0 (mod p) has one solution mod p, namely a 1. Then we have that f(a 1 ) 0 (mod p), or, by the definition of modulus, that p f(a 1 ). By the definition of divides, there is an integer n such that f(a 1 ) pn = 0. Then, for all x, define g(x) = f(x) pn. Because pn is an integer, we have that g(x) is a polynomial. We also have that pn = f(x) g(x), or, by the definition of divides, p (f(x) g(x)), and by the definition of modulus, f(x) g(x) (mod p). Then, we note that g(a 1 ) = f(a 1 ) pn = 0, so a 1 is a zero of g(x). Then, by some basic theorems of algebra, there must exist some polynomial q(x) (not necessarily with integer coefficients) such that g(x) = q(x)(x a 1 ). Then we simply notice that f(x) g(x) = (x a 1 )q(x), and so we have shown that such a q(x) exists. Inductive Step: Note: We assume that p is prime. Inductive Hypothesis: For any f(x) 0 (mod p), with solutions a 1, a 2,..., a j 1, there exists a polynomial q(x) such that f(x) (x a 1 )(x a 2 ) (x a j 1 )q(x) (mod p). For the inductive step, we have that f(x) 0 (mod p) has solutions a 1, a 2,..., a j 1, a j. I am assuming that 0 a i < p, because there is an equivalent solution (mod p) that is in this range, the least non-negative residue, by previous theorems, and we would simply use that solution instead. By the inductive hypothesis, we have that for some polynomial q 1 (x), we have that f(x) (x a 1 )(x a 2 ) (x a j 1 )q 1 (x) (mod p). Then we know that by the definitions of modulus 3
4 and divides, using x = a j, there is an integer n such that (a j a 1 )(a j a 2 ) (a j a j 1 )q 1 (a j ) = pn. Then we note that each of (a j a 1 ), (a j a 2 ),..., (a j a j 1 ) is an integer by the closure of the integers under subtraction, and thus, their product is an integer by the closure of the integers under multiplication. Then let this integer be b = (a j a 1 )(a j a 2 ) (a j a j 1 ), and we have that bq 1 (a j ) = pn. Since we have that each of 0 a 1, a 2,..., a j 1, a j < p, we have that p > a j a 1, a j a 2,..., a j a j 1 < p. Then because p is prime, by earlier theorems, we know that, unless a j a i = ±1, then it is not a factor of p, and so we have that no factors of b divide p, and so by previous theorems, b n. Then there is an integer m such that n = bm by the definition of divides. Then b q 1 (a j ) = pbm, so q(a j ) = pm, so p q 1 (a j ) by the definition of divides, and by the definition of modulus, q 1 (a j ) 0 (mod p). Then allow g(x) = q 1 (x) pm, and note that pm = q(x) g(x), and so by the definition of divides, p (q 1 (x) g(x)), so by the definition of modulus, q 1 (x) g(x) (mod p). Then also note that g(a j ) = q 1 (a j ) pm = 0, and so a j is a zero of g(x). Then by basic theorems of algebra, there is some polynomial q 2 (x) (Not necessarily with integer coefficients), such that g(x) = q 2 (x)(x a j ). Then, since q 1 (x) g(x) = (x a j )q 2 (x) (mod p), and so by congruences, we have that f(x) (x a 1 )(x a 2 ) (x a j 1 )q 1 (x) (x a 1 )(x a 2 ) (x a j 1 )g(x) = (x a 1 )(x a 2 ) (x a j 1 )(x a j )q 2 (x) (mod p), as desired. Thus, the inductive step is complete, and the proof by induction is complete. Problem 5: We use induction over n. Induction basis: For n = 1 we consider f(x) = c 0 + c 1 x 0 mod p, where p does not divide c 1. Then c 1 x c 0 mod p. Since p does not divide c 1, gcd(c 1, p) = 1. Hence from what we now about linear congruences, there exists a unique solution x 0 modulo p to the equation c 1 x c 0 mod p, and hence a unique solution to the polynomial congruence, which proves the case n = 1. Induction hypothesis: Assume that n > 1, and every polynomial g(x) = b 0 + b 1 x +... b n x n, where p does not divide b n and g(x) 0 mod p has at most n incongruent solutions modulo p. Induction step: Let f(x) = a 0 + a 1 x +... a n+1 x n+1, such that p does not divide a n+1. There are two possibilities: either the equation f(x) 0 mod p has no solution, then the number of solutions is 0 < n and there is nothing to check, or there is at least one solution. In that case we need to check that there are not more than n solutions. Let x 0 be a solution of f(x) 0 mod p. Then a 0 + a 1 x a n+1 x n mod p, and we can factor out a factor (x x 0 ), i.e. there exists a polynomial g(x) = b 0 +b 1 x+... b n x n of degree n such that f(x) = (x x 0 )g(x) mod p = b 0 x + b 1 x b n x n+1 (b 0 x 0 + b 1 x 0 x +... b n x 0 x n ) mod p. Clearly, comparing coefficients of the same power, a n+1 = b n, and consequently p does not divide b n. Hence by induction hypothesis, we have that g(x) 0 mod p has at most n solutions modulo p. Together with x 0, f(x) 0 mod p has then at most n + 1 incongruent solutions modulo p. 4
5 Problem 6 Part 1: Part 2: a) gcd(a, b, c) = 1 ax + by + cz = 1 for some integers x, y, z by Bézout s theorem, and we have that a 2 +b 2 = c 2. Then ax+by = 1 cz, or cz = 1 ax by. Squaring one of these gives(ax + by) 2 = (1 cz) 2 = a 2 x 2 + 2axby + b 2 y 2 = 1 2cz c 2 z 2 = 1 2cz a 2 z 2 b 2 z 2. Then a 2 x 2 + a 2 z 2 + b 2 y 2 + b 2 z 2 + 2axby + 2cz = 1 = a(a(x 2 + z 2 ) + 2xby) + b(b(x 2 + z 2 )) + 2(1 ax by) = a(a(x 2 + y 2 ) + 2xby 2x) + b(b(x 2 + z 2 ) 2y) + 2 = 1 a(a(x 2 + y 2 ) + 2xby 2x) + b(b(x 2 + z 2 ) 2y) = 1 a( a(x 2 + y 2 ) 2xby + 2x) + b( b(x 2 + z 2 ) + 2y) = 1. Thus, we have that a((x 2 + y 2 ) 2xby + 2x and b(x 2 + z 2 ) + 2y are integers by the closure of the integers under multiplication and addition. Thus, we have a linear combination of a and b that equals 1, so by Bézout s theorem, and the fact that gcd can not be negative, gcd(a, b) = 1. Similarly, solving for b 2 = c 2 a 2, squaring ax+cz = 1 by, and making similar substitutions to the above leads to a( a(y 2 +x 2 ) 2xcz +2x)+ c(c(y 2 z 2 ) + 2z) = 1, and by the closure of the integers and Bèzout s theorem, gcd(a, c) = 1. And, finally, we can see that, with a 2 = c 2 b 2, and squaring by + cz = 1 ax, we have b(b(y 2 x 2 ) 2ycz + 2y) + c( c(y 2 + z 2 ) + 2z) = 1, so as above, gcd(b, c) = 1. Therefore, they are pairwise relatively prime. b) Because gcd(a, b) = 1, we have that gcd(a, b, c) =gcd(gcd(a, b), c) =gcd(1, c) = 1 by rules of the gcd. Thus, the numbers are mutually relatively prime, and so the statements in a) and b) are equivalent. a) Proof by contradiction: Notice that, when any integer a is even, it can be written as a = 2x for some integer x, and then a 2 = 4x 2 +4x+1 = 4(x 2 +x)+1 1 (mod 4) by the definitions of divides and modulus. If a is odd, it can be written as a = 2x+1 for some integer x, not necessarily the same. Then, a 2 = 4x 2 0(mod 4), by the definitions of divides and modulus. Thus, we can conclude that the square of any odd integer must be 1 (mod 4), and the square of any even integer must be 0 (mod 4), and that it is impossible for them to be equivalent to anything else (mod 4). Then, in the context of this problem, a and b can not both be even, because then gcd(a, b) 2 by the definition of gcd and the fact that they share a factor of 2, and as shown in part 1, since gcd(a, b, c) = 1 and pairwise mutual primality are equivalent, and a and b are not pairwise mutually prime, then gcd(a, b, c) 1, which is a contradiction. Therefore, at least one of a and b must be odd. If both are odd, however, then, as noted above, c 2 = a 2 + b = 2 (mod 4), but it is impossible for a perfect square to be equivalent to 2 (mod 4), which is again a contradiction. Thus, since it is impossible for both a and b to be even or odd, it must be the case that one of a and b is even, and the other is odd. Also, note that this means that c 2 = a 2 + b = 1 (mod 4), and so c must be odd, since only odd numbers squared are 1 (mod 4). b) If b is even, then a is odd. Also, if b is even, then there is an integer n such that b = 2n by the definition of even. Then we have that b 2 = 4n 2 = c 2 a 2 = (c+a)(c a). Since both c and a are odd, we have that c+a and c a are even, by previously shown facts (odd+odd=even, odd-odd=even), and so there are integers x and y such that c + a = 2x and c a = 2y. Then 4n 2 = 2x 2y = 4xy. Then, n 2 = xy. Also, note that c + a + c a = 2c = 2x + 2y c = x + y, and c + a (c a) = 2a = 2x 2y a = x y. If both x and y shared a 5
6 common factor z, then x = pz and y = qz for some integers p and q. But then c = pz +qz = z(p+q) and a = pz qz = z(p q), and so be the definition of divides, with p + q and p q in the integers by closure under addition, we have that z a and z b. Since gcd(a, c) = 1 by part 1, we have that z = 1. In essence, this means that x and y have no common factors. Then, since xy = n 2, both x and y must be perfect squares with no common factors as well, by previous results. Then there are integers k and l such that x = k 2 and y = l 2. So, we have that, by the statement two sentences ago, k and l have no common factors, meaning gcd(k, l) = 1, so they can not both be even. Then we have that a = x y = k 2 l 2, c = x + y = k 2 + l 2, k4 + 2k 2 l 2 + l 4 k 4 + 2k 2 l 2 l 4 = 4k 2 l 2 = 2kl and then b = c 2 a 2 = (because b is positive). Here, note that if both k and l were odd, k = 2f + 1 and l = 2g + 1 for some integers f and g, we would have that c = k 2 + l 2 = 4g 2 + 4g + 4f 2 + 4f + 2 = 2(2g 2 + 2g + 2f 2 + 2f + 1) would be even, which is a contradiction to the note at the end of step a), so that it impossible. Therefore, only one of k and l can be odd, and the other must be even, meaning that k l is odd, and so k l 1 (mod 2), or k l (mod 2). Also, note that k > l, or else a = k 2 l 2 would be negative, which is impossible. Note also that l 0, because this would made b = 2kl = 0, which is impossible. In summary, we have shown that for any primitive Pythagorean triple, there exists a k and l such that k > l > 0, gcd(k, l) = 1, and k l (mod 2), and a = k 2 l 2, b = 2kl, and c = k 2 + l 2. c) If a = k 2 l 2, b = 2kl, and c = k 2 + l 2, then a 2 + b 2 = k 4 2k 2 l 2 + l 4 + 4k 2 l 2 = k 4 + 2k 2 l 2 + l 4 = (k 2 + l 2 ) 2 = c 2. Proof by contradiction that (a, b, c) = 1. Assume that there is an integer d 2 such that gcd(a, b, c) = d. We know that d 2, because this would make a, b, and c even, and because one of k and l is odd and the other even (k l (mod 2)), we that c = k 2 + l 2 must be even 2 +odd 2 =even+odd=odd, making a contradiction. Then we have that d a and d c by the definition of gcd, so d a + c and d a c by earlier results. Then d 2k 2 and d 2l 2. Since d > 2, d must have a prime factor p such that p k 2 and p l 2. But then p k and p l, which contradicts the fact that gcd(p, l) = 1, and so no such p, and therefore, no such d, can exist. Thus it must be the case that gcd(a, b, c) = 1, and all conditions are satisfied and we have a primitive pythagorean triple. Part 3: Triples: k = 2, l = 1: (a, b, c) = (3, 4, 5) k = 3, l = 2: (a, b, c) = (5, 12, 13) k = 4, l = 3: (a, b, c) = (7, 24, 25) k = 5, l = 4: (a, b, c) = (9, 40, 41) Problem 7 Part 1: Proof: ( ) Let f(x) 0 (mod p) have n solutions. We know that n p because there are a maximum of p solutions to any congruence (mod p) (0, 1,..., p 1). Divide x p x by f(x) using Euclidean division to get x p x = f(x)q(x) + r(x), and we 6
7 have that deg(r) < deg(f) = n. If a is a root of f(x) (mod p), then we have that a p a = f(a)q(a) + r(a) 0q(a) + r(a) r(a) (mod p), so a is a solution to r(x) 0 (mod p). Then for each solution to f(x) 0 (mod p), there is a distinct solution to r(x) 0 (mod p), so there are n distinct such solutions. However, since deg(r) < n, we have that r(x) 0 (mod p). This is the case because if the leading coefficient r m is not divisible by p, we have that by problem 5 there are at most deg r solutions. But this is not the case, so it must be true that p r m, or by the definition of modulus, r m 0 (mod p). Then, for the the highest term, we have that r m x m 0x m = 0 (mod p), and so we can essentially discard our highest term, then move on to the next and apply the same reasoning. Applying this logic recursively (or inductively), we get that r(x) 0 (mod p) (Note: I just showed that if deg r(x) < n has n solutions (mod p), then r(x) 0 (mod p), or essentially that a polynomial of degree n can have at most n (mod p) roots. I ll use this fact in the next part as well.). Then we have that b(x) = f(x)q(x)+r(x) f(x)q(x) + 0 = f(x)q(x) (mod p). This meets the definition of divisors (mod p), so we have that if we have n solutions to f(x) 0 (mod p), then f(x) divides b(x) = x p x (mod p). ( ) By Fermat s little theorem (proved a few weeks ago in the homework), x p x (mod p), or in our case, x p x 0 (mod p). We have that f(x) (x p x) (mod p), so by the definition of divisors, there is a polynomial q(x) such that f(x)q(x) x p x 0 (mod p). Note that deg(f(x)) = n and thus deg(q(x)) = p n. I know from my aside in the previous part that this means that q(x) can have at most p n solutions, and f(x) can have at most n solutions, but since f(x)q(x) has p = n + p n solutions, we can see that we must have the maximum number of solutions for both q(x) and f(x), namely p n and n. We have just shown that f(x) has n solutions (mod p). Part 2: The previous proposition says that it is true if x n 1 it divides x n x. Now we have Multiply both sides by x: (x n 1)(1 + x n + (x n ) (x n ) k 1 = x nk 1. x(x n 1)(1 + x n + (x n ) (x n ) k 1 = x nk+1 x. We want the right side to be x n x, so just take nk +1 = p. Of course it is only possible if n divides p 1. Hence, if n p 1, then the polynomial x n 1 has exactly n roots modulo p. 7
M381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
More informationCOMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635
COMP239: Mathematics for Computer Science II Prof. Chadi Assi assi@ciise.concordia.ca EV7.635 The Euclidean Algorithm The Euclidean Algorithm Finding the GCD of two numbers using prime factorization is
More informationMATH 115, SUMMER 2012 LECTURE 12
MATH 115, SUMMER 2012 LECTURE 12 JAMES MCIVOR - last time - we used hensel s lemma to go from roots of polynomial equations mod p to roots mod p 2, mod p 3, etc. - from there we can use CRT to construct
More informationNumber Theory Proof Portfolio
Number Theory Proof Portfolio Jordan Rock May 12, 2015 This portfolio is a collection of Number Theory proofs and problems done by Jordan Rock in the Spring of 2014. The problems are organized first by
More informationPolynomials. Chapter 4
Chapter 4 Polynomials In this Chapter we shall see that everything we did with integers in the last Chapter we can also do with polynomials. Fix a field F (e.g. F = Q, R, C or Z/(p) for a prime p). Notation
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation
More informationProof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have
Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.
More informationNumber Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z:
Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some z Z Notation: b Fact: for all, b, c Z:, 1, and 0 0 = 0 b and b c = c b and c = (b + c) b and b = ±b 1
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationNotes on Primitive Roots Dan Klain
Notes on Primitive Roots Dan Klain last updated March 22, 2013 Comments and corrections are welcome These supplementary notes summarize the presentation on primitive roots given in class, which differed
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationElementary Number Theory MARUCO. Summer, 2018
Elementary Number Theory MARUCO Summer, 2018 Problem Set #0 axiom, theorem, proof, Z, N. Axioms Make a list of axioms for the integers. Does your list adequately describe them? Can you make this list as
More information1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n).
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More informationLecture 11 - Basic Number Theory.
Lecture 11 - Basic Number Theory. Boaz Barak October 20, 2005 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that a divides b,
More informationElementary Algebra Chinese Remainder Theorem Euclidean Algorithm
Elementary Algebra Chinese Remainder Theorem Euclidean Algorithm April 11, 2010 1 Algebra We start by discussing algebraic structures and their properties. This is presented in more depth than what we
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationChapter 5. Number Theory. 5.1 Base b representations
Chapter 5 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,
More informationElementary Number Theory Review. Franz Luef
Elementary Number Theory Review Principle of Induction Principle of Induction Suppose we have a sequence of mathematical statements P(1), P(2),... such that (a) P(1) is true. (b) If P(k) is true, then
More informationMath 547, Exam 2 Information.
Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:10-11:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/3-3/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationFurther linear algebra. Chapter II. Polynomials.
Further linear algebra. Chapter II. Polynomials. Andrei Yafaev 1 Definitions. In this chapter we consider a field k. Recall that examples of felds include Q, R, C, F p where p is prime. A polynomial is
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More information1 Overview and revision
MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction
More informationAn integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.
Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1
More informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
More informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More information1/30: Polynomials over Z/n.
1/30: Polynomials over Z/n. Last time to establish the existence of primitive roots we rely on the following key lemma: Lemma 6.1. Let s > 0 be an integer with s p 1, then we have #{α Z/pZ α s = 1} = s.
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationPolynomials. Henry Liu, 25 November 2004
Introduction Polynomials Henry Liu, 25 November 2004 henryliu@memphis.edu This brief set of notes contains some basic ideas and the most well-known theorems about polynomials. I have not gone into deep
More information2k n. k=0. 3x 2 7 (mod 11) 5 4x 1 (mod 9) 2 r r +1 = r (2 r )
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems take from the extra practice sets presented in random order. The challenge problems have not been included.
More informationChuck Garner, Ph.D. May 25, 2009 / Georgia ARML Practice
Some Chuck, Ph.D. Department of Mathematics Rockdale Magnet School for Science Technology May 25, 2009 / Georgia ARML Practice Outline 1 2 3 4 Outline 1 2 3 4 Warm-Up Problem Problem Find all positive
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationthat if a b (mod m) and c d (mod m), then ac bd (mod m) soyou aren't allowed to use this fact!) A5. (a) Show that a perfect square must leave a remain
PUTNAM PROBLEM SOLVING SEMINAR WEEK 2 The Rules. You are not allowed to try a problem that you already know how to solve. These are way too many problems to consider. Just pick a few problems in one of
More informationMATH 310: Homework 7
1 MATH 310: Homework 7 Due Thursday, 12/1 in class Reading: Davenport III.1, III.2, III.3, III.4, III.5 1. Show that x is a root of unity modulo m if and only if (x, m 1. (Hint: Use Euler s theorem and
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationPolynomial Rings. i=0
Polynomial Rings 4-15-2018 If R is a ring, the ring of polynomials in x with coefficients in R is denoted R[x]. It consists of all formal sums a i x i. Here a i = 0 for all but finitely many values of
More informationSimultaneous Linear, and Non-linear Congruences
Simultaneous Linear, and Non-linear Congruences CIS002-2 Computational Alegrba and Number Theory David Goodwin david.goodwin@perisic.com 09:00, Friday 18 th November 2011 Outline 1 Polynomials 2 Linear
More information4.4 Solving Congruences using Inverses
4.4 Solving Congruences using Inverses Solving linear congruences is analogous to solving linear equations in calculus. Our first goal is to solve the linear congruence ax b pmod mq for x. Unfortunately
More informationMath 180A - Notes. Neil Donaldson. March 14, 2018
Math 180A - Notes Neil Donaldson March 14, 018 1 Introduction & Notation Number Theory is primarily concerned with the properties of integers and with integer solutions to equations, so-called Diophantine
More informationFast Polynomial Multiplication
Fast Polynomial Multiplication Marc Moreno Maza CS 9652, October 4, 2017 Plan Primitive roots of unity The discrete Fourier transform Convolution of polynomials The fast Fourier transform Fast convolution
More information4 PRIMITIVE ROOTS Order and Primitive Roots The Index Existence of primitive roots for prime modulus...
PREFACE These notes have been prepared by Dr Mike Canfell (with minor changes and extensions by Dr Gerd Schmalz) for use by the external students in the unit PMTH 338 Number Theory. This booklet covers
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationPMA225 Practice Exam questions and solutions Victor P. Snaith
PMA225 Practice Exam questions and solutions 2005 Victor P. Snaith November 9, 2005 The duration of the PMA225 exam will be 2 HOURS. The rubric for the PMA225 exam will be: Answer any four questions. You
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More informationChapter 4 Finite Fields
Chapter 4 Finite Fields Introduction will now introduce finite fields of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public Key concern operations on numbers what constitutes a number
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-13 Recap Divisibility Prime Number Theorem Euclid s Lemma Fundamental Theorem of Arithmetic Euclidean Algorithm Basic Notions - Section
More informationA SURVEY OF PRIMALITY TESTS
A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationPolynomial Rings. (Last Updated: December 8, 2017)
Polynomial Rings (Last Updated: December 8, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from Chapters
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationMTH 346: The Chinese Remainder Theorem
MTH 346: The Chinese Remainder Theorem March 3, 2014 1 Introduction In this lab we are studying the Chinese Remainder Theorem. We are going to study how to solve two congruences, find what conditions are
More information11 Division Mod n, Linear Integer Equations, Random Numbers, The Fundamental Theorem of Arithmetic
11 Division Mod n, Linear Integer Equations, Random Numbers, The Fundamental Theorem of Arithmetic Bezout s Lemma Let's look at the values of 4x + 6y when x and y are integers. If x is -6 and y is 4 we
More informationCongruences and Residue Class Rings
Congruences and Residue Class Rings (Chapter 2 of J. A. Buchmann, Introduction to Cryptography, 2nd Ed., 2004) Shoichi Hirose Faculty of Engineering, University of Fukui S. Hirose (U. Fukui) Congruences
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationPolynomial Review Problems
Polynomial Review Problems 1. Find polynomial function formulas that could fit each of these graphs. Remember that you will need to determine the value of the leading coefficient. The point (0,-3) is on
More informationBasic Algorithms in Number Theory
Basic Algorithms in Number Theory Algorithmic Complexity... 1 Basic Algorithms in Number Theory Francesco Pappalardi #2 - Discrete Logs, Modular Square Roots, Polynomials, Hensel s Lemma & Chinese Remainder
More informationOlympiad Number Theory Through Challenging Problems
Olympiad Number Theory Justin Stevens Page 1 Olympiad Number Theory Through Challenging Problems Authors Justin Stevens Editor and L A TEX Manager David Altizio Dedicated to my sister. Justin Contents
More informationNumber Theory Homework.
Number Theory Homewor. 1. The Theorems of Fermat, Euler, and Wilson. 1.1. Fermat s Theorem. The following is a special case of a result we have seen earlier, but as it will come up several times in this
More informationSOLUTIONS Math 345 Homework 6 10/11/2017. Exercise 23. (a) Solve the following congruences: (i) x (mod 12) Answer. We have
Exercise 23. (a) Solve the following congruences: (i) x 101 7 (mod 12) Answer. We have φ(12) = #{1, 5, 7, 11}. Since gcd(7, 12) = 1, we must have gcd(x, 12) = 1. So 1 12 x φ(12) = x 4. Therefore 7 12 x
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a) Find the inverse of 178 in Z 365. Solution: We find s and t so that 178s + 365t = 1, and then 178 1 = s. The Euclidean Algorithm gives 365 = 178 + 9 178
More informationTwitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Simplify: a) 3x 2 5x 5 b) 5x3 y 2 15x 7 2) Factorise: a) x 2 2x 24 b) 3x 2 17x + 20 15x 2 y 3 3) Use long division to calculate:
More informationCS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II
CS 5319 Advanced Discrete Structure Lecture 9: Introduction to Number Theory II Divisibility Outline Greatest Common Divisor Fundamental Theorem of Arithmetic Modular Arithmetic Euler Phi Function RSA
More information2.3 In modular arithmetic, all arithmetic operations are performed modulo some integer.
CHAPTER 2 INTRODUCTION TO NUMBER THEORY ANSWERS TO QUESTIONS 2.1 A nonzero b is a divisor of a if a = mb for some m, where a, b, and m are integers. That is, b is a divisor of a if there is no remainder
More information1. Algebra 1.5. Polynomial Rings
1. ALGEBRA 19 1. Algebra 1.5. Polynomial Rings Lemma 1.5.1 Let R and S be rings with identity element. If R > 1 and S > 1, then R S contains zero divisors. Proof. The two elements (1, 0) and (0, 1) are
More informationHomework 10 M 373K by Mark Lindberg (mal4549)
Homework 10 M 373K by Mark Lindberg (mal4549) 1. Artin, Chapter 11, Exercise 1.1. Prove that 7 + 3 2 and 3 + 5 are algebraic numbers. To do this, we must provide a polynomial with integer coefficients
More informationPOLYNOMIALS. x + 1 x x 4 + x 3. x x 3 x 2. x x 2 + x. x + 1 x 1
POLYNOMIALS A polynomial in x is an expression of the form p(x) = a 0 + a 1 x + a x +. + a n x n Where a 0, a 1, a. a n are real numbers and n is a non-negative integer and a n 0. A polynomial having only
More informationMath 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,
MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write
More informationMATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology.
MATH 501 Discrete Mathematics Lecture 6: Number theory Prof. Dr. Slim Abdennadher, slim.abdennadher@guc.edu.eg German University Cairo, Department of Media Engineering and Technology 1 Number theory Number
More informationMath 109 HW 9 Solutions
Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we
More informationHOMEWORK 11 MATH 4753
HOMEWORK 11 MATH 4753 Recall that R = Z[x]/(x N 1) where N > 1. For p > 1 any modulus (not necessarily prime), R p = (Z/pZ)[x]/(x N 1). We do not assume p, q are prime below unless otherwise stated. Question
More informationCHAPTER 3. Congruences. Congruence: definitions and properties
CHAPTER 3 Congruences Part V of PJE Congruence: definitions and properties Definition. (PJE definition 19.1.1) Let m > 0 be an integer. Integers a and b are congruent modulo m if m divides a b. We write
More informationOur Number Theory Textbook
Our Number Theory Textbook Math 311: Fall 2015 December, 2015 Contents 1 Divisibility 2 M. Gonsalves, L. Lewis.......................... 2 1.1 Introduction.............................. 2 1.2 Glossary
More information1. Factorization Divisibility in Z.
8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that
More informationMATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS. Contents 1. Polynomial Functions 1 2. Rational Functions 6
MATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS PETE L. CLARK Contents 1. Polynomial Functions 1 2. Rational Functions 6 1. Polynomial Functions Using the basic operations of addition, subtraction,
More information4 Powers of an Element; Cyclic Groups
4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)
More information5: The Integers (An introduction to Number Theory)
c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset
More informationNumber theory lectures
Number theory lectures By Dr. Mohammed M. AL-Ashker Associated professor Mathematics Department E.mail:mashker @ mail.iugaza.edu Islamic University of Gaza P.O.Box 108, Gaza, Palestine 1 Contents 1 Divisibility
More informationMath1a Set 1 Solutions
Math1a Set 1 Solutions October 15, 2018 Problem 1. (a) For all x, y, z Z we have (i) x x since x x = 0 is a multiple of 7. (ii) If x y then there is a k Z such that x y = 7k. So, y x = (x y) = 7k is also
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More information4 Number Theory and Cryptography
4 Number Theory and Cryptography 4.1 Divisibility and Modular Arithmetic This section introduces the basics of number theory number theory is the part of mathematics involving integers and their properties.
More informationElementary Number Theory. Franz Luef
Elementary Number Theory Congruences Modular Arithmetic Congruence The notion of congruence allows one to treat remainders in a systematic manner. For each positive integer greater than 1 there is an arithmetic
More informationMath 2070BC Term 2 Weeks 1 13 Lecture Notes
Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 6 Unique Factorization Domains 1. Let R be a UFD. Let that a, b R be coprime elements (that is, gcd(a, b) R ) and c R. Suppose that a c and b c.
More informationExercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.
Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)
More informationAlgorithms (II) Yu Yu. Shanghai Jiaotong University
Algorithms (II) Yu Yu Shanghai Jiaotong University Chapter 1. Algorithms with Numbers Two seemingly similar problems Factoring: Given a number N, express it as a product of its prime factors. Primality:
More informationChapter 3 Basic Number Theory
Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of
More informationNotes for Math 345. Dan Singer Minnesota State University, Mankato. August 23, 2006
Notes for Math 345 Dan Singer Minnesota State University, Mankato August 23, 2006 Preliminaries 1. Read the To The Student section pp. xvi-xvii and the Thematic Table of Contents. 2. Read Appendix A: Logic
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationDiscrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University
Discrete Mathematics Logics and Proofs Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Resolution Theorem: p q p r (q r) p q p r q r p q r p q p p r q r T T T T F T
More information10 Problem 1. The following assertions may be true or false, depending on the choice of the integers a, b 0. a "
Math 4161 Dr. Franz Rothe December 9, 2013 13FALL\4161_fall13f.tex Name: Use the back pages for extra space Final 70 70 Problem 1. The following assertions may be true or false, depending on the choice
More informationHomework 3, solutions
Homework 3, solutions Problem 1. Read the proof of Proposition 1.22 (page 32) in the book. Using simialr method prove that there are infinitely many prime numbers of the form 3n 2. Solution. Note that
More informationInduction. Induction. Induction. Induction. Induction. Induction 2/22/2018
The principle of mathematical induction is a useful tool for proving that a certain predicate is true for all natural numbers. It cannot be used to discover theorems, but only to prove them. If we have
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More information