The Number of Fields Generated by the Square Root of Values of a Given Polynomial
|
|
- Darren Paul
- 5 years ago
- Views:
Transcription
1 Canad. Math. Bull. Vol. 46 (1), 2003 pp The Number o Fields Generated by the Square Root o Values o a Given Polynomial Pamela Cutter, Andrew Granville, and Thomas J. Tucker Abstract. The abc-conjecture is applied to various questions involving the number o distinct ields Q ( (n) ), as we vary over integers n. 1 Introduction We irst investigate the ollowing problem: Conjecture 1 Suppose that (x) Z[x] has degree 2 and no repeated roots. Then there are N distinct quadratic ields amongst (1.1) Q ( (1) ), Q ( (2) ), Q ( (3) ),..., Q ( (N) ). Conjecture 1 is actually untrue or linear polynomials. Indeed an elementary argument gives: Theorem 1A Let (x) = ax + b with integers 0 b < a < N and gcd(a, b) = 1. There are ( 6 ( π ) ) 1c(a) p 2 N + O( an log a) p a distinct quadratic ields amongst those in (1.1) where c(a) = m M a 1/m 2 and M a is the set o integers m, coprime to a, such that there is no l < m with l 2 m 2 (mod a). By urther elementary arguments one can prove conjecture 1 or quadratic polynomials: Theorem 1B Suppose that (x) Z[x] has degree 2 and no repeated roots. Then there are N + O(N/ log N) distinct quadratic ields amongst Q ( (1) ), Q ( (2) ), Q ( (3) ),..., Q ( (N) ). For higher degree polynomials we have proved the conjecture assuming the abcconjecture, using several o the ideas rom [3]: Received by the editors March 26, 2001; revised August 20, The second author is supported, in part, by the National Science Foundation. AMS subject classiication: 11N32, 11D41. c Canadian Mathematical Society
2 72 Pamela Cutter, Andrew Granville, and Thomas J. Tucker The abc-conjecture (Oesterlé, Masser, Szpiro) positive integers satisying a + b = c then Fix ε > 0. I a, b, c are coprime (1.2) c ε N(a, b, c) 1+ε, where N(a, b, c) is the product o the distinct primes dividing abc. A special case o Theorem 1 in [3] states that i we assume the abc-conjecture then or (x) Z[x] without repeated roots with gcd{ (n) : n Z} = 1, there exists a constant c > 0 such that there are c N positive integers n N or which (n) is squareree. (Note that this result can be proved unconditionally i has degree 2 using the sieve o Eratosthenes; and was proved unconditionally by Hooley [5] or o degree 3 by deeper arguments. Perhaps it might be possible to use the techniques o [5] to prove Conjecture 1 or degree 3 polynomials unconditionally). The main result in this paper is that Conjecture 1 ollows rom the abc-conjecture (a weaker consequence o the abc-conjecture was given in Corollary 2 o [3]). Theorem 1C I the abc-conjecture is true then Conjecture 1 is also true. A key component in the proo o Theorem 1C is the ollowing result (which may be o independent interest) on integral points on (x) c (y), which is proved using Siegel s Theorem. Theorem 2 Suppose that (x) Z[x] has at least three distinct roots. For any ixed c > 1 there are at most initely many integral points (a, b) on the curve (x) c (y) = 0. A harder though perhaps more important problem is to determine, or a given (x) Z[x] without repeated roots, an estimate or A (D), the number o squareree integers d D such that there exists some integer n with (n) = dm 2 or some integer m. From Theorem 1C we deduce that A (D) D 1/ deg( ) i the abc-conjecture holds. To get an upper bound we use Corollary 1 rom [3] (which is deduced rom (26) o Elkies paper [2]): Lemma 1 Assume that the abc-conjecture is true. Suppose that (x) Z[x] has no repeated roots. Then p n deg( ) 1 o(1). primes p (n) Now, note that in the above case ( ) 2 ( p = primes p (n) primes p dm p) 2 (dm) 2 = d (n) D n deg( ), and combining this with Lemma 1 shows that that n D 1/(deg( ) 2)+o(1). Recalling the deinition o the quantity A (D) given above, we have now proved: Theorem 3A roots. Then Assume the abc-conjecture. Suppose that (x) Z[x] has no repeated D 1/ deg( ) A (D) D 1/(deg( ) 2)+o(1). In particular A (D) D 1/2+o(1) i deg( ) 4.
3 Quadratic Fields 73 In act we believe that A (D) = D 1/ deg( )+o(1) i deg( ) 2, and we will give a heuristic to justiy this or deg( ) 3 in Section 7. For linear polynomials we prove the ollowing, in Section 6. Theorem 3B I (x) = ax + b with (a, b) = 1 then A (D) 2 α(a) 6 π 2 D p a p 2(p + 1), where α(a) equals 1 i 8 a, equals 0 i 4 a but not 8, and equals 1 i 4 does not divide a. For quadratic polynomials we believe that A (D) = D 1+o(1) (which might be provable). More precisely we believe that i is reducible then A (D) c D, and i is irreducible then A (D) c D/ log D or some constants c > 0. It is easy to see that such a dichotomy exists rom the ollowing examples: Example 1 Consider (x) = x 2 1. Then (x) = dm 2 precisely when x 2 dm 2 = 1; in other words, when we have a solution to Pell s equation. Pell s equation always has an integer solution, so A (D) (6/π 2 )D. Example 2 Consider (x) = x 2 3. Then (x) = dm 2 is equivalent to x 2 dm 2 = 3; that is, 3 is represented by the principal binary quadratic orm o discriminant 4d. Now 3 is represented by a binary quadratic orm o discriminant 4d i and only i d is a square mod 3, so that d 0 or 1 (mod 3). I that is the case then 3 is represented by a binary quadratic orm rom the principal genus, o discriminant 4d, i and only i 3 is a square mod p or every prime p dividing d, so that p = 3 or p ±1 (mod 12). In other words we have d 0 or 1 (mod 3), with no prime actors congruent to ±5 (mod 12): By the undamental lemma o the sieve [4] there are D/ log D such integers d D. For such d we know that 3 is represented by some orm rom the principal genus, but it is a relatively deep problem to determine which orm(s). However, Cohen and Lenstra conjectured that there is just one class o quadratic orms in each genus or over 75% o real quadratic discriminants, and we expect this to be true or the restricted class o discriminants considered here. Thus we surmise that A x2 3(D) D/ log D, and a more detailed analysis o the Cohen-Lenstra heuristic leads to the guess that A x2 3(D) D/ log D. 2 Algebraic Preliminaries Lemma 2.1 Suppose that (x) Z[x] has no repeated roots. Then there exists a constant B = B such that or all prime powers q, there are no more than B values o a (mod q) or which (a) 0 (mod q). Proo Let K be the splitting ield or over Q, let P be a prime in K lying over a prime p with ramiication index e and with N P = p g, let α 1,..., α n be the roots o, and let p r be the highest power o p dividing the leading coeicient o. We
4 74 Pamela Cutter, Andrew Granville, and Thomas J. Tucker will show that or any m 0, the number values o a (mod p m ) or which (a) 0 (mod p m ) is at most n B,p := max p g(er+v P,i) P p where v P,i = k i v P(α k α i ). I p does not divide the discriminant D o then r = 0 and each v P,i = 0, so that B,p n. Thereore B := max{n, max p D B,p }. Suppose (a) 0 (mod p m ). Select i such that v P (a α i ) = max k ( vp (a α k ) ), so that v P (α i α k ) min ( v P (a α k ), v P (a α i ) ) = v P (a α k ). Thereore ( ) em v P (a) = er + v P (a α k ) er + v P (a α i ) + v P (α i α k ). k i k i=1 In other words, v P (a α i ) em er v P,i, so that there are at most (NP) er+v P,i such values o a (mod p m ). Summing over i then inishes the proo. By the Chinese Remainder Theorem we immediately deduce: Corollary 2.2 Suppose that (x) Z[x] has no repeated roots. Then there exists a constant B = B such that there are no more than B ω(d) values o a (mod d) or which (a) 0 (mod d), where ω(d) denotes the number o distinct prime actors o d. We will now prove a couple lemmas about the nonexistence o various types o low degree actors or certain (x) Q[x]. Lemma 2.3 Suppose that (x) Q[x] has at least two distinct roots. I c is neither zero nor a root o unity then (x) c (y) has no linear actor in Q[x, y]. Proo I (x) c (y) has a linear actor x ay b, with a, b in Q, then the linear map L(y) = ay + b has the property that ( L(y) ) = c (y). This implies that L permutes the roots o, which means that some power L k o L ixes all the roots o. Since there are at least two distinct roots, L k must be the identity, but this is impossible since then (y) = ( L k (y) ) = c k (y) and c is not a root o unity. Lemma 2.4 Suppose that (x) Q[x] has at least three distinct roots. I c is neither zero nor a root o unity then (x) c (y) has no quadratic actor o the orm x 2 ay 2 + 2dx + ey + h Q[x, y]. Proo Let g(x) = (x d) so that g(x) cg(y) has a actor o the orm x 2 ay 2 +ly+q over Q. Deine P(x, y) by (x 2 ay 2 + ly + q)p(x, y) = g(x) cg(y), and let P k (x, y) be the degree k part o P(x, y). Assuming without loss o generality that g is monic o degree n, we ind that x 2 ay 2 divides x n cy n so that n is even,
5 Quadratic Fields 75 say 2m, and c = a m, giving P 2m 2 (x, y) = (x 2m a m y 2m )/(x 2 ay 2 ). The degree 2m 1 terms in the equation above then give (x 2 ay 2 )P 2m 3 (x, y) + ly (x2m a m y 2m ) (x 2 ay 2 ) or some integer u. Replacing x to x and subtracting, gives = u(x 2m 1 a m y 2m 1 ) (x 2 ay 2 ) ( P 2m 3 (x, y) P 2m 3 ( x, y) ) = 2ux 2m 1, so that x 2 ay 2 divides 2ux 2m 1, which can only happen i u = 0. But then x 2 ay 2 divides lyp 2m 2 (x, y), which can only happen i l = 0. We have proved that our quadratic actor must be o the orm x 2 ay 2 + q. In act each P 2 j 1 (x, y) = 0 or, i not, select the largest j or which P 2 j 1 (x, y) 0 and then (x 2 ay 2 )P 2 j 1 (x, y) = v(x 2 j+1 a m y 2 j+1 ), which is impossible. We deduce that g(x) a m g(y) has no terms o odd degree, so that g(x) can be written as G(x 2 ) or some G(t) Q[t]. Letting X = x 2 and Y = y 2, we deduce that X ay + q is a actor o G(X) a m G(Y ), and so G has no more than one distinct root by Lemma 2.3. But then g, and so, can have no more than two distinct roots, contradicting the hypothesis. Remark It is plausible, ollowing the two previous results, that (x) c (y) has no actor o degree k when c is not a root o unity, and has more than k distinct roots. However we do not see how to generalize the proos above. 3 Integer Points on (x) c (y) We will use the ollowing amous theorem due to Siegel, oten reerred to as Siegel s theorem, in what ollows. This will involve introducing the idea o points at ininity, which we now explain. Let h(x, y) be a polynomial in two variables. We will denote the highest degree part o h(x, y) (which is obtained by homogenizing h(x, y) and then setting the homogenizing variable to 0) as h(x, y). The linear actors o h(x, y) correspond to the points at ininity or the curve h(x, y) = 0. Siegel s Theorem (see [6], or Section 2 o [1] or a contemporary account) Let h(x, y) be an absolutely irreducible polynomial with coeicients in a number ield. I the curve h(x, y) = 0 has more than two distinct Q-points at ininity, then there are at most initely many integer points (a, b) on the curve h(x, y) = 0. Using this we can proceed to the proo o Theorem 2: Proo o Theorem 2 Suppose (x) c (y) actors over Q into absolutely irreducible actors as r i=1 h i(x, y), each o which has degree 2 by Lemma 2.3. We will show that each curve h i (x, y) = 0 has at most initely many integer points. Since r h i=1 i (x, y) = x n cy n, and x n cy n has distinct roots, each h i (x, y) has deg h i distinct linear actors and so h i (x, y) = 0 has deg h i distinct points at ininity. Thereore, by Siegel s theorem (as stated above) we deduce that there are at most initely many integral points on h i (x, y) = 0 whenever deg h i 3.
6 76 Pamela Cutter, Andrew Granville, and Thomas J. Tucker We are let with the case where deg h i = 2. We may assume that h i (x, y) = 0 can be written with rational coeicients, else h i (x, y) = 0 has at most initely many rational solutions (corresponding to its intersection with its conjugate curves). Now h i (x, y) divides x n cy n = ξ n =1 (x ξαy), where α is the positive real n-th root o c, so that h i (x, y) = (x ξ 1 αy)(x ξ 2 αy), or two distinct n-th roots o unity, ξ 1, ξ 2 : I ξ 1 is real then ξ 2 is real, since h i (x, y) is real, and thus, since they are distinct real roots o unity, they must be 1 and 1. Thereore h i (x, y) = x 2 ay 2 where a is rational, which is impossible by Lemma 2.4. I ξ 1 = ξ is not real then ξ 2 = ξ, since h i (x, y) is real. Moreover, the coeicients α(ξ + ξ) and α 2 are rational, and so ξ 2 + ξ 2 = ( α(ξ + ξ) ) 2 /α 2 2 is rational. Thereore ξ 2 generates a ield o degree at most two over the rationals, so that ξ 2 is a primitive k-th root unity where k = 1, 2, 3, 4 or 6. Now k = 1 is impossible as ξ is not real, the case k = 2 gives h i (x, y) = x 2 ay 2 or some rational a, which is impossible by Lemma 2.4. The cases k = 3, 4, 6 give h i (x, y) = x 2 2baxy+4ba 2 y 2 or b = 1, 2, 3, respectively, where a is rational. Making the change o variables x = X + aby we ind that h i (x, y) = X 2 + Ay 2 + cx + dy + e where A = b(4 b)a 2 is a positive rational number. By urther changes o variables to remove the linear terms, and scaling up to make solutions integers, we ind that integer points on h i (x, y) = 0 correspond to integer points (u, v) on an ellipse o the orm u 2 +Av 2 = N; evidently u N and v N/A so there are initely many. 4 Large Squares Dividing (n) Fix an ɛ > 0 and a suiciently large integer y N 1/3. We will show that i N is suiciently large then (4.1) #{n N : m 2 (n) or some m > y} ɛn, unconditionally i deg( ) 2, and assuming the abc-conjecture otherwise. It ollows immediately rom Theorem 8 o [3] and the discussion preceding it, that i we assume that the abc-conjecture is true, then or any ixed c > 0 there are o(n) integers n N such that (n) is divisible by the square o a prime > cn. O course i (x) has degree 1 or 2, then (n) N 2 or all n N, so that (n) cannot be divisible by the square o a prime N. The number o integers n N or which (n) is divisible by the square o some prime in the range y < p < cn is, using Lemma 2.1, y<p<cn ( N ) B p N y + N log N. Finally we must consider those n or which (n) is divisible by the square o some integer m > y, all o whose prime actors are y. For each n we select the smallest such m and we claim that this is y 2 : or i not select any prime actor p o m so that p y and let M := m/p which is > y 2 /y = y and such that M 2 divides m 2 which
7 Quadratic Fields 77 divides (n), contradicting the minimality o m. Thus using Corollary 2.2, and since ω(m) log m/ log log m so that B ω(m) = m o(1), we have that the number o such n is B ω(m) y<m y 2 ( N ) m y o(1) (N/y + y 2 ) N/y 1 o(1). The result (4.1) ollows rom combining the last three paragraphs, so long as y was chosen suiciently large. 5 Proo o Theorems 1B and 1C We want to determine the number o distinct squareree integers d or which there exists some integer n N such that (n) = dm 2 or some integer m. Evidently there are no more than N such values o d. To get a lower bound we remove all cases where m > y (where y is as deined in section 4), as well as all those d or which there is more than one such pair m, n with m y and n N. In other words, using (4.1), our quantity is (1 ɛ)n m 1,m 2 y #{n 1 n 2 N : (n 1 )/m 2 1 = (n 2 )/m 2 2 is squareree}. Note that i m 1 = m 2 then we are asking or solutions to (n 1 ) = (n 2 ) with n 1 n 2. However or any non-constant polynomial, (n) is monotone increasing or n suiciently large, so there are at most initely many such pairs n 1, n 2. Otherwise, assuming without loss o generality that m 1 > m 2, each pair (n 1, n 2 ) gives rise to an integer point on the curve (x) c (z) = 0 with c = (m 1 /m 2 ) 2 > 1. By Theorem 2 there are c, 1 such points when deg( ) 3. Thereore or ixed but large y, m 1,m 2 y #{n 1 n 2 N : (n 1 )/m 2 1 = (n 2 )/m 2 2 is squareree} 1, which completes the proo o Theorem 1C or deg( ) 3. When deg( ) = 2 we can get more uniorm bounds. In that case i (x) = ax 2 + bx + c, we can complete the square to get 4a (x) = X 2 +, where X = 2ax + b and = (b 2 4ac). Then, i we ix positive integers m 1, m 2 y, take an integral solution (n 1, n 2 ) to (n 1 )/m 2 1 = (n 2 )/m 2 2, and let r j = 2an j + b, we obtain an integral solution (r 1, r 2 ) to (m 2 r 1 m 1 r 2 )(m 2 r 1 + m 1 r 2 ) = (m 2 1 m 2 2). This has τ ( (m 2 1 m 2 2) ) = y o(1) solutions, where τ(.) is the number o divisors o an integer. Theorem 1B then ollows rom the proo in Section 4 with y = log 2 N.
8 78 Pamela Cutter, Andrew Granville, and Thomas J. Tucker 6 Linear Polynomials Proo o Theorem 1A We wish to ind the number o squareree integers d or which there exists an integer m such that dm 2 = an + b or some n N. For those d q (mod a), we select m to be the smallest positive integer or which qm 2 b (mod a) i such an m exists. Thus we need to determine m M a #{squareree d (an + b)/m 2 : d b/m 2 (mod a)}. By elementary sieve theory we have that the number o squareree integers d q (mod a), when (a, q) = 1, is, writing d = ar + q, r x g 2 ar+q µ(g) = = g ax+q g ax+q,(g,a)=1 = x p a µ(g)#{r x : g 2 ar + q} µ(g) ( x/g 2 + O(1) ) (1 1 ) p 2 + O( ax). Summing up over m M a gives the result. Proo o Theorem 3B I (x) is a linear polynomial, say ax + b with (a, b) = 1, then we are interested in the proportion o squareree integers d D or which there exists some integer m such that dm 2 b (mod a). In other words d belongs to one o a certain set o congruence classes mod a; the number o such congruence classes being φ(a)/2 w(a) where w(a) denotes the number o distinct odd prime actors o a, plus 2 i 8 divides a, or plus 1 i 4 divides a but not 8. By the estimate in the proo o Theorem 1A each o these arithmetic progressions contains (D/a) p a (1 1/p2 ) + O( D) such integers d D, and so we obtain the result. 7 Heuristic The argument preceding Lemma 1 in the introduction tells us that i (n) = dm 2 with d D then n D 1/(deg( ) 2)+o(1), assuming the abc-conjecture. I n D 1/ deg( ) then (n) n deg( ) D, so that d D. Thereore we need to explore urther or D 1/ deg( ) n D 1/(deg( ) 2)+o(1). For N = cd 1/ deg( ) 2 j with j = 0, 1, 2,..., J we consider N < n < 2N, so that (n) N deg( ). Then m 2 = values o n (mod m 2 ), or which (n) 0 (mod m 2 ) by Corollary 2.2. Thereore the number o such N < n < 2N is B ω(m) (2N/m 2 + 1). For the heuristic assume the term 1 is irrelevant at least on average, and recall that B ω(m) N o(1). Thereore #{n N : m 2 (n) or some m M} m M N1+o(1) /m 2 D/N deg( )/2 1 o(1), where (n) /d N deg( ) /D, and obviously m 2 N deg( ). Now there are B ω(m)
9 Quadratic Fields 79 M is the interval N deg( )/2 /D 1/2 m N deg( )/2. Summing over all such N we get D 1/ deg( )+o(1), or deg( ) 3, as required. Added in proo: In March 2002, we received a preprint by Bjorn Poonen, Squareree values o multivariable polynomials, in which he proves our Theorems 1A, 1B, 1C; his proos are slightly dierent rom the ones in this paper. Reerences [1] E. Bombieri, Eective Diophantine Approximation on G m. Ann. Scuola Norm. Pisa Cl. Sci (4) 20(1993), [2] N. Elkies, ABC implies Mordell. Internat. Math. Res. Notices 7(1991), [3] A. Granville, ABC means we can count squarerees. Internat. Math. Res. Notices 19(1998), [4] H. Halberstam and H.-E. Richert, Sieve Methods. Academic Press, London-New York-San Francisco, [5] C. Hooley, On the power ree values o polynomials. Mathematika 14(1967), [6] C. L. Siegel, Über einege Anwendungen diophantischer Approximaten. Abh. Preuss. Akad. Wiss. Phys. Math. Kl. 1(1929), Department o Mathematics University o Georgia Athens, Georgia USA pcutter@kzoo.edu andrew@math.uga.edu ttucker@math.uga.edu
Homework 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 informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
More information2. ETA EVALUATIONS USING WEBER FUNCTIONS. Introduction
. ETA EVALUATIONS USING WEBER FUNCTIONS Introduction So ar we have seen some o the methods or providing eta evaluations that appear in the literature and we have seen some o the interesting properties
More informationChapter 6. Approximation of algebraic numbers by rationals. 6.1 Liouville s Theorem and Roth s Theorem
Chapter 6 Approximation of algebraic numbers by rationals Literature: W.M. Schmidt, Diophantine approximation, Lecture Notes in Mathematics 785, Springer Verlag 1980, Chap.II, 1,, Chap. IV, 1 L.J. Mordell,
More informationNOTES ON DIOPHANTINE APPROXIMATION
NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse December 11, 2007 8 Approximation of algebraic numbers Literature: W.M. Schmidt, Diophantine approximation, Lecture Notes in Mathematics 785, Springer
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 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 informationNAP Module 4. Homework 2 Friday, July 14, 2017.
NAP 2017. Module 4. Homework 2 Friday, July 14, 2017. These excercises are due July 21, 2017, at 10 pm. Nepal time. Please, send them to nap@rnta.eu, to laurageatti@gmail.com and schoo.rene@gmail.com.
More informationOn integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1
ACTA ARITHMETICA LXXXII.1 (1997) On integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1 by P. G. Walsh (Ottawa, Ont.) 1. Introduction. Let d denote a positive integer. In [7] Ono proves that if the number
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
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 informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationTHUE S LEMMA AND IDONEAL QUADRATIC FORMS
THUE S LEMMA AND IDONEAL QUADRATIC FORMS PETE L. CLARK Introduction Recently I learned about Thue s Lemma, an elementary result on congruences due to the Norwegian mathematician Axel Thue (1863-1922).
More informationTHUE S LEMMA AND IDONEAL QUADRATIC FORMS
THUE S LEMMA AND IDONEAL QUADRATIC FORMS PETE L. CLARK Abstract. The representation of integers by binary quadratic forms is one of the oldest problems in number theory, going back at least to Fermat s
More informationChapter 6. Approximation of algebraic numbers by rationals. 6.1 Liouville s Theorem and Roth s Theorem
Chapter 6 Approximation of algebraic numbers by rationals Literature: W.M. Schmidt, Diophantine approximation, Lecture Notes in Mathematics 785, Springer Verlag 1980, Chap.II, 1,, Chap. IV, 1 L.J. Mordell,
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 informationTHE DIOPHANTINE EQUATION f(x) = g(y)
proceedings of the american mathematical society Volume 109. Number 3. July 1990 THE DIOPHANTINE EQUATION f(x) = g(y) TODD COCHRANE (Communicated by William Adams) Abstract. Let f(x),g(y) be polynomials
More informationCourse 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
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 informationCHARACTERIZING INTEGERS AMONG RATIONAL NUMBERS WITH A UNIVERSAL-EXISTENTIAL FORMULA
CHARACTERIZING INTEGERS AMONG RATIONAL NUMBERS WITH A UNIVERSAL-EXISTENTIAL FORMULA BJORN POONEN Abstract. We prove that Z in definable in Q by a formula with 2 universal quantifiers followed by 7 existential
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationCourse MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography
Course MA2C02, Hilary Term 2013 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2000 2013 Contents 9 Introduction to Number Theory 63 9.1 Subgroups
More informationARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS
ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS TIMO ERKAMA It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers
More informationIrreducible Polynomials over Finite Fields
Chapter 4 Irreducible Polynomials over Finite Fields 4.1 Construction of Finite Fields As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring
More informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More informationFermat numbers and integers of the form a k + a l + p α
ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac
More informationSQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, 2015
SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, 2015 1. Squarefree values of olynomials: History In this section we study the roblem of reresenting square-free integers by integer olynomials.
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 informationbe any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UFD. Therefore
More informationCoding Theory and Applications. Solved Exercises and Problems of Cyclic Codes. Enes Pasalic University of Primorska Koper, 2013
Coding Theory and Applications Solved Exercises and Problems of Cyclic Codes Enes Pasalic University of Primorska Koper, 2013 Contents 1 Preface 3 2 Problems 4 2 1 Preface This is a collection of solved
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include
PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
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 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 informationPRIME FACTORS OF DYNAMICAL SEQUENCES. Xander Faber and Andrew Granville
PRIME FACTORS OF DYNAMICAL SEQUENCES Xander Faber and Andrew Granville Abstract. Let φ(t) Q(t) have degree d 2. For a given rational number x 0, define x n+1 = φ(x n) for each n 0. If this sequence is
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationAN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS
AN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS PAUL POLLACK Abstract It is well-known that Euclid s argument can be adapted to prove the infinitude of primes of the form 4k
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 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 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 informationOn the number of elements with maximal order in the multiplicative group modulo n
ACTA ARITHMETICA LXXXVI.2 998 On the number of elements with maximal order in the multiplicative group modulo n by Shuguang Li Athens, Ga.. Introduction. A primitive root modulo the prime p is any integer
More informationA WEAK VERSION OF ROLLE S THEOREM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3147 3153 S 0002-9939(97)03910-5 A WEAK VERSION OF ROLLE S THEOREM THOMAS C. CRAVEN (Communicated by Wolmer
More informationGALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2)
GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2) KEITH CONRAD We will describe a procedure for figuring out the Galois groups of separable irreducible polynomials in degrees 3 and 4 over
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 informationMT5836 Galois Theory MRQ
MT5836 Galois Theory MRQ May 3, 2017 Contents Introduction 3 Structure of the lecture course............................... 4 Recommended texts..................................... 4 1 Rings, Fields and
More informationAMBIGUOUS FORMS AND IDEALS IN QUADRATIC ORDERS. Copyright 2009 Please direct comments, corrections, or questions to
AMBIGUOUS FORMS AND IDEALS IN QUADRATIC ORDERS JOHN ROBERTSON Copyright 2009 Please direct comments, corrections, or questions to jpr2718@gmail.com This note discusses the possible numbers of ambiguous
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 informationMTH310 EXAM 2 REVIEW
MTH310 EXAM 2 REVIEW SA LI 4.1 Polynomial Arithmetic and the Division Algorithm A. Polynomial Arithmetic *Polynomial Rings If R is a ring, then there exists a ring T containing an element x that is not
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 informationOn the power-free parts of consecutive integers
ACTA ARITHMETICA XC4 (1999) On the power-free parts of consecutive integers by B M M de Weger (Krimpen aan den IJssel) and C E van de Woestijne (Leiden) 1 Introduction and main results Considering the
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 information1 i<j k (g ih j g j h i ) 0.
CONSECUTIVE PRIMES IN TUPLES WILLIAM D. BANKS, TRISTAN FREIBERG, AND CAROLINE L. TURNAGE-BUTTERBAUGH Abstract. In a stunning new advance towards the Prime k-tuple Conjecture, Maynard and Tao have shown
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 informationCHAPTER 10: POLYNOMIALS (DRAFT)
CHAPTER 10: POLYNOMIALS (DRAFT) LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN The material in this chapter is fairly informal. Unlike earlier chapters, no attempt is made to rigorously
More informationA NOTE ON HENSEL S LEMMA IN SEVERAL VARIABLES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3185 3189 S 0002-9939(97)04112-9 A NOTE ON HENSEL S LEMMA IN SEVERAL VARIABLES BENJI FISHER (Communicated by
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 informationOn Picard value problem of some difference polynomials
Arab J Math 018 7:7 37 https://doiorg/101007/s40065-017-0189-x Arabian Journal o Mathematics Zinelâabidine Latreuch Benharrat Belaïdi On Picard value problem o some dierence polynomials Received: 4 April
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 informationOn a Closed Formula for the Derivatives of e f(x) and Related Financial Applications
International Mathematical Forum, 4, 9, no. 9, 41-47 On a Closed Formula or the Derivatives o e x) and Related Financial Applications Konstantinos Draais 1 UCD CASL, University College Dublin, Ireland
More informationGaussian integers. 1 = a 2 + b 2 = c 2 + d 2.
Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d
More information( x) f = where P and Q are polynomials.
9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational
More informationGalois theory (Part II)( ) Example Sheet 1
Galois theory (Part II)(2015 2016) Example Sheet 1 c.birkar@dpmms.cam.ac.uk (1) Find the minimal polynomial of 2 + 3 over Q. (2) Let K L be a finite field extension such that [L : K] is prime. Show that
More informationNUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:
NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two operations defined on them, addition and multiplication,
More informationThe density of rational points on cubic surfaces
ACTA ARITHMETICA LXXIX.1 (1997) The density of rational points on cubic surfaces by D. R. Heath-Brown (Oxford) For Professor J. W. S. Cassels on his 75th birthday 1. Introduction. Let F (W, X, Y, Z) Z[W,
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
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 informationNUMBER OF REPRESENTATIONS OF INTEGERS BY BINARY FORMS
NUMBER O REPRESENTATIONS O INTEGERS BY BINARY ORMS DIVYUM SHARMA AND N SARADHA Abstract We give improved upper bounds for the number of solutions of the Thue equation (x, y) = h where is an irreducible
More informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
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 informationHASSE-MINKOWSKI THEOREM
HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationAlgebra Review 2. 1 Fields. A field is an extension of the concept of a group.
Algebra Review 2 1 Fields A field is an extension of the concept of a group. Definition 1. A field (F, +,, 0 F, 1 F ) is a set F together with two binary operations (+, ) on F such that the following conditions
More informationTwo Diophantine Approaches to the Irreducibility of Certain Trinomials
Two Diophantine Approaches to the Irreducibility of Certain Trinomials M. Filaseta 1, F. Luca 2, P. Stănică 3, R.G. Underwood 3 1 Department of Mathematics, University of South Carolina Columbia, SC 29208;
More information198 VOLUME 46/47, NUMBER 3
LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson
More informationIn the index (pages ), reduce all page numbers by 2.
Errata or Nilpotence and periodicity in stable homotopy theory (Annals O Mathematics Study No. 28, Princeton University Press, 992) by Douglas C. Ravenel, July 2, 997, edition. Most o these were ound by
More informationSolutions of exercise sheet 6
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 6 1. (Irreducibility of the cyclotomic polynomial) Let n be a positive integer, and P Z[X] a monic irreducible factor of X n 1
More informationCoding Theory ( Mathematical Background I)
N.L.Manev, Lectures on Coding Theory (Maths I) p. 1/18 Coding Theory ( Mathematical Background I) Lector: Nikolai L. Manev Institute of Mathematics and Informatics, Sofia, Bulgaria N.L.Manev, Lectures
More informationSQUAREFREE VALUES OF MULTIVARIABLE POLYNOMIALS
SQUAREFREE VALUES OF MULTIVARIABLE POLYNOMIALS BJORN POONEN Abstract. Given f Z[x 1,..., x n ], we compute the density of x Z n such that fx) is squarefree, assuming the abc conjecture. Given f, g Z[x
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationHomework 7 solutions M328K by Mark Lindberg/Marie-Amelie Lawn
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)
More informationTHE ABC CONJECTURE, ARITHMETIC PROGRESSIONS OF PRIMES AND SQUAREFREE VALUES OF POLYNOMIALS AT PRIME ARGUMENTS
THE ABC CONJECTURE, ARITHMETIC PROGRESSIONS OF PRIMES AND SQUAREFREE VALUES OF POLYNOMIALS AT PRIME ARGUMENTS HECTOR PASTEN Abstract. On the ABC conjecture, we get an asymptotic estimate for the number
More informationSolutions to Homework for M351 Algebra I
Hwk 42: Solutions to Homework for M351 Algebra I In the ring Z[i], find a greatest common divisor of a = 16 + 2i and b = 14 + 31i, using repeated division with remainder in analogy to Problem 25. (Note
More informationProblem Set. Problems on Unordered Summation. Math 5323, Fall Februray 15, 2001 ANSWERS
Problem Set Problems on Unordered Summation Math 5323, Fall 2001 Februray 15, 2001 ANSWERS i 1 Unordered Sums o Real Terms In calculus and real analysis, one deines the convergence o an ininite series
More information18. Cyclotomic polynomials II
18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients
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 informationE-SYMMETRIC NUMBERS (PUBLISHED: COLLOQ. MATH., 103(2005), NO. 1, )
E-SYMMETRIC UMBERS PUBLISHED: COLLOQ. MATH., 032005), O., 7 25.) GAG YU Abstract A positive integer n is called E-symmetric if there exists a positive integer m such that m n = φm), φn)). n is called E-asymmetric
More informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More information1 The Galois Group of a Quadratic
Algebra Prelim Notes The Galois Group of a Polynomial Jason B. Hill University of Colorado at Boulder Throughout this set of notes, K will be the desired base field (usually Q or a finite field) and F
More informationMath 216A. A gluing construction of Proj(S)
Math 216A. A gluing construction o Proj(S) 1. Some basic deinitions Let S = n 0 S n be an N-graded ring (we ollows French terminology here, even though outside o France it is commonly accepted that N does
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 informationJosé Felipe Voloch. Abstract: We discuss the problem of constructing elements of multiplicative high
On the order of points on curves over finite fields José Felipe Voloch Abstract: We discuss the problem of constructing elements of multiplicative high order in finite fields of large degree over their
More informationCurve Sketching. The process of curve sketching can be performed in the following steps:
Curve Sketching So ar you have learned how to ind st and nd derivatives o unctions and use these derivatives to determine where a unction is:. Increasing/decreasing. Relative extrema 3. Concavity 4. Points
More informationLecture 7.5: Euclidean domains and algebraic integers
Lecture 7.5: Euclidean domains and algebraic integers Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley
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 informationOfficial Solutions 2014 Sun Life Financial CMO Qualifying Rêpechage 1
Official s 2014 Sun Life Financial CMO Qualifying Rêpechage 1 1. Let f : Z Z + be a function, and define h : Z Z Z + by h(x, y) = gcd(f(x), f(y)). If h(x, y) is a two-variable polynomial in x and y, prove
More informationTORSION POINTS ON CURVES. Andrew Granville Université de Montréal Zeev Rudnick Tel-Aviv University. 1. Introduction
TORSION POINTS ON CURVES Andrew Granville Université de Montréal Zeev Rudnick Tel-Aviv University. Introduction One of the themes of the summer school is the distribution of special points on varieties.
More informationA POSITIVE PROPORTION OF THUE EQUATIONS FAIL THE INTEGRAL HASSE PRINCIPLE
A POSITIVE PROPORTION OF THUE EQUATIONS FAIL THE INTEGRAL HASSE PRINCIPLE SHABNAM AKHTARI AND MANJUL BHARGAVA Abstract. For any nonzero h Z, we prove that a positive proportion of integral binary cubic
More informationAndrew Granville To Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers
PRIMITIVE PRIME FACTORS IN SECOND-ORDER LINEAR RECURRENCE SEQUENCES Andrew Granville To Andrzej Schinzel on his 75th birthday, with thanks for the many inspiring papers Abstract. For a class of Lucas sequences
More informationMath Circles: Number Theory III
Math Circles: Number Theory III Centre for Education in Mathematics and Computing University of Waterloo March 9, 2011 A prime-generating polynomial The polynomial f (n) = n 2 n + 41 generates a lot of
More informationAbstract Algebra: Chapters 16 and 17
Study polynomials, their factorization, and the construction of fields. Chapter 16 Polynomial Rings Notation Let R be a commutative ring. The ring of polynomials over R in the indeterminate x is the set
More information