EXTRA CREDIT FOR MATH 39
|
|
- Shawn Hensley
- 5 years ago
- Views:
Transcription
1 EXTRA CREDIT FOR MATH 39 This is the second, theoretical, part of an extra credit homework. This homework in not compulsory. If you do it, you can get up to 6 points (3 points for each part) of extra credit on your average grade for the class, over 100. This presents the solution of the first part of the extra credit, and ask you to solve some questions to get the three more bonus points. The questions to be solved are in and Empirical study The first part is an empirical study of some number-theoretic properties. You will need to use a computer, and more precisely either a programming language (e.g, C, C++, Java, python, anything you like) or a mathematical software (mathematica, maple, magma, sage, etc.). Your work will be a little bit easier if you know or learn how to use a mathematical software. For the first part, you are authorized to work by pairs and to handle only one set of answers for every pair. The two members of a pair will get the same grade. If you need help, please tell me. You are required to join a printed listing of your program with your work First digit of big numbers. 1. Look up (on the internet or wherever you want) the population of the 50 states of the U.S. (or 51 including D.C). Count how many times those numbers begin by the digit 1, by the digit 2, and so on until the digit 9. Do the same for other variables: the area of the states (in square miles, or in square kilometers as you wish), their GDP. Then, for each of the series of digits you got, compute the proportion of 1 s, of 2 s, etc. In each series, which digit is the most frequent? Did you expect that? 2. With the help of a computer, compute the first digit of 2 n (in decimal writing) for n = 1 to n as large as you can. Compute the proportion of 1 s, of 2 s, etc in this sequence of digits. Do the same with 2 n replaced by 3 n, 5 n, 6 n. Can you make a conjecture? 1.2. Higher reciprocity law. 1. Let P (X) = X 3 2, Q(X) = X 7 1 and R(X) = X 3 + X 2 2X 1. For each of the 200 first prime numbers p, compute the number of roots of the polynomials P (X), Q(X), R(X) modulo p. For each of those polynomials, can you make conjectures on a. the proportion of primes for which the polynomial has a given number of roots modulo p? b. a simple rule on p that will predict how many roots the polynomial has modulo p? (but be aware that this might not be possible for all three polynomials) 1
2 2 EXTRA CREDIT FOR MATH Solutions and theoretical questions 2.1. First digit of big numbers Statements. I won t provide a solution to exercise 1, see: s_law For exercise 2, experiments with the sequence 2 n, 3 n, etc. show that many more of those numbers begin by a 1 (about 30%) than by a 9 (only about 5%), and in general, that the proportion of numbers in the sequence that begins by a given digit is decreasing with the digit. It might have been difficult, without knowing Benford s law, to guess what the proportion of numbers (in the sequence 2 n, or 3 n, or a n for any a which is not a power of 10) that begins by 1, 2,,... converge to, but the answer is P (1) = log 10 (2) log 10 (1) = log 10 (2), P (2) = log 10 (3) log 10 (2), and in general, P (d) = log 10 (d + 1) log 10 (d). The precise mathematical statement is: Theorem 1. Let a be a natural number that is not a power of 10. Let d be a digit (a number between 1 and 9). For N any integer, let b d (N) the number of integers a n with 0 n N that begins by the digit d. Then lim b d(n)/n = P (d). N Questions. 1. Begin by checking that P (1) + P (2) + + P (9) = 1, which is what we expect for proportions that have to add up to Show that the first digit of an integer M is M/10 log 10 M. 3. Show that the first digit d of a n is 10 n log 10 a n log 10 a. In particular, the digit d is determined by the number r = n log 10 a n log 10 a as follows: d = 1 if 0 r < log 10 2 d = 2 if log 10 2 r < log 10 3,... d = 9 if log 10 9 r < log = Show that log 10 a is an irrational number (under the assumption on a of Theorem 1). The equipartition theorem theorem states: Let 0 c d 1. Let x be an irrational number. For every N, let p(n) be the number of integers n, 0 n N, such that nx nx is between c an d (it doesn t matter is between is understood strictly, that is including c and d, or not). Then lim p(n)/n = d c. N 5. Using the equipartition theorem, prove Theorem Higher reciprocity law.
3 EXTRA CREDIT FOR MATH Solutions. Let us consider first the case of P (X) = X 3 2. If p is a prime, the number of possible incongruent roots for P (X) (mod p) is at most 3, as seen in class. Here is a program in Sage 1 that compute and print that for the prime up to 100. This is enough to make conjectures on question b, and more would be a waste of paper. In order to help solving question b, and to see if there is a rule that predicts in term of a congruences of p modulo some modulus the number of roots of P (X) mod p, the residue of p modulo various small modulus are also written. The program also compute the proportion of primes for which the polynomial P (X) has 0, 1, 2 or 3 roots. To make the answer appear more clearly, the programs compute this proportion for primes up to 100, then 2100, etc. print number of roots of X^3-2 mod p for n in range(10): max= *n l=list(primes(max)) result=[0,0,0,0]; for p in l: j=0; for x in range(p): if p.divides(x^3-2): j=j+1; result[j] = result[j]+1; if n==0: print p=,p, number of roots=,j, p mod 3,4,5,6,7=, p%3, p%4,p%5,p% r=sum(result); print print( For the primes up to,max) for i in range(4): print proportion of primes with,i, roots:,result[i]/r+0.0; number of roots of X^3-2 mod p p= 2 number of roots= 1 p mod 3,4,5,6,7= p= 3 number of roots= 1 p mod 3,4,5,6,7= p= 5 number of roots= 1 p mod 3,4,5,6,7= p= 7 number of roots= 0 p mod 3,4,5,6,7= p= 11 number of roots= 1 p mod 3,4,5,6,7= p= 13 number of roots= 0 p mod 3,4,5,6,7= p= 17 number of roots= 1 p mod 3,4,5,6,7= p= 19 number of roots= 0 p mod 3,4,5,6,7= p= 23 number of roots= 1 p mod 3,4,5,6,7= p= 29 number of roots= 1 p mod 3,4,5,6,7= Sage is free software of mathematical computations. You can use it online at The syntax is based on the language python
4 4 EXTRA CREDIT FOR MATH 39 p= 31 number of roots= 3 p mod 3,4,5,6,7= p= 37 number of roots= 0 p mod 3,4,5,6,7= p= 41 number of roots= 1 p mod 3,4,5,6,7= p= 43 number of roots= 3 p mod 3,4,5,6,7= p= 47 number of roots= 1 p mod 3,4,5,6,7= p= 53 number of roots= 1 p mod 3,4,5,6,7= p= 59 number of roots= 1 p mod 3,4,5,6,7= p= 61 number of roots= 0 p mod 3,4,5,6,7= p= 67 number of roots= 0 p mod 3,4,5,6,7= p= 71 number of roots= 1 p mod 3,4,5,6,7= p= 73 number of roots= 0 p mod 3,4,5,6,7= p= 79 number of roots= 0 p mod 3,4,5,6,7= p= 83 number of roots= 1 p mod 3,4,5,6,7= p= 89 number of roots= 1 p mod 3,4,5,6,7= p= 97 number of roots= 0 p mod 3,4,5,6,7= ( For the primes up to, 100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 2100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 4100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 6100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 8100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots:
5 EXTRA CREDIT FOR MATH 39 5 ( For the primes up to, 10100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 12100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 14100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 16100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 18100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: We know turn to the polynomial Q(X) = X 7 1. Here the program has to be slightly modified since X 7 1 may have up to 7 roots modulo p print number of roots of X^7-1 mod p for n in range(10): max= *n l=list(primes(max)) result=[0,0,0,0,0,0,0,0]; for p in l: j=0; for x in range(p): if p.divides(x^7-1): j=j+1; result[j] = result[j]+1; if n==0: print p=,p, number of roots=,j, p mod 7=, p%7; r=sum(result);
6 6 EXTRA CREDIT FOR MATH 39 print print( For the primes up to,max) for i in range(8): print proportion of primes with,i, roots:,result[i]/r+0.0; number of roots of X^7-1 mod p p= 2 number of roots= 1 p mod 7= 2 p= 3 number of roots= 1 p mod 7= 3 p= 5 number of roots= 1 p mod 7= 5 p= 7 number of roots= 1 p mod 7= 0 p= 11 number of roots= 1 p mod 7= 4 p= 13 number of roots= 1 p mod 7= 6 p= 17 number of roots= 1 p mod 7= 3 p= 19 number of roots= 1 p mod 7= 5 p= 23 number of roots= 1 p mod 7= 2 p= 29 number of roots= 7 p mod 7= 1 p= 31 number of roots= 1 p mod 7= 3 p= 37 number of roots= 1 p mod 7= 2 p= 41 number of roots= 1 p mod 7= 6 p= 43 number of roots= 7 p mod 7= 1 p= 47 number of roots= 1 p mod 7= 5 p= 53 number of roots= 1 p mod 7= 4 p= 59 number of roots= 1 p mod 7= 3 p= 61 number of roots= 1 p mod 7= 5 p= 67 number of roots= 1 p mod 7= 4 p= 71 number of roots= 7 p mod 7= 1 p= 73 number of roots= 1 p mod 7= 3 p= 79 number of roots= 1 p mod 7= 2 p= 83 number of roots= 1 p mod 7= 6 p= 89 number of roots= 1 p mod 7= 5 p= 97 number of roots= 1 p mod 7= 6 ( For the primes up to, 100) proportion of primes with 1 roots: proportion of primes with 7 roots: ( For the primes up to, 2100)
7 EXTRA CREDIT FOR MATH 39 7 proportion of primes with 1 roots: proportion of primes with 7 roots: ( For the primes up to, 4100) proportion of primes with 1 roots: proportion of primes with 7 roots: ( For the primes up to, 6100) proportion of primes with 1 roots: proportion of primes with 7 roots: ( For the primes up to, 8100) proportion of primes with 1 roots: proportion of primes with 7 roots: ( For the primes up to, 10100) proportion of primes with 1 roots:
8 8 EXTRA CREDIT FOR MATH 39 proportion of primes with 7 roots: ( For the primes up to, 12100) proportion of primes with 1 roots: proportion of primes with 7 roots: ( For the primes up to, 14100) proportion of primes with 1 roots: proportion of primes with 7 roots: ( For the primes up to, 16100) proportion of primes with 1 roots: proportion of primes with 7 roots: ( For the primes up to, 18100) proportion of primes with 1 roots: proportion of primes with 7 roots: Finally, here are the result for the polynomial R(X) (we omit the program which is similar to the above ones) number of roots of X^3+X^2-2X-1 mod p
9 p= 2 number of roots= 0 p mod 7= 2 p= 3 number of roots= 0 p mod 7= 3 p= 5 number of roots= 0 p mod 7= 5 p= 7 number of roots= 1 p mod 7= 0 p= 11 number of roots= 0 p mod 7= 4 p= 13 number of roots= 3 p mod 7= 6 p= 17 number of roots= 0 p mod 7= 3 p= 19 number of roots= 0 p mod 7= 5 p= 23 number of roots= 0 p mod 7= 2 p= 29 number of roots= 3 p mod 7= 1 p= 31 number of roots= 0 p mod 7= 3 p= 37 number of roots= 0 p mod 7= 2 p= 41 number of roots= 3 p mod 7= 6 p= 43 number of roots= 3 p mod 7= 1 p= 47 number of roots= 0 p mod 7= 5 p= 53 number of roots= 0 p mod 7= 4 p= 59 number of roots= 0 p mod 7= 3 p= 61 number of roots= 0 p mod 7= 5 p= 67 number of roots= 0 p mod 7= 4 p= 71 number of roots= 3 p mod 7= 1 p= 73 number of roots= 0 p mod 7= 3 p= 79 number of roots= 0 p mod 7= 2 p= 83 number of roots= 3 p mod 7= 6 p= 89 number of roots= 0 p mod 7= 5 p= 97 number of roots= 3 p mod 7= 6 EXTRA CREDIT FOR MATH 39 9 ( For the primes up to, 100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 2100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 4100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 6100) proportion of primes with 0 roots:
10 10 EXTRA CREDIT FOR MATH 39 proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 8100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 10100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 12100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 14100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 16100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: ( For the primes up to, 18100) proportion of primes with 0 roots: proportion of primes with 1 roots: proportion of primes with 3 roots: Observations. Here we study the data given above, looking for some patterns, and we record what we find, as unproved statements (that may be false until proof that they are correct) We begin by some easy observations: (i) The number of roots of P (X) (mod p) can be 0, 1 or 3 but never 2. (ii) The number of roots of Q(X) (mod p) can only be 1 and 7, but never 0, or between 2 and 6.
11 EXTRA CREDIT FOR MATH (iii) The number of roots of R(X) (mod p) can only be 0 or 3 excepted for p = 7 for which it is 1. The next one needs to be a little bit more attentive (iv) If the number of roots of Q(X) (mod p) is 7, then the number of roots of R(X) (mod p) is 3. At least it seems so, as Q(X) (mod p) has 7 roots only for the primes 29, 43, 71 and those are primes where R(X) have three roots. But note that the converse is false, that is R(X) may have 3 roots without Q(X) having 7, for example p = 41. Now we turn to question a. : the proportion of primes for which there is a given number of roots. Looking at the number in each example seems to indicate that the proportion has a simple limit when the number of primes involved becomes bigger. It leads to the conjecture: (v) The proportion of primes p < N for which P (X) has 0 (resp. 1, 3) roots has a limit when X goes to infinity, which is 1/3 (resp. 1/2, 1/6) (vi) The proportion of primes p < N for which Q(X) has 1 roots (resp. 7) roots has a limit when X goes to infinity, which is 5/6 (resp. 1/6) (vii) The proportion of primes p < N for which R(X) has 0 roots (resp. 3) roots has a limit when X goes to infinity, which is 2/3 (resp. 1/3) Note that for R(X), there seems to exist only one prime, namely 7 for which R(X) (mod p) has exactly one root. So the proportion of such primes among the ones less than N should go to 0 when N goes to infinity. Finally, we turn to question b.. For P (X) there seem to be no rule predicting the number of roots modulo p in terms of p: it looks like pure chaos. But for Q(X) and R(X) there seem to be a simple rule determining the number of roots in terms of simply p (mod 7). (viii) If p 1 (mod 7) them Q(X) has 7 roots (mod p). Otherwise it has only one roots. (ix) If p 1 (mod 7) or p 6 (mod 7) then Q(X) has 3 roots (mod p). Otherwise it has no root, excepted when p = 7 in which case it has 1 root Theory. It turns out that all the conjectures made above are correct. It would be too hard to ask you to prove them all, but you can prove some of them. Remember first how we proved in class that a polynomial S(X) with integral coefficients monic of degree d 1 (that is of the form X d + terms of lower degrees) has at most d (incongruent) roots modulo p. Either S(X) has no root modulo p and we are done, for 0 d, or it has a root α 1 and then we can write S(X) (X α 1 )S 1 (X) (mod p), where S 1 (X) is a polynomial with integral coefficients monic of degree d 1. Now again either S 1 (X) has no root and we are done, or it has a root α 2 and we can write S(X) = (X α 1 )(X α 2 )S 2 (X) with S 2 monic of degree d 2. We can continue like that until we can t, so finally we get S(X) = (X α 1 )(X α 2 )... (X α k )S k (X) for some integer k satisfying 0 k d, and S k (X) where S k (X) is monic of degree d k and has no roots modulo p (or we do that again). Then the roots of S(X)
12 12 EXTRA CREDIT FOR MATH 39 (mod p) are α 1,..., α k, and since k d, we see that S(X) cannot have more than d roots modulo p. Here we should not jump to the conclusion that S(X) has k roots modulo p, as it could be true that some α i is congruent modulo p with some α j. If that happen, the the number of distinct roots will be less than k, and we say that S(X) has multiple root modulo p. However, it can be proved that P (X) has multiple roots only for p =.., and that Q(X) and R(X) has multiple root mod p only if p = 7. This is not very hard, but uses the notion of derivative of a polynomial that it would be too long to introduce here, so we shall admit it. 1. Prove that P (X) and R(X) have never 2 roots modulo p, and that Q(X) has never 6 roots modulo p (First assume that the polynomial has no multiple roots modulo p, and then solve the remaining cases by hand). This proves observation (i), and part of (ii) and (iii). We shall now prove observation (iii) 2. Prove that Q(X) has always at least one root modulo p, namely 1. Assume that it has more than one root module p and let z be a root of Q(X) modulo p, with z 1 (mod p). Prove that the integers 1, z, z 2, z 3, z 4, z 5 and z 6 are incongruent modulo p, and are all roots of Q(X). So Q(X) has 7 roots modulo p, and (ii) is proved. 3. Let z be as in the above exercise. By direct computation show that z + z 2 + z 4 is a root of R(X) (mod p). Also show that z 3 + z 5 + z 6 is a root of R(X) (mod p). Then prove observation (iv). So far we have prove observations (i), (ii), and (iv), but to prove observation (iii), it remains to prove that R(X) (mod p) may never have exactly one root, excepted when p = 7. You can try to do it, as a bonus question We know turn to observation (viii) and (ix) 4. Assume that Q(X) has seven roots modulo p, and let z be a root different from 1. By Fermat s little theorem, z p 1 1 (mod p). Deduce (using exercise 2) that p 1 (mod 7). To prove (viii), we would need to prove the converse of the preceding statement, that is that if p 1 (mod 7), then Q(X) has 7 roots modulo p, It is sufficient to prove that Q(X) has 1 roots different from 1, in view of exercise Assume p 1 (mod 7) and write p 1 = 7k. Let g be a primitive root modulo p. Show that z := g k is a root of Q(X) (mod p) and is not congruent to 1 modulo p. So we have proved (viii)! It was not so hard. To prove (ix) is a little bit harder, and we shall not do it, but we shall observe that a small part of it is now easy:
13 EXTRA CREDIT FOR MATH Using exercises 3 and 5, show that R(X) has 3 roots if p 1 (mod 7). Finally, it would be much too hard to prove observations (v), (vi) and (vii) from scratch, but just observe that if we admit the Theorem of Dirichlet on primes that are congruent to a modulo b (they are infinitely many if a and b are relatively prime, and the proportion of such prime less than N among all prime less than N goes to 1/φ(a) when N goes to infinity.), then one can 7. prove that observation (viii) implies observation (vi) and that observation (ix) implies observation (vii). We shall not try to prove observation (v) Further questions. Even if we have proved a significant part of the observations (i) to (ix), many questions remain. Why does the proportion of primes for which our polynomials has a given number of roots seem to converge to simple rational numbers? Is that true for all polynomials with integral coefficient or is that true just by chance for our three examples? Why is there a simple rule on p determining the number of roots of Q(X) and R(X) (mod p) (as we have seen there is one for all quadratic polynomials), but apparently not for the polynomial X 3 2? Why can the cubic polynomial P (X) = X 3 2 have exactly 1 root modulo p for infinitely many primes (actually for half of them), while the polynomial R(X), which is also cubic, can never have exactly one root modulo p (excepted for one prime p = 7, and in this case 1 is actually a multiple root)? What makes those polynomials behave so differently? The answers to those questions lie far beyond the scope of this class, but I can name the relevant theories. First, Galois theory is the modern theory of solving polynomial equations. It attaches to any polynomial a finite group, called the Galois group, which encodes the symmetries among its roots. It turns out that the Galois group for Q(X) and R(X) are commutative (the cyclic group of order 7 and 3) respectively, but that P (X) has a Galois group which is not commutative (it is the symmetric group S 3 with 6 elements). Then, we have to use Class Field Theory, a very far-reaching generalization of the quadratic reciprocity law, which shows that there are rules predicting the number of roots of a polynomial S(X) modulo p in terms of congruences of p modulo something, if, and only if, the Galois group of the polynomial S(X) is commutative. This is why we have been able to find such a rule for Q(X) and R(X) but not for P (X). Finally, there is the theorem of Cebotarev, a far-reaching generalization of Dirichlet s theorem on primes numbers, which predicts the proportion of primes p for which a given polynomial S(X) will have exactly a roots (the answer is in term of the proportion of element of a certain type in the Galois group of S(X), and work without assuming that this group is commutative). Galois theory is taught at an advanced undergraduate level (at Brandeis in math 30b = Introduction to Algebra II) but class field theory and the Cebotarev s theorem are taught only in graduate classes.
Algebra. Modular arithmetic can be handled mathematically by introducing a congruence relation on the integers described in the above example.
Coding Theory Massoud Malek Algebra Congruence Relation The definition of a congruence depends on the type of algebraic structure under consideration Particular definitions of congruence can be made for
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 informationPartial Fractions. June 27, In this section, we will learn to integrate another class of functions: the rational functions.
Partial Fractions June 7, 04 In this section, we will learn to integrate another class of functions: the rational functions. Definition. A rational function is a fraction of two polynomials. For example,
More informationReview Sheet for the Final Exam of MATH Fall 2009
Review Sheet for the Final Exam of MATH 1600 - Fall 2009 All of Chapter 1. 1. Sets and Proofs Elements and subsets of a set. The notion of implication and the way you can use it to build a proof. Logical
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 informationCommutative Rings and Fields
Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two
More informationChapter Five Notes N P U2C5
Chapter Five Notes N P UC5 Name Period Section 5.: Linear and Quadratic Functions with Modeling In every math class you have had since algebra you have worked with equations. Most of those equations have
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationAlgebra 1 Mod 1 Review Worksheet I. Graphs Consider the graph below. Please do this worksheet in your notebook, not on this paper.
Algebra 1 Mod 1 Review Worksheet I. Graphs Consider the graph below Please do this worksheet in your notebook, not on this paper. A) For the solid line; calculate the average speed from: 1) 1:00 pm to
More informationWhat is proof? Lesson 1
What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might
More informationDiscrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 7
EECS 70 Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 7 Polynomials Polynomials constitute a rich class of functions which are both easy to describe and widely applicable in topics
More informationWinter Camp 2009 Number Theory Tips and Tricks
Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
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 informationAlgorithms CMSC Homework set #1 due January 14, 2015
Algorithms CMSC-27200 http://alg15.cs.uchicago.edu Homework set #1 due January 14, 2015 Read the homework instructions on the website. The instructions that follow here are only an incomplete summary.
More informationA Guide to Arithmetic
A Guide to Arithmetic Robin Chapman August 5, 1994 These notes give a very brief resumé of my number theory course. Proofs and examples are omitted. Any suggestions for improvements will be gratefully
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 informationCHMC: Finite Fields 9/23/17
CHMC: Finite Fields 9/23/17 1 Introduction This worksheet is an introduction to the fascinating subject of finite fields. Finite fields have many important applications in coding theory and cryptography,
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 informationNumerical analysis meets number theory: using rootfinding methods to calculate inverses mod p n
Numerical analysis meets number theory: using rootfinding methods to calculate inverses mod p n This article is dedicated to the memory of George Mackiw June 7, 2004 Introduction In this article we explore
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1
CS 70 Discrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1 Thursday July 17, 2014, 12:40pm-2:00pm. Instructions: Do not turn over this page until the proctor tells you to. Don t
More informationWarm-up Simple methods Linear recurrences. Solving recurrences. Misha Lavrov. ARML Practice 2/2/2014
Solving recurrences Misha Lavrov ARML Practice 2/2/2014 Warm-up / Review 1 Compute 100 k=2 ( 1 1 ) ( = 1 1 ) ( 1 1 ) ( 1 1 ). k 2 3 100 2 Compute 100 k=2 ( 1 1 ) k 2. Homework: find and solve problem Algebra
More informationMATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST
MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST JAMES MCIVOR Today we enter Chapter 2, which is the heart of this subject. Before starting, recall that last time we saw the integers have unique factorization
More information2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.
2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say
More informationFebruary 1, 2005 INTRODUCTION TO p-adic NUMBERS. 1. p-adic Expansions
February 1, 2005 INTRODUCTION TO p-adic NUMBERS JASON PRESZLER 1. p-adic Expansions The study of p-adic numbers originated in the work of Kummer, but Hensel was the first to truly begin developing the
More informationIntroduction to Techniques for Counting
Introduction to Techniques for Counting A generating function is a device somewhat similar to a bag. Instead of carrying many little objects detachedly, which could be embarrassing, we put them all in
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 informationTable of Contents. 2013, Pearson Education, Inc.
Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter
More informationMEMORIAL UNIVERSITY OF NEWFOUNDLAND
MEMORIAL UNIVERSITY OF NEWFOUNDLAND DEPARTMENT OF MATHEMATICS AND STATISTICS Section 5. Math 090 Fall 009 SOLUTIONS. a) Using long division of polynomials, we have x + x x x + ) x 4 4x + x + 0x x 4 6x
More informationCMSC Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade. 1. (6 points) Let a
More informationSymmetries and Polynomials
Symmetries and Polynomials Aaron Landesman and Apurva Nakade June 30, 2018 Introduction In this class we ll learn how to solve a cubic. We ll also sketch how to solve a quartic. We ll explore the connections
More informationSQUARE PATTERNS AND INFINITUDE OF PRIMES
SQUARE PATTERNS AND INFINITUDE OF PRIMES KEITH CONRAD 1. Introduction Numerical data suggest the following patterns for prime numbers p: 1 mod p p = 2 or p 1 mod 4, 2 mod p p = 2 or p 1, 7 mod 8, 2 mod
More informationPractice Test III, Math 314, Spring 2016
Practice Test III, Math 314, Spring 2016 Dr. Holmes April 26, 2016 This is the 2014 test reorganized to be more readable. I like it as a review test. The students who took this test had to do four sections
More informationWelcome to Math Video Lessons. Stanley Ocken. Department of Mathematics The City College of New York Fall 2013
Welcome to Math 19500 Video Lessons Prof. Department of Mathematics The City College of New York Fall 013 An important feature of the following Beamer slide presentations is that you, the reader, move
More informationSolving Quadratic & Higher Degree Equations
Chapter 9 Solving Quadratic & Higher Degree Equations Sec 1. Zero Product Property Back in the third grade students were taught when they multiplied a number by zero, the product would be zero. In algebra,
More informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More information4400/6400 EXERCISES. 1. Homework 1
4400/6400 EXERCISES PETE L. CLARK 1.1. 4400 Problems. 1. Homework 1 Exercise 1.1.1. (O) 1 How do you know there is no largest integer? Exercise 1.1.2. We recall the definition of divisibility in Z: if
More information1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.
1 2 3 style total Math 415 Examination 3 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. The rings
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 8
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 8 Polynomials Polynomials constitute a rich class of functions which are both easy to describe and widely applicable in
More informationQUADRATIC RINGS PETE L. CLARK
QUADRATIC RINGS PETE L. CLARK 1. Quadratic fields and quadratic rings Let D be a squarefree integer not equal to 0 or 1. Then D is irrational, and Q[ D], the subring of C obtained by adjoining D to Q,
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 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 information22. The Quadratic Sieve and Elliptic Curves. 22.a The Quadratic Sieve
22. The Quadratic Sieve and Elliptic Curves 22.a The Quadratic Sieve Sieve methods for finding primes or for finding factors of numbers are methods by which you take a set P of prime numbers one by one,
More informationKing Fahd University of Petroleum and Minerals Prep-Year Math Program Math Term 161 Recitation (R1, R2)
Math 001 - Term 161 Recitation (R1, R) Question 1: How many rational and irrational numbers are possible between 0 and 1? (a) 1 (b) Finite (c) 0 (d) Infinite (e) Question : A will contain how many elements
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationMath 223, Spring 2009 Final Exam Solutions
Math 223, Spring 2009 Final Exam Solutions Name: Student ID: Directions: Check that your test has 16 pages, including this one and the blank one on the bottom (which you can use as scratch paper or to
More informationLesson 5b Solving Quadratic Equations
Lesson 5b Solving Quadratic Equations In this lesson, we will continue our work with Quadratics in this lesson and will learn several methods for solving quadratic equations. The first section will introduce
More informationGCSE AQA Mathematics. Numbers
GCSE Mathematics Numbers Md Marufur Rahman Msc Sustainable Energy Systems Beng (Hons) Mechanical Engineering Bsc (Hons) Computer science & engineering GCSE AQA Mathematics 215/16 Table of Contents Introduction:...
More informationExam 2 Solutions. In class questions
Math 5330 Spring 2018 Exam 2 Solutions In class questions 1. (15 points) Solve the following congruences. Put your answer in the form of a congruence. I usually find it easier to go from largest to smallest
More informationFrobenius and His Density Theorem for Primes
Frobenius and His Density Theorem for Primes Introduction B Sury Our starting point is the following problem which appeared in the recent IMO (International Mathematical Olympiad) 9 If p is a prime number,
More informationLIMITS AT INFINITY MR. VELAZQUEZ AP CALCULUS
LIMITS AT INFINITY MR. VELAZQUEZ AP CALCULUS RECALL: VERTICAL ASYMPTOTES Remember that for a rational function, vertical asymptotes occur at values of x = a which have infinite its (either positive or
More informationSection 3.1 Quadratic Functions
Chapter 3 Lecture Notes Page 1 of 72 Section 3.1 Quadratic Functions Objectives: Compare two different forms of writing a quadratic function Find the equation of a quadratic function (given points) Application
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
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 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 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 informationSolving Quadratic & Higher Degree Equations
Chapter 9 Solving Quadratic & Higher Degree Equations Sec 1. Zero Product Property Back in the third grade students were taught when they multiplied a number by zero, the product would be zero. In algebra,
More informationWORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}
WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not
More informationMath 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
More informationMath Problem Set #3 Solution 19 February 2001
Math 203-04 Problem Set #3 Solution 19 February 2001 Exercises: 1. B & D, Section 2.3, problem #3. In your answer, give both exact values and decimal approximations for the amount of salt in the tank at
More informationBlankits and Covers Finding Cover with an Arbitrarily Large Lowest Modulus
Blankits and Covers Finding Cover with an Arbitrarily Large Lowest Modulus Amina Dozier, Charles Fahringer, Martin Harrison, Jeremy Lyle Dr. Neil Calkin, Dr. Kevin James, Dr. Dave Penniston July 13, 2006
More informationEXAMPLES OF MORDELL S EQUATION
EXAMPLES OF MORDELL S EQUATION KEITH CONRAD 1. Introduction The equation y 2 = x 3 +k, for k Z, is called Mordell s equation 1 on account of Mordell s long interest in it throughout his life. A natural
More informationDiscrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set
Discrete Logarithms Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set Z/mZ = {[0], [1],..., [m 1]} = {0, 1,..., m 1} of residue classes modulo m is called
More informationIRREDUCIBILITY TESTS IN F p [T ]
IRREDUCIBILITY TESTS IN F p [T ] KEITH CONRAD 1. Introduction Let F p = Z/(p) be a field of prime order. We will discuss a few methods of checking if a polynomial f(t ) F p [T ] is irreducible that are
More informationToday. Wrapup of Polynomials...and modular arithmetic. Coutability and Uncountability.
Today. Wrapup of Polynomials...and modular arithmetic. Coutability and Uncountability. Reed-Solomon code. Problem: Communicate n packets m 1,...,m n on noisy channel that corrupts k packets. Reed-Solomon
More informationSolving Quadratic & Higher Degree Equations
Chapter 7 Solving Quadratic & Higher Degree Equations Sec 1. Zero Product Property Back in the third grade students were taught when they multiplied a number by zero, the product would be zero. In algebra,
More informationMATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
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 informationGetting to the Roots of Quadratics
NAME BACKGROUND Graphically: The real roots of a function are the x-coordinates of the points at which the graph of the function intercepts/crosses the x-axis. For a quadratic function, whose graph is
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 informationModular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
More informationPolynomial analogues of Ramanujan congruences for Han s hooklength formula
Polynomial analogues of Ramanujan congruences for Han s hooklength formula William J. Keith CELC, University of Lisbon Email: william.keith@gmail.com Detailed arxiv preprint: 1109.1236 Context Partition
More informationHelping Students Understand Algebra
Helping Students Understand Algebra By Barbara Sandall, Ed.D., and Mary Swarthout, Ph.D. COPYRIGHT 2005 Mark Twain Media, Inc. ISBN 10-digit: 1-58037-293-7 13-digit: 978-1-58037-293-0 Printing No. CD-404020
More informationMATH Fundamental Concepts of Algebra
MATH 4001 Fundamental Concepts of Algebra Instructor: Darci L. Kracht Kent State University April, 015 0 Introduction We will begin our study of mathematics this semester with the familiar notion of even
More informationMath 90 Lecture Notes Chapter 1
Math 90 Lecture Notes Chapter 1 Section 1.1: Introduction to Algebra This textbook stresses Problem Solving! Solving problems is one of the main goals of mathematics. Think of mathematics as a language,
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER /2018
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 2017/2018 DR. ANTHONY BROWN 1. Arithmetic and Algebra 1.1. Arithmetic of Numbers. While we have calculators and computers
More informationIntroduction to Information Security
Introduction to Information Security Lecture 5: Number Theory 007. 6. Prof. Byoungcheon Lee sultan (at) joongbu. ac. kr Information and Communications University Contents 1. Number Theory Divisibility
More informationCHAPTER 1. Review of Algebra
CHAPTER 1 Review of Algebra Much of the material in this chapter is revision from GCSE maths (although some of the exercises are harder). Some of it particularly the work on logarithms may be new if you
More informationBjorn Poonen. MSRI Introductory Workshop on Rational and Integral Points on Higher-dimensional Varieties. January 18, 2006
University of California at Berkeley MSRI Introductory Workshop on Rational and Integral Points on Higher-dimensional Varieties January 18, 2006 The original problem H10: Find an algorithm that solves
More informationHonors Advanced Mathematics Determinants page 1
Determinants page 1 Determinants For every square matrix A, there is a number called the determinant of the matrix, denoted as det(a) or A. Sometimes the bars are written just around the numbers of the
More informationAlgebraic. techniques1
techniques Algebraic An electrician, a bank worker, a plumber and so on all have tools of their trade. Without these tools, and a good working knowledge of how to use them, it would be impossible for them
More informationAlgorithms. Shanks square forms algorithm Williams p+1 Quadratic Sieve Dixon s Random Squares Algorithm
Alex Sundling Algorithms Shanks square forms algorithm Williams p+1 Quadratic Sieve Dixon s Random Squares Algorithm Shanks Square Forms Created by Daniel Shanks as an improvement on Fermat s factorization
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationChapter 1A -- Real Numbers. iff. Math Symbols: Sets of Numbers
Fry Texas A&M University! Fall 2016! Math 150 Notes! Section 1A! Page 1 Chapter 1A -- Real Numbers Math Symbols: iff or Example: Let A = {2, 4, 6, 8, 10, 12, 14, 16,...} and let B = {3, 6, 9, 12, 15, 18,
More information12. Hilbert Polynomials and Bézout s Theorem
12. Hilbert Polynomials and Bézout s Theorem 95 12. Hilbert Polynomials and Bézout s Theorem After our study of smooth cubic surfaces in the last chapter, let us now come back to the general theory of
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 20. To Infinity And Beyond: Countability and Computability
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 0 To Infinity And Beyond: Countability and Computability This note ties together two topics that might seem like they have
More informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
More informationPrimes, Polynomials, Progressions. B.Sury Indian Statistical Institute Bangalore NISER Bhubaneshwar February 15, 2016
Indian Statistical Institute Bangalore NISER Bhubaneshwar February 15, 2016 Primes and polynomials It is unknown if there exist infinitely many prime numbers of the form n 2 + 1. Primes and polynomials
More informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
More informationMATH 22 FUNCTIONS: ORDER OF GROWTH. Lecture O: 10/21/2003. The old order changeth, yielding place to new. Tennyson, Idylls of the King
MATH 22 Lecture O: 10/21/2003 FUNCTIONS: ORDER OF GROWTH The old order changeth, yielding place to new. Tennyson, Idylls of the King Men are but children of a larger growth. Dryden, All for Love, Act 4,
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 informationP-adic numbers. Rich Schwartz. October 24, 2014
P-adic numbers Rich Schwartz October 24, 2014 1 The Arithmetic of Remainders In class we have talked a fair amount about doing arithmetic with remainders and now I m going to explain what it means in a
More informationGalois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.
Galois fields 1 Fields A field is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except by zero) can be performed, and satisfy the usual rules. More
More informationALGEBRA. COPYRIGHT 1996 Mark Twain Media, Inc. ISBN Printing No EB
ALGEBRA By Don Blattner and Myrl Shireman COPYRIGHT 1996 Mark Twain Media, Inc. ISBN 978-1-58037-826-0 Printing No. 1874-EB Mark Twain Media, Inc., Publishers Distributed by Carson-Dellosa Publishing Company,
More informationMath 2602 Finite and Linear Math Fall 14. Homework 8: Core solutions
Math 2602 Finite and Linear Math Fall 14 Homework 8: Core solutions Review exercises for Chapter 5 page 183 problems 25, 26a-26b, 29. Section 8.1 on page 252 problems 8, 9, 10, 13. Section 8.2 on page
More informationArithmetic Statistics Lecture 1
Arithmetic Statistics Lecture 1 Álvaro Lozano-Robledo Department of Mathematics University of Connecticut May 28 th CTNT 2018 Connecticut Summer School in Number Theory Question What is Arithmetic Statistics?
More information1. Definition of a Polynomial
1. Definition of a Polynomial What is a polynomial? A polynomial P(x) is an algebraic expression of the form Degree P(x) = a n x n + a n 1 x n 1 + a n 2 x n 2 + + a 3 x 3 + a 2 x 2 + a 1 x + a 0 Leading
More informationLecture 4: Constructing the Integers, Rationals and Reals
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 4: Constructing the Integers, Rationals and Reals Week 5 UCSB 204 The Integers Normally, using the natural numbers, you can easily define
More information