A GENERALIZATION OF THE CONGRUENT NUMBER PROBLEM

Size: px
Start display at page:

Download "A GENERALIZATION OF THE CONGRUENT NUMBER PROBLEM"

Transcription

1 A GENERALIZATION OF THE CONGRUENT NUMBER PROBLEM LARRY ROLEN Abstract. We study a certain generalization of the classical Congruent Nuber Proble. Specifically, we study integer areas of rational triangles with an arbitrary fixed angle θ. These nubers are called θ-congruent. We give an elliptic curve criterion for deterining whether a given integer n is θ-congruent. We then consider the density of integers n which are θ-congruent, as well as the related proble giving the density of angles θ for which a fixed n is congruent. Assuing the Shafarevich-Tate conjecture, we prove that both proportions are at least 50% in the liit. To obtain our result we use the recently proven p-parity conjecture due to Monsky and the Dokchitsers as well as a theore of Helfgott on average root nubers in algebraic failies. 1. Introduction and Stateent of Results The study of right triangles with integer side lengths dates back to the work of Pythagoras and Euclid, and the ancients copletely classified such triangles. Another proble involving triangles with nice side lengths was first studied systeatically by the Arab atheaticians of the 10 th Century. This proble asks for a classification of all possible areas of right triangles with rational side lengths. A positive integer n is congruent if it is the area of a right triangle with all rational side lengths. In other words, there exist rational nubers a, b, c satisfying a + b = c ab = n. The proble of classifying congruent nubers reduces to the cases where n is square-free. We can scale areas trivially. We can easily generate exaples of congruent nubers; for exaple 6 is congruent and is given by the triangle. Classically, people were able to solve this proble in a few cases using exaples and eleentary techniques. For exaple, Ferat proved that 1 is not a congruent nuber and Euler was the first to find a triangle showing that 7 is. Given an arbitrary integer, however, it traditionally seeed hopeless to find a siple, general algorith to test for congruency. To deonstrate the potential coplexity of finding such triangles in general, consider the following exaple, due to Zagier. He coputed the siplest right triangle representing 157 as congruent. The author is an undergraduate at the University of Wisconsin ajoring in atheatics. He is grateful for the support provided by the NSF Research Training Grant in Nuber Theory (PI: Ono). He would also like to thank Ken Ono for his guidance and support. He also thanks David Brown for providing coents on an earlier draft of this paper. 1

2 LARRY ROLEN In this triangle, the hypotenuse is given by For ore on the history of the congruent nuber proble see [4]. The natural way to view this proble is in ters of rational points on elliptic curves. Naely, to every n we associate a corresponding elliptic curve E n whose Mordell-Weil group encodes the data of rational right triangles of area n. For each square-free positive integer n, we define the congruent nuber curve E n : y = x n x. There is a 1 correspondence between rational right triangles of area n and rational points (x, y) on E n with y 0. Now E n clearly has full -torsion as it contains the points O, (0, 0), ( n, 0), and (n, 0). It turns out that these are all of the torsion points; i.e En tors = Z/Z Z/Z. As a corollary, n is congruent if and only if rankq E n > 0. Using this characterization along with the Hasse-Weil L-function and theory of half-integral weight odular fors, Tunnell was able to derive the a rearkable classification of congruent nubers. Assuing the weak Birch and Swinnerton-Dyer (BSD) conjecture, he gives an equivalent condition for a nuber n to be congruent in ters of the nuber of representations of n by two quadratic fors; this condition ay be checked as quickly as in tie O(n 1 ) (for exaple, see [1][15].) We would like to consider a natural generalization of the congruent nuber proble. Naely, we will relax the condition that the triangle have a right angle and consider ore general angles. In analogy with the previous definition, let π θ π be an angle. 3 We say that a square-free integer n is θ-congruent if there exists a triangle whose largest angle is θ, whose side lengths are rational, and whose area is n. In other words, there exist rational a, b, c for which a + b ab cos θ = c ab sin θ = n b c θ a We say that an angle π/3 θ π is adissible if both sin θ and cos θ lie in Q. Following the classical paraeterization of rational points on the unit circle, define to be the slope of the line joining ( 1, 0) to (cos θ, sin θ). Call a rational nuber adissible if it corresponds to an adissible angle. Note that = 1 corresponds to θ = π/. Then the rational points on the circle are in one-to-one correspondence with rational choices of. It is easy to derive the forulae: cos θ = sin θ = 1 +. Henceforth the dependence of on θ will be iplicit. Thus, for every such rational > 3 we have a separate congruent nuber proble, with = 1 corresponding to 3 the classical congruent nuber proble. We are alost in position to give an elliptic curve criterion for the generalized congruent nuber proble. First we introduce soe language which pertains to the special case of certain angles. We say that an adissible Q is aberrant provided that + 1 Q. Otherwise, an adissible is called

3 A GENERALIZATION OF THE CONGRUENT NUMBER PROBLEM 3 generic. We can paraeterize all aberrant as follows. Begin with the paraeterization of Pythagorean triples of Euclid which states that any priitive triple is of the for (u v, uv, u + v ) for relatively prie (u, v). It easily follows that all aberrant ( ) ±1 can be written in the for for relatively prie integers u, v. u v uv To each aberrant, we can associate a (unique) square-free natural nuber n such that n Q and we call the pair (n, ) aberrant as well. Any other pair is tered generic. To any adissible pair (n, ) we associate the elliptic curve E n,θ given by the following Weierstrass equation: ( (1) E n,θ : y = x x n ) (x + n). Using this equation it is ore natural to paraeterize angles by the rational than an angle θ. For exaple, there is a duality between and 1 in the aberrant case which is uch less transparent in the θ-characterization. There are two special properties characterizing aberrant nubers which propt their nae. Note that there are no congruent equilateral triangles. The following two theores give the first exaple of the special aberrant behavior as well as our first exaple of a situation which cannot occur in the classical congruent nuber case (as is irrational): Theore 1.1. If (n, ) is aberrant, then n is a θ -congruent nuber and n can be represented by an isosceles θ -triangle. In fact, we can give a characterization of all isosceles triangles appearing in the generalized congruent nuber proble. Theore 1.. All isosceles triangles with rational side lengths and areas correspond to the aberrant case. One property of generalized congruent nuber case which reains the sae as the θ = π case is the following correspondence which translates our proble into one of coputing Mordell-Weil groups. Theore 1.3. For any positive square-free integer n and any adissible angle θ we have that n is θ-congruent if and only if E n,θ has a rational point (x, y) with y 0. Moreover, if (n, ) is generic there is a -1 correspondence of triangles representing the pair (n, ) and such points on E n,θ. In fact, (x, y) and (x, y ) correspond to the sae triangle if and only if x = x and y = ±y. In order to use the elliptic curve efficiently in our study we ust first copute the torsion subgroup of E n,θ. This will allow us to give the desired equivalent condition in ters of Mordell-Weil ranks. We prove the following classification: Theore 1.4. If (n, ) is aberrant, then En,θ tors (Q) = Z/Z Z/4Z. If (n, ) is generic, then En,θ tors (Q) = Z/Z Z/Z.

4 4 LARRY ROLEN Corollary 1.5. We have that (n, ) is a congruent pair if and only if (n, ) is aberrant or rank Q E n,θ (Q) > 0. In this paper, we would like to analyze a different aspect of the proble fro that considered by Tunnell. Although it reains a difficult proble to deterine general conditions to test for congruent nubers (even parts of the classical congruent nuber proble resolution reain conjectural), we are still able to ake general stateents about the distribution of such points. There are two natural failies to consider along with the following questions. Question 1. If we fix and let the area n vary, how often is (n, ) congruent? Question. If we fix the area n and let vary, how often is (n, ) congruent? For each area n, there is at least one angle aking n a θ -congruent nuber. To see this, note that ( n+, n 4) is a rational point on E 4 n, n with non-zero y-coordinate 4 unless n =. For n =, (9/, 15) is a rational point on E,4 so is 4-congruent. A natural question is if for each n there are infinitely any angles which ake n congruent. Even better, we would like to say as uch as we can pertaining to approxiately how often nubers are congruent or not. To this end, we let h (x) be the proportion of positive square-free integers n not exceeding x for which (n, ) is a congruent pair and v n (x) the proportion of with height at ost x for which (n, ) is a congruent pair. More precisely, () h (x) := #{1 n x, : n is θ -congruent and n is square-free} #{1 n x : n is square-free} (3) v n (x) := #{ Q : h() n and n is θ -congruent} #{ Q : h() n} where for any rational nuber written in lowest ters h( a ) := ax{ a, b }. Then we b prove the following: Theore 1.6. Suppose the Shafarevich-Tate conjecture is true for all elliptic curves of rank 0. Then for each ɛ > 0, if x ɛ 0 then 1 ɛ h (x) < 1 ɛ That is, when we fix the angle and let the area n vary, at least 1/ of the choices for n are congruent and a positive density are non-congruent. Fixing n and letting vary, we also obtain the following: Theore 1.7. Suppose the Shafarevich-Tate conjecture is true for all elliptic curves of rank 0. Then for each ɛ > 0, if x ɛ 0 then 1 ɛ v n(x) 1 ɛ. The paper is organized as follows. In we will prove Theores , establishing the equivalent condition for congruence in ters of ranks of elliptic curves. In 3, we prove the density results Theore 1.6 and Theore 1.7. These rely on a theore of Yu for quadratic twists giving the upper bound in Theore 1.7 and a rearkable new

5 A GENERALIZATION OF THE CONGRUENT NUMBER PROBLEM 5 result of the Dokchitser brothers which proves the p-parity conjecture in the case when p is odd (the case where p = being previously solved by Monsky) in conjunction with a paper of Helfgott providing sufficient conditions for algebraic failies of elliptic curves to have average root nuber zero [16],[5],[8],[11].. Proof of the Elliptic Curve Criterion and Coputation of Torsion Subgroups for E n,θ. In this section, we prove the theores necessary to reduce the generalized congruent nuber proble to one of coputing the rank of E n,θ. We begin by establishing the connection between E n,θ (Q) and congruent nubers..1. Connecting E n,θ to θ -Congruent Nubers. We begin with a proof of Theore 1.1. Suppose (n, ) is aberrant. Then as n is a square, so is n. It is siple to n( check that the triangle with side lengths a = b = +1), c = n has angle θ and area n. To finish the characterization of isosceles congruent nuber triangles in Theore 1., suppose that a = b. By the law of cosines ( ) c = a a = 4a. + 1 We can write + 1 = ( a c ). Now by the area forula we can rewrite n = a, 1+ establishing the aberrance of (n, ). We proceed to establish the elliptic curve condition in the generic case as per Theore 1.3. Thus, suppose n is θ -congruent. Then define (x, y) := ( c, b c a c). In the generic 4 8 case, the triangle cannot be isosceles by Theore 1. and hence a b giving y 0. It is trivial to verify that this point indeed lies on E n,θ. Conversely, given a rational point (x, y) with non-zero y coordinate, define a triangle with side lengths a = n( x + x) y, b = (x + n)(x n) y, c = x + n y. Note that if (n, ) is an aberrant pair, then by Theore 1.4 the torsion subgroup is Z/Z Z/4Z. This is aberrant by Theore 1.1 and evidently contains a torsion point with y 0, proving Theore Coputing the Torsion Subgroups. In this section we copute the torsion subgroup of E n,θ : y = x(x n )(x + n) = x3 + n( 1) x n x. First choose 0 α Z such that α n, α n 3 are both integral. Then by the change of variables (x, y) ((α) x, (α) 3 y) this curve is isoorphic (over Q) to y =

6 6 LARRY ROLEN x 3 + α n( 1)x α 4 4 n x. If we define M := n 3 α and N := nα, we can write the curve in the for y = x 3 + (M + N)x + MNx with M and N integral. Now there is a coplete characterization of torsion subgroups of curves of this for in [1]. Note that they all have full -torsion, so by Mazur s Theore the torsion subgroup is of the for Z/Z Z/nZ for n {1,, 3, 4}. Theore.1. (Ono [1]). The following criteria uniquely deterine the torsion subgroups of E(M, N) : y = x 3 + (M + N)x + MNx. E(M, N) tors contains Z/Z Z/4Z if M and N are both squares, or M and N M are both squares or N and M N are both squares. E(M, N) tors = Z/Z Z/8Z if there exists a non-zero integer d such that M = d u 4 and N = d v 4, or M = d v 4 and N = d (u 4 v 4 ), or M = d (u 4 v 4 ) and N = d v 4 where (u, v, w) fors a Pythagorean triple (i.e. u + v = w ). E(M, N) tors = Z/Z Z/6Z if there exist integers a, b such that a b {, 1, 1 and M = a 4 + a 3 b and N = ab 3 + b 4. Otherwise, E(M, N) tors = Z/Z Z/Z. We continue by checking the conditions outlined there. To check if the torsion subgroup contains Z/Z Z/4Z, note first that neither N nor M can be a square as both n, are positive. Thus, the torsion subgroup will have a 4-torsion point if and only if N = nα and M N = α n( + 1) are both squares. This is clearly equivalent to the aberrant condition. Thus, in the generic case, there can be no 4-torsion. Let us rule out the possibility of 8-torsion. Suppose the torsion subgroup is Z/Z Z/8Z. Then again by sign considerations neither N nor M are squares and so this happens if and only if we can write M = d (u 4 v 4 ) and N = d v 4 for a non-zero integer d and a Pythagorean triple (u, v, w). In this case, we have M = N = v4 u 4 = 1 ( u v 4 v )4 and so 1 + is a rational fourth power. I clai that this is not possible. For suppose 1 + ( c d ) = ( e f )4 with c, d, e, f integral. Then (f c) + (f d) = (e d) and so f 4 c = d (e 4 f 4 ). But this forces e 4 f 4 to be a perfect square g and hence gives a Pythagorean triple (g, f, e ), which is ipossible as it is well-known that a Pythagorean triple can contain at ost one square (as was shown by Ferat). To finish the characterization of the torsion subgroups, we have only to exlude the possibility Z/Z Z/6Z. Suppose we have a, b as in the Theore. In this case, if we have M = a a +ab = N b b +ab and so we can write a +ab = c for c, d Z. By rearranging and considering this as a quadratic equation in the variable a, by the quadratic b +ab d forula the discriinant ust be integral and this gives that c 4 + d 4 c d ust be a perfect square. This is a special case of a well-studied class of equations. In particular, Diophantine equations of the for x 4 + nx y + y 4 = z have been studied intensely for over 300 years. Ferat s proof that there are no nontrivial integral solutions when n = 0 is a classic exaple of infinite descent, and when n = 1 this equation is central to the well-known proof that four perfect squares cannot lie in arithetic progression. The only integral solutions occur when cd = 0 or c = d. An eleentary proof of this, 0, 1}

7 A GENERALIZATION OF THE CONGRUENT NUMBER PROBLEM 7 fact ay be found in [13]. Then if cd = 0, d 0 and so c = 0 giving = 0, which is a contradiction. In the latter case, we also have that a = b and so = 1 giving = 1. But the case = 1 was already proven to have no 3-torsion in Lea 1, being the classical congruent nuber case. 3. Proof of Density Results In this section we prove Theores 1.7 and 1.8 describing the average behavior of congruent nubers in one-paraeter failies. This will be done by coputing averages of root nubers and using the parity conjecture A Sufficient Condition for Lower Bounds. In order to describe the proof, we first need to discuss a faous conjecture on the parity of ranks of elliptic curves. Let us recall that every elliptic curve has an associated Hasse-Weil L-function which provides the connection to odular fors in the Modularity Theore of Wiles, Taylor, et. al and whose value at s = 1 conjecturally (BSD) gives the rank of E. For each prie p, let N(p) be the nuber of points (including the point at infinity) of the reduced curve E p. Then set a(p) := p + 1 N(p). Finally, define the L-series by the Euler product: L(E, s) := n=1 a(n) n s = p a(p)p s 1 a(p)p s + p, 1 s where denotes the inial discriinant of E. This L-function can be analytically continued to an entire function, as proven by Wiles et al. It also has a special syetry which is expressed in the functional equation: N s E (π)s Γ( s)l(e, s) = W (E)N s E (π) s Γ(s)L(E, s). Here N E is the conductor of E and W (E) = ±1 is the root nuber of E. It is expected that the root nuber controls the parity of the rank of E. Specifically, the following is also an iediate consequence of BSD: Conjecture. (Parity) For any elliptic curve E/Q, W (E) = ( 1) rk Q(E) In certain cases, the parity conjecture ay be shown to be true unconditionally. In particular, a powerful new result of Doskchitser proving the p-parity conjecture has the following corollary: Theore 3.1. (Corollary 4.0 of Dokchitser [5]) If E/Q is an elliptic curve, either the parity conjecture is true for E or X(E/Q) contains a copy of Q/Z. Here X(E/Q) is the group of hoogenous spaces for E/Q which have a solution in every copletion of Q odulo equivalence. Together with the Seler group it easures how badly the Hasse principle fails for E (i.e. the inability to lift solutions over every copletion to a solution over the global field). As a corollary to Theore 3.1, we now state our sufficient condition for the density lower bounds in Theores 1.6 and 1.7. p

8 8 LARRY ROLEN Theore 3.. If a faily of elliptic curves over Q has average root nuber 0 and the Shafarevich-Tate Conjecture is true for elliptic curves of rank 0, then the proportion of rank 0 curves in this faily is at ost 1. Proof. If X(E)/Q is finite and rank(e(q)) is zero, then E will have positive root nuber by the previous theore. Given that the average root nuber is zero, the total proportion of positive root nuber curves is 1 and so the proportion of rank 0 curves cannot exceed this aount. 3.. Proof of Theore 1.6. We are now in position to prove the bounds on the proportion of quadratic twists with positive rank stated in Theore 1.6. For the lower bound, we recall the well-known fact that the average root nuber in failies of quadratic twists is 0. For the upper bound, we apply a theore of Yu. This is proven by coputing the average -Seler group size. The result follows fro the Dokchitsers result and the proof of the p-parity conjecture for the case p = [11]. Theore 3.3. (Yu [16]) Let E/Q be an elliptic curve with torsion subgroup containing Z/Z Z/Z. Then a positive proportion of quadratic twists have rank 0. By Theore 1.4, our curves always satisfy this condition as (, 1) is never aberrant by the paraeterization of all aberrant pairs stated in the introduction Proof of Theore 1.7. To prove the lower bound on the proportion of positiverank curves in the faily of curves obtained by fixing the area n, we need a ore general theore describing average root nubers in elliptic fibrations. Although in our case the following conjectures will hold unconditionally, let us state the following hypotheses which relate to classical arithetic conjectures. Hypothesis. (A) Let P (x, y) be a hoogenous polynoial. Then only for a zero proportion of all pairs of coprie integers (x, y) do we have a prie p > ax{x, y} such that p P (x, y). It is believed that this is true for all such square-free P. In particular, this is iplied by the abc-conjecture [7]. Fortunately in our case, it has been proven unconditionally true whenever P has no irreducible factor of degree exceeding 6 [10]. Another hypothesis we will need is: Hypothesis. (B) Let λ(n) := p n ( 1) νp(n) be the Liouville function. Then λ(p (x, y)) has strong zero average over Z. Chowla has conjectured that this holds for all non-constant, square-free hoogenous polynoials P []. The prie nuber theore is essentially equivalent to the case where deg(p ) = 1, and it has been proven unconditionally whenever deg(p ) = 1,, 3 [9].

9 A GENERALIZATION OF THE CONGRUENT NUMBER PROBLEM 9 Now if we have an elliptic curve E over Q(t), we can for two polynoials fored by a product over the places of bad reduction based on type: M E := P ν, B E := P ν. E has ult. red. at ν E has q. bad red. at ν Here P ν := y if ν is the infinite place and otherwise P ν := y deg(q) Q( x ) for the irreducible y polynoial Q inducing ν. We also say a curve has quite bad (q. bad) reduction at a place if every quadratic twist also has bad reduction at the sae place. We are ready to state the sufficient conditions for coputing our average of root nubers: Theore 3.4. (Helfgott [8]) Let E be an elliptic curve over Q(t). Suppose M E 1 (i.e. E has a point of ultiplicative reduction). Suppose further that Hypothesis A holds for B E and Hypothesis B holds for M E. Then the strong average over Q of W (E t ) of the fibres exists and is 0. Let us observe how this applies to our case. Our faily of elliptic curves with varying is an elliptic curve over Q(t) with t =. First we calculate the usual constants associated to this curve: c 4 = 16n ( + 1)( + + 1)), c 6 = 3n3 ( 1)( + 1)( + )( + 1) 3 = 16n6 ( + 1) Thus, the curve has bad reduction at three places: {,, + 1}. By checking the valuation criteria for reduction type, we find that M E = x + y and B E = xy(x + y ). Fro the above rearks, the required hypothesis on M E, B E hold unconditionally and so Helfgott s theore applies to show the strong average of root nubers is zero. The exact stateent of what strong average eans is coplicated, but it is a certain notion of average which does not depend on which intervals in Q we saple or how we add ters (a precise definition ay be found in Helfgott). In particular it is clearly a strict enough notion to give us the conditions we need to apply our Lea and conclude the truth of Theore Discussion of Conjectural Densities. Although we are only able to bound the densities as in Theores 1.6 and 1.7, in fact uch ore is believed to be true. For exaple, we have the following well-known hypothesis Conjecture. (Goldfeld [6]) For any faily of quadratic twists, the proportion of curves with rank 0 is 50% and the proportion of curves with rank 1 is 50%. All higher ranks occur only with density 0. In particular, for any faily of quadratic twists and any other reasonable faily of curves such as the second faily with the area n fixed and the angle varying, it is believed that a siilar heuristic should hold. In particular, we ake the following:

10 10 LARRY ROLEN Conjecture 1. For each positive, square-free integer n, (n, ) is not a congruent pair for a positive proportion of angles. For the faily of curves we are considering, the generic rank is 0. The following is a plausible conjecture: Conjecture. (Density). Let E be an elliptic curve over Q(t) and generic rank n. Then only a zero proportion of fibers have rank at least n +. We also say that a curve has elevated rank if only finitely any fibers have generic rank. Thus, our conjecture iplies that the faily of curves does not have elevated rank. For suitably anipulated failies, the rank has been shown to be elevated (see [3] for a discussion of known ethods for constructing exaples). All such proofs rely heavily on the fact that these failies are isotrivial, eaning that the j-invariant j(e) Q does not depend on t. It is believed no non-isotrivial failies can have elevated rank. In particular an arithetic conjecture known as the square-free-conjecture iplies that the average root nuber of a non-isotrivial faily is not ±1 [3]. Thus, our conjecture would follow fro the square-free and density conjectures (assuing the parity conjecture for rank 0 curves). If the full parity conjecture is further assued, there would be no nonisotrivial failies of elevated rank over Q. We also note that, assuing the parity conjecture is true for rank 1 curves, the conjecture would follow if we could bound the average rank strictly by 3. If this could be shown it would constitute the first exaple of a non-quadratic twist elliptic fibration which is known to have average rank not exceeding 3. We can say, assuing a few conjectures such as BSD and the Generalized Rieann Hypothesis, that a Theore of Silveran tells us that the average rank is no larger than 5 [14]. Thus, although the conjecture is alost certainly true, a powerful new theore would be required to say this with certainty. We conclude with a sall table of data illustrating the plausibility of the conjecture as coputed in Sage. Table 1. Ranks for = 1,,..., 100 rank=0 1 3 n= n= n= n= n= References [1] E. Bach and N. Ryan. Efficient Verification of Tunnell s Criterion. Japan J. Indust. Appl. Math., Volue 4, Nuber 3 (007), [] S. Chowla. The Rieann Hypothesis and Hilbert s Tenth Proble. Matheatics and its Applications, Vol. 4 Gordon and Breach Science Publishers, New York-London-Paris, 1965.

11 A GENERALIZATION OF THE CONGRUENT NUMBER PROBLEM 11 [3] B. Conrad, K. Conrad, and H. Helfgott. Root Nubers and Ranks in Positive Characteristic. Adv. Math., 198 (005), pp [4] L.E. Dickson. History of the Theory of Nubers. Volue II, Chapter XVI, Dover Publications. [5] T. Dokchitser and V. Dokchitser. On the Birch-Swinnerton-Dyer quotients odulo squares. Annals of Math. 17 no. 1 (010), [6] D. Goldfeld. Conjectures on elliptic curves over quadratic fields. Nuber Theory, Carbondale, [7] A. Granville. ABC allows us to count squarefrees.. Inernat. Math. Res. Notices, 1998, [8] H. Helfgott. On the Behaviour of Root Nubers in Failies of Elliptic Curves. preprint, arxiv.org:ath.nt/ [9] H. Helfgott. The Parity Proble for Irreducible Cubic Fors. preprint, arxiv.org:ath/ v1. [10] H. Helfgott. On the square-free sieve. Acta Arithetica, 115 (004) pp [11] P. Monsky, Generalizing the Birch-Stephens theore. I: Modular curves, Math. Z., 1 (1996), [1] K. Ono. Euler s Concordant Fors. Acta Arithetica 65, 1996, pp [13] H. C. Pocklington. Soe Diophantine Ipossibilities. Proc. Cab. Phil. Soc., 17 (1914), [14] J. Silveran. The average rank of an algebraic faily of elliptic curves. J. Reine Agnew. Math. 504 (1988), [15] J. Tunnell. A classical Diophantine proble and odular fors of weight 3/. Inventiones Matheaticae, (): 33Ð334 [16] G. Yu. Rank 0 Quadratic Twists of a Faily of Elliptic Curves. Coposito Matheatica, Volue 135, Nuber 3, (003). Departent of Matheatics, University of Wisconsin, Madison, Wisconsin E-ail address: [email protected]

Alex, I will take congruent numbers for one million dollars please

Alex, I will take congruent numbers for one million dollars please Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 [email protected] One of the most alluring aspectives of number theory

More information

PYTHAGOREAN TRIPLES KEITH CONRAD

PYTHAGOREAN 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 information

Congruent Number Problem

Congruent Number Problem University of Waterloo October 28th, 2015 Number Theory Number theory, can be described as the mathematics of discovering and explaining patterns in numbers. There is nothing in the world which pleases

More information

THE CONGRUENT NUMBER PROBLEM

THE CONGRUENT NUMBER PROBLEM THE CONGRUENT NUMBER PROBLEM KEITH CONRAD 1. Introduction A right triangle is called rational when its legs and hypotenuse are all rational numbers. Examples of rational right triangles include Pythagorean

More information

ON SELF-ROUTING IN CLOS CONNECTION NETWORKS. BARRY G. DOUGLASS Electrical Engineering Department Texas A&M University College Station, TX 77843-3128

ON SELF-ROUTING IN CLOS CONNECTION NETWORKS. BARRY G. DOUGLASS Electrical Engineering Department Texas A&M University College Station, TX 77843-3128 ON SELF-ROUTING IN CLOS CONNECTION NETWORKS BARRY G. DOUGLASS Electrical Engineering Departent Texas A&M University College Station, TX 778-8 A. YAVUZ ORUÇ Electrical Engineering Departent and Institute

More information

arxiv:0805.1434v1 [math.pr] 9 May 2008

arxiv:0805.1434v1 [math.pr] 9 May 2008 Degree-distribution stability of scale-free networs Zhenting Hou, Xiangxing Kong, Dinghua Shi,2, and Guanrong Chen 3 School of Matheatics, Central South University, Changsha 40083, China 2 Departent of

More information

Physics 211: Lab Oscillations. Simple Harmonic Motion.

Physics 211: Lab Oscillations. Simple Harmonic Motion. Physics 11: Lab Oscillations. Siple Haronic Motion. Reading Assignent: Chapter 15 Introduction: As we learned in class, physical systes will undergo an oscillatory otion, when displaced fro a stable equilibriu.

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

THE BIRCH AND SWINNERTON-DYER CONJECTURE

THE BIRCH AND SWINNERTON-DYER CONJECTURE THE BIRCH AND SWINNERTON-DYER CONJECTURE ANDREW WILES A polynomial relation f(x, y) = 0 in two variables defines a curve C 0. If the coefficients of the polynomial are rational numbers, then one can ask

More information

Calculating the Return on Investment (ROI) for DMSMS Management. The Problem with Cost Avoidance

Calculating the Return on Investment (ROI) for DMSMS Management. The Problem with Cost Avoidance Calculating the Return on nvestent () for DMSMS Manageent Peter Sandborn CALCE, Departent of Mechanical Engineering (31) 45-3167 [email protected] www.ene.ud.edu/escml/obsolescence.ht October 28, 21

More information

4.2 Euclid s Classification of Pythagorean Triples

4.2 Euclid s Classification of Pythagorean Triples 178 4. Number Theory: Fermat s Last Theorem Exercise 4.7: A primitive Pythagorean triple is one in which any two of the three numbers are relatively prime. Show that every multiple of a Pythagorean triple

More information

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Ameya Pitale, Ralf Schmidt 2 Abstract Let µ(n), n > 0, be the sequence of Hecke eigenvalues of a cuspidal Siegel eigenform F of degree

More information

The Velocities of Gas Molecules

The Velocities of Gas Molecules he Velocities of Gas Molecules by Flick Colean Departent of Cheistry Wellesley College Wellesley MA 8 Copyright Flick Colean 996 All rights reserved You are welcoe to use this docuent in your own classes

More information

On the largest prime factor of x 2 1

On the largest prime factor of x 2 1 On the largest prime factor of x 2 1 Florian Luca and Filip Najman Abstract In this paper, we find all integers x such that x 2 1 has only prime factors smaller than 100. This gives some interesting numerical

More information

Prime numbers and prime polynomials. Paul Pollack Dartmouth College

Prime numbers and prime polynomials. Paul Pollack Dartmouth College Prime numbers and prime polynomials Paul Pollack Dartmouth College May 1, 2008 Analogies everywhere! Analogies in elementary number theory (continued fractions, quadratic reciprocity, Fermat s last theorem)

More information

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

More information

4. How many integers between 2004 and 4002 are perfect squares?

4. How many integers between 2004 and 4002 are perfect squares? 5 is 0% of what number? What is the value of + 3 4 + 99 00? (alternating signs) 3 A frog is at the bottom of a well 0 feet deep It climbs up 3 feet every day, but slides back feet each night If it started

More information

Settling a Question about Pythagorean Triples

Settling a Question about Pythagorean Triples Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:

More information

Data Set Generation for Rectangular Placement Problems

Data Set Generation for Rectangular Placement Problems Data Set Generation for Rectangular Placeent Probles Christine L. Valenzuela (Muford) Pearl Y. Wang School of Coputer Science & Inforatics Departent of Coputer Science MS 4A5 Cardiff University George

More information

Factor Model. Arbitrage Pricing Theory. Systematic Versus Non-Systematic Risk. Intuitive Argument

Factor Model. Arbitrage Pricing Theory. Systematic Versus Non-Systematic Risk. Intuitive Argument Ross [1],[]) presents the aritrage pricing theory. The idea is that the structure of asset returns leads naturally to a odel of risk preia, for otherwise there would exist an opportunity for aritrage profit.

More information

1 if 1 x 0 1 if 0 x 1

1 if 1 x 0 1 if 0 x 1 Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

More information

Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

More information

MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

More information

Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

More information

Problem Set 2: Solutions ECON 301: Intermediate Microeconomics Prof. Marek Weretka. Problem 1 (Marginal Rate of Substitution)

Problem Set 2: Solutions ECON 301: Intermediate Microeconomics Prof. Marek Weretka. Problem 1 (Marginal Rate of Substitution) Proble Set 2: Solutions ECON 30: Interediate Microeconoics Prof. Marek Weretka Proble (Marginal Rate of Substitution) (a) For the third colun, recall that by definition MRS(x, x 2 ) = ( ) U x ( U ). x

More information

How To Get A Loan From A Bank For Free

How To Get A Loan From A Bank For Free Finance 111 Finance We have to work with oney every day. While balancing your checkbook or calculating your onthly expenditures on espresso requires only arithetic, when we start saving, planning for retireent,

More information

Introduction to Unit Conversion: the SI

Introduction to Unit Conversion: the SI The Matheatics 11 Copetency Test Introduction to Unit Conversion: the SI In this the next docuent in this series is presented illustrated an effective reliable approach to carryin out unit conversions

More information

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

More information

Five fundamental operations. mathematics: addition, subtraction, multiplication, division, and modular forms

Five fundamental operations. mathematics: addition, subtraction, multiplication, division, and modular forms The five fundamental operations of mathematics: addition, subtraction, multiplication, division, and modular forms UC Berkeley Trinity University March 31, 2008 This talk is about counting, and it s about

More information

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

More information

Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

More information

Homework until Test #2

Homework until Test #2 MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

More information

Quotient Rings and Field Extensions

Quotient Rings and Field Extensions Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

More information

The Virtual Spring Mass System

The Virtual Spring Mass System The Virtual Spring Mass Syste J. S. Freudenberg EECS 6 Ebedded Control Systes Huan Coputer Interaction A force feedbac syste, such as the haptic heel used in the EECS 6 lab, is capable of exhibiting a

More information

5.7 Chebyshev Multi-section Matching Transformer

5.7 Chebyshev Multi-section Matching Transformer /9/ 5_7 Chebyshev Multisection Matching Transforers / 5.7 Chebyshev Multi-section Matching Transforer Reading Assignent: pp. 5-55 We can also build a ultisection atching network such that Γ f is a Chebyshev

More information

k, then n = p2α 1 1 pα k

k, then n = p2α 1 1 pα k Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

More information

A Study on the Necessary Conditions for Odd Perfect Numbers

A Study on the Necessary Conditions for Odd Perfect Numbers A Study on the Necessary Conditions for Odd Perfect Numbers Ben Stevens U63750064 Abstract A collection of all of the known necessary conditions for an odd perfect number to exist, along with brief descriptions

More information

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a

More information

SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

More information

Zeros of a Polynomial Function

Zeros of a Polynomial Function Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we

More information

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

More information

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12 CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

More information

Algebraic and Transcendental Numbers

Algebraic and Transcendental Numbers Pondicherry University July 2000 Algebraic and Transcendental Numbers Stéphane Fischler This text is meant to be an introduction to algebraic and transcendental numbers. For a detailed (though elementary)

More information

MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao [email protected]

MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu Integer Polynomials June 9, 007 Yufei Zhao [email protected] We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing

More information

11 Ideals. 11.1 Revisiting Z

11 Ideals. 11.1 Revisiting Z 11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

More information

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

More information

Answer, Key Homework 7 David McIntyre 45123 Mar 25, 2004 1

Answer, Key Homework 7 David McIntyre 45123 Mar 25, 2004 1 Answer, Key Hoework 7 David McIntyre 453 Mar 5, 004 This print-out should have 4 questions. Multiple-choice questions ay continue on the next colun or page find all choices before aking your selection.

More information

2010 Solutions. a + b. a + b 1. (a + b)2 + (b a) 2. (b2 + a 2 ) 2 (a 2 b 2 ) 2

2010 Solutions. a + b. a + b 1. (a + b)2 + (b a) 2. (b2 + a 2 ) 2 (a 2 b 2 ) 2 00 Problem If a and b are nonzero real numbers such that a b, compute the value of the expression ( ) ( b a + a a + b b b a + b a ) ( + ) a b b a + b a +. b a a b Answer: 8. Solution: Let s simplify the

More information

Inner Product Spaces

Inner Product Spaces Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

More information

PROOFS BY DESCENT KEITH CONRAD

PROOFS BY DESCENT KEITH CONRAD PROOFS BY DESCENT KEITH CONRAD As ordinary methods, such as are found in the books, are inadequate to proving such difficult propositions, I discovered at last a most singular method... that I called the

More information

Online Bagging and Boosting

Online Bagging and Boosting Abstract Bagging and boosting are two of the ost well-known enseble learning ethods due to their theoretical perforance guarantees and strong experiental results. However, these algoriths have been used

More information

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4) ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x

More information

Lesson 44: Acceleration, Velocity, and Period in SHM

Lesson 44: Acceleration, Velocity, and Period in SHM Lesson 44: Acceleration, Velocity, and Period in SHM Since there is a restoring force acting on objects in SHM it akes sense that the object will accelerate. In Physics 20 you are only required to explain

More information

Copyrighted Material. Chapter 1 DEGREE OF A CURVE

Copyrighted Material. Chapter 1 DEGREE OF A CURVE Chapter 1 DEGREE OF A CURVE Road Map The idea of degree is a fundamental concept, which will take us several chapters to explore in depth. We begin by explaining what an algebraic curve is, and offer two

More information

Continued Fractions. Darren C. Collins

Continued Fractions. Darren C. Collins Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history

More information

OSTROWSKI FOR NUMBER FIELDS

OSTROWSKI FOR NUMBER FIELDS OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD Ostrowski classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the p-adic absolute values for

More information

A Gas Law And Absolute Zero Lab 11

A Gas Law And Absolute Zero Lab 11 HB 04-06-05 A Gas Law And Absolute Zero Lab 11 1 A Gas Law And Absolute Zero Lab 11 Equipent safety goggles, SWS, gas bulb with pressure gauge, 10 C to +110 C theroeter, 100 C to +50 C theroeter. Caution

More information

Homework 2 Solutions

Homework 2 Solutions Homework Solutions 1. (a) Find the area of a regular heagon inscribed in a circle of radius 1. Then, find the area of a regular heagon circumscribed about a circle of radius 1. Use these calculations to

More information

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

More information

Lecture L26-3D Rigid Body Dynamics: The Inertia Tensor

Lecture L26-3D Rigid Body Dynamics: The Inertia Tensor J. Peraire, S. Widnall 16.07 Dynaics Fall 008 Lecture L6-3D Rigid Body Dynaics: The Inertia Tensor Version.1 In this lecture, we will derive an expression for the angular oentu of a 3D rigid body. We shall

More information

Lecture L9 - Linear Impulse and Momentum. Collisions

Lecture L9 - Linear Impulse and Momentum. Collisions J. Peraire, S. Widnall 16.07 Dynaics Fall 009 Version.0 Lecture L9 - Linear Ipulse and Moentu. Collisions In this lecture, we will consider the equations that result fro integrating Newton s second law,

More information

The Method of Partial Fractions Math 121 Calculus II Spring 2015

The Method of Partial Fractions Math 121 Calculus II Spring 2015 Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method

More information

TOPIC 4: DERIVATIVES

TOPIC 4: DERIVATIVES TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the

More information

Solutions to Exercises, Section 5.1

Solutions to Exercises, Section 5.1 Instructor s Solutions Manual, Section 5.1 Exercise 1 Solutions to Exercises, Section 5.1 1. Find all numbers t such that ( 1 3,t) is a point on the unit circle. For ( 1 3,t)to be a point on the unit circle

More information

6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives

6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives 6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise

More information

Recent work on Serre s conjectures

Recent work on Serre s conjectures Recent work on Serre s conjectures Kenneth A. Ribet University of California, Berkeley June 4, 2005 Canadian Math Society Summer Meeting This talk concerns a new chapter in a story that began in the late

More information

INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

More information

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5. PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

More information

Solutions to Homework 10

Solutions to Homework 10 Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x

More information

2. FINDING A SOLUTION

2. FINDING A SOLUTION The 7 th Balan Conference on Operational Research BACOR 5 Constanta, May 5, Roania OPTIMAL TIME AND SPACE COMPLEXITY ALGORITHM FOR CONSTRUCTION OF ALL BINARY TREES FROM PRE-ORDER AND POST-ORDER TRAVERSALS

More information

ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM

ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM DANIEL PARKER Abstract. This paper provides a foundation for understanding Lenstra s Elliptic Curve Algorithm for factoring large numbers. We give

More information

Fuzzy Sets in HR Management

Fuzzy Sets in HR Management Acta Polytechnica Hungarica Vol. 8, No. 3, 2011 Fuzzy Sets in HR Manageent Blanka Zeková AXIOM SW, s.r.o., 760 01 Zlín, Czech Republic [email protected] Jana Talašová Faculty of Science, Palacký Univerzity,

More information

DigitalCommons@University of Nebraska - Lincoln

DigitalCommons@University of Nebraska - Lincoln University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-1-007 Pythagorean Triples Diane Swartzlander University

More information

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors. The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

More information

Halloween Costume Ideas for the Wii Game

Halloween Costume Ideas for the Wii Game Algorithica 2001) 30: 101 139 DOI: 101007/s00453-001-0003-0 Algorithica 2001 Springer-Verlag New York Inc Optial Search and One-Way Trading Online Algoriths R El-Yaniv, 1 A Fiat, 2 R M Karp, 3 and G Turpin

More information

CHAPTER 5 Round-off errors

CHAPTER 5 Round-off errors CHAPTER 5 Round-off errors In the two previous chapters we have seen how numbers can be represented in the binary numeral system and how this is the basis for representing numbers in computers. Since any

More information

1.7 Graphs of Functions

1.7 Graphs of Functions 64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most

More information

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal

More information

Machine Learning Applications in Grid Computing

Machine Learning Applications in Grid Computing Machine Learning Applications in Grid Coputing George Cybenko, Guofei Jiang and Daniel Bilar Thayer School of Engineering Dartouth College Hanover, NH 03755, USA [email protected], [email protected]

More information

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)! Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

More information

A quantum secret ballot. Abstract

A quantum secret ballot. Abstract A quantu secret ballot Shahar Dolev and Itaar Pitowsky The Edelstein Center, Levi Building, The Hebrerw University, Givat Ra, Jerusale, Israel Boaz Tair arxiv:quant-ph/060087v 8 Mar 006 Departent of Philosophy

More information

CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 Solutions CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

More information

Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

More information

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. 1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: [email protected] Proof: For any element x of the empty set, x is also an element of every set since

More information

Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

More information

SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

More information

Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions

Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Stanford Math Circle: Sunday, May 9, 00 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in

More information

5.3 SOLVING TRIGONOMETRIC EQUATIONS. Copyright Cengage Learning. All rights reserved.

5.3 SOLVING TRIGONOMETRIC EQUATIONS. Copyright Cengage Learning. All rights reserved. 5.3 SOLVING TRIGONOMETRIC EQUATIONS Copyright Cengage Learning. All rights reserved. What You Should Learn Use standard algebraic techniques to solve trigonometric equations. Solve trigonometric equations

More information

The Mathematics of Pumping Water

The Mathematics of Pumping Water The Matheatics of Puping Water AECOM Design Build Civil, Mechanical Engineering INTRODUCTION Please observe the conversion of units in calculations throughout this exeplar. In any puping syste, the role

More information

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

More information

Experiment 2 Index of refraction of an unknown liquid --- Abbe Refractometer

Experiment 2 Index of refraction of an unknown liquid --- Abbe Refractometer Experient Index of refraction of an unknown liquid --- Abbe Refractoeter Principle: The value n ay be written in the for sin ( δ +θ ) n =. θ sin This relation provides us with one or the standard ethods

More information

Solutions to Practice Problems

Solutions to Practice Problems Higher Geometry Final Exam Tues Dec 11, 5-7:30 pm Practice Problems (1) Know the following definitions, statements of theorems, properties from the notes: congruent, triangle, quadrilateral, isosceles

More information

Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

More information

Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov [email protected]

Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com Polynomials Alexander Remorov [email protected] Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).

More information

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m) Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

More information