(2mn, m 2 n 2, m 2 + n 2 )

Similar documents
REDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].

Math 261 Exercise sheet 2

18.781: Solution to Practice Questions for Final Exam

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

Problem Solving in Math (Math 43900) Fall 2013

ACTM State Calculus Competition Saturday April 30, 2011

THERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q.

PHYS 705: Classical Mechanics. Calculus of Variations II

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

The Fundamental Theorem of Algebra. Objective To use the Fundamental Theorem of Algebra to solve polynomial equations with complex solutions

Some Consequences. Example of Extended Euclidean Algorithm. The Fundamental Theorem of Arithmetic, II. Characterizing the GCD and LCM

Section 8.3 Polar Form of Complex Numbers

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

Complex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)

First day August 1, Problems and Solutions

Math 217 Fall 2013 Homework 2 Solutions

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

MULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6

Foundations of Arithmetic

Unit 5: Quadratic Equations & Functions

CALCULUS CLASSROOM CAPSULES

Attacks on RSA The Rabin Cryptosystem Semantic Security of RSA Cryptology, Tuesday, February 27th, 2007 Nils Andersen. Complexity Theoretic Reduction

ALGEBRA HW 7 CLAY SHONKWILER

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,

The Ramanujan-Nagell Theorem: Understanding the Proof By Spencer De Chenne

Difference Equations

Math1110 (Spring 2009) Prelim 3 - Solutions

1 Matrix representations of canonical matrices

NEW GENERAL FORMULAS FOR PYTHAGOREAN TRIPLES

International Mathematical Olympiad. Preliminary Selection Contest 2012 Hong Kong. Outline of Solutions

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis

Bernoulli Numbers and Polynomials

Solutions to Problem Set 6

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

8.1 Arc Length. What is the length of a curve? How can we approximate it? We could do it following the pattern we ve used before

Smarandache-Zero Divisors in Group Rings

y i x P vap 10 A T SOLUTION TO HOMEWORK #7 #Problem

No-three-in-line problem on a torus: periodicity

APPENDIX A Some Linear Algebra

Anti-van der Waerden numbers of 3-term arithmetic progressions.

Caps and Colouring Steiner Triple Systems

Exercise Solutions to Real Analysis

PROBLEM SET 7 GENERAL EQUILIBRIUM

Errors for Linear Systems

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES

inv lve a journal of mathematics 2008 Vol. 1, No. 1 Divisibility of class numbers of imaginary quadratic function fields

Algorithms for factoring

k(k 1)(k 2)(p 2) 6(p d.

HMMT February 2016 February 20, 2016

Restricted divisor sums

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

One-sided finite-difference approximations suitable for use with Richardson extrapolation

Modelli Clamfim Equazioni differenziali 22 settembre 2016

( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

2.3 Nilpotent endomorphisms

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

Chapter Newton s Method

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur

Solution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Pre-Calculus Summer Assignment

Physics 443, Solutions to PS 7

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

SL n (F ) Equals its Own Derived Group

12. The Hamilton-Jacobi Equation Michael Fowler

PHYS 705: Classical Mechanics. Newtonian Mechanics

On cyclic of Steiner system (v); V=2,3,5,7,11,13

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials

On quasiperfect numbers

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim

Module 14: THE INTEGRAL Exploring Calculus

6.3.4 Modified Euler s method of integration

LECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.

Moments of Inertia. and reminds us of the analogous equation for linear momentum p= mv, which is of the form. The kinetic energy of the body is.

arxiv: v6 [math.nt] 23 Aug 2016

ALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION

where a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets

Nice plotting of proteins II

a b a In case b 0, a being divisible by b is the same as to say that

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

Character Degrees of Extensions of PSL 2 (q) and SL 2 (q)

Waveguides and resonant cavities

ALGEBRA MID-TERM. 1 Suppose I is a principal ideal of the integral domain R. Prove that the R-module I R I has no non-zero torsion elements.

Gravitational Acceleration: A case of constant acceleration (approx. 2 hr.) (6/7/11)

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Spectral Graph Theory and its Applications September 16, Lecture 5

Four Bar Linkages in Two Dimensions. A link has fixed length and is joined to other links and also possibly to a fixed point.

Erratum: A Generalized Path Integral Control Approach to Reinforcement Learning

REAL ANALYSIS I HOMEWORK 1

k t+1 + c t A t k t, t=0

Economics 101. Lecture 4 - Equilibrium and Efficiency

Christian Aebi Collège Calvin, Geneva, Switzerland

Self-complementing permutations of k-uniform hypergraphs

Lecture 5 Decoding Binary BCH Codes

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

Maximal Margin Classifier

Be true to your work, your word, and your friend.

MTH 819 Algebra I S13. Homework 1/ Solutions. 1 if p n b and p n+1 b 0 otherwise ) = 0 if p q or n m. W i = rw i

Transcription:

MATH 16T Homewk Solutons 1. Recall that a natural number n N s a perfect square f n = m f some m N. a) Let n = p α even f = 1,,..., k. be the prme factzaton of some n. Prove that n s a perfect square f and only f α s b) Let a, b N 0 such that gcda, b) = 1 and ab s a perfect square. Prove that both a and b are perfect squares. Proof : a) Suppose frst that n s a perfect square. n = m f some m N wth m. Let m = the prme factzaton of m. Hence n = m = k p β ) = So ths must be the prme factzaton of n. Thus α = β s even f = 1,,... k. Suppose next that α s even f = 1,..., k. α = β f some β N 0 f = 1,,..., k. Put m = n = p α = p β = k p β p β ) = m So n s a perfect square. b) If a = 1 resp. b = 1) then b = ab resp. a = ab) s a perfect square. So we may assume that a, b > 1. Let a = p α1 1 pα k k resp. b = q β1 1 qβ l l ) be the prme factzaton of a resp. b). Snce gcda, b) = 1, we have that p q j f = 1,,..., k and j = 1,,..., l. Hence ab = p α1 1 pα k k qβ1 1 qα l l s the prme factzaton of ab. Snce ab s a perfect square, t follows from a) that α and β j are even f = 1,,..., k and j = 1,,..., l. Agan usng a), we get that a and b are perfect squares. p β be p β.. Let m, n N 0 such that gcdm, n) = 1, m > n and not both m and n are odd. Prove that s a prmtve Pythagean trple. Proof : Note that mn, m n, m + n ) mn) + m n ) = m n + m m n + n = m + m n + n = m + n ) So mn, m n, m + n ) s a Pythagean trple. Suppose that gcdmn, m n ) 1. there exsts a prme p such that p mn) and p m n ). Snce p s a prme, we get that p p m p n. Suppose frst that p. p =, a contradcton snce p m n ) but m n s odd snce gcdm, n) = 1 and not both m and n are odd). Suppose next that p m. p m. Snce p m n ), we get that p m m n )). So p n. Snce p s a prme, we get that p n, a contradcton snce gcdm, n) = 1. Suppose fnally that p n. Smlarly as n the case p m, we get a contradcton. Hence gcdmn, m n ) = 1. So gcdmn, m n, m + n ) = 1 and mn, m n, m + n ) s a prmtve Pythagean trple. 1

3. Fnd all prmtve Pythagean trples such that one of the components s 15. Soluton : We may assume that the prmtve Pythagean trple x, y, z) s of the fm mn, m n, m + n ) where m, n N 0 such that gcdm, n) = 1, m > n and not both m and n are odd. ether m n = 15 m + n = 15. Suppose frst that m + n = 15. We easly get by checkng whether any of the numbers 15, 15, 15 6, 15 8 15 10 s a perfect square) that m = 11 and n =. So x, y, z) =, 117, 15). Suppose next that m n = 15. m n)m + n) = 15. Snce m > n, we get { m n = 1 m + n = 15 { m n = 5 m + n = 5 So m, n) = 63, 6) m, n) = 15, 10). Snce gcdm, n) = 1, we get m, n) = 63, 6). So x, y, z) = 781, 15, 7813). x, y, z) {, 117, 15), 117,, 15), 781, 15, 7813), 15, 781, 7813)}. Use unque prme factzaton to fnd all couples a, b) N 0 such that a > b and a b = b a. Soluton : If b = 1, we easly get that a = a 1 = a b = b a = 1 a = 1, a contradcton snce a > b. So b > 1. we can wrte a = p α and b = p β where p 1 < p < < p n are prmes, α, β N and not both α and β are zero f = 1,,..., n. Substtutng ths nto a b = b a, we fnd p bα = p aβ Usng unque prme factzaton, we get bα = aβ f = 1,,..., n ) Snce α, β ) 0, 0) f = 1,,..., n, we get that α 0 β f = 1,,..., n. Hence t follows from *) that So β < α f = 1,,..., n. Hence α = a > 1 f = 1,,..., n ) β b b = p β dvdes So a = kb f some k N wth k snce a > b). Hence by **), α = kβ f = 1,,..., n. So a = p α = Puttng everythng together, we fnd kb = a = b k and so p kβ = b k 1 = k n p α p β = a ) k = b k If k = then b = b 1 = and so a = bk = =. So, ) s a soluton. We prove by nducton on k) that b k 1 > k f k 3. F k = 3, we get that b 3 1 = b = > 3. Assume that b k 1 > k f some k 3. b k+1) 1 = b k = b b k 1 > k > k + 1. a, b) =, )

5. Fnd all the ratonal ponts on the parabola y y = x + 3. How many ntegral ponts are on ths parabola? Soluton : We easly get that P = 3 ), 0 s a ratonal pont on the curve. We know that we wll get all the ratonal ponts on the curve by ntersectng the curve wth a lne l through P that s ether vertcal has a ratonal slope. If l s vertcal then an equaton f l s x = 3 The ponts of ntersecton between the lne and the parabola are solutons of { x = 3 y y = x + 3 We easly get that these ponts of ntersecton are P = 3 ), 0 and Q = 3, 1 ). If l has a ratonal slope then l has an equaton of the fm y = m x + 3 ) where m Q The ponts of ntersecton between the lne and the parabola are solutons of y = m x + 3 ) 1) y y = x + 3 ) Substtutng 1) nto ), we get m x + ) 3 m x + 3 ) = x + 3 m x + 3m m )x + 9 m 3 m 3 = 0 ) If m = 0, there s only one pont of ntersecton : P = 3 ), 0. So assume that m 0 so the lne l s not hzontal). We know that x = 3 s a root of the quadratc equaton *). Snce the sum of the roots of the quadratc equaton ax + bx + c = 0 s b, we get that the second root of the quadratc equaton *) s a So we get a second pont of ntersecton : x = 3m m m 3 ) + m 3m = m y = m x + 3 ) + m 3m = m m + 3 ) = + m m + m 3m Q = m, + m ) m All ratonal ponts on the parabola y y = x + 3 are gven by 3 ) { + m 3m, 1 m, + m ) } : m Q 0 m 3

There s another way to get ths. If l s not hzontal then l has an equaton of the fm x + 3 = ky where k Q. all the ratonal ponts on the parabola are gven by {k + k 3 ) }, k + 1 : k Q Ths cresponds to the substtuton m = 1 k. Suppose that x, y) s an ntegral pont on the parabola. So y y = x + 3. However, y y = yy 1). So y y s always even, a contradcton snce x + 3 s odd. There are no ntegral ponts on the parabola y y = x + 3. 6. Consder the cubc curve y = x 3 + 3. Fnd an ntegral pont x 0, y 0 ) on ths curve. Use the tangent lne to the curve at ths pont to fnd a non-trval ratonal pont on ths curve. Soluton : We easly get that 1, ) s an ntegral pont on the cubc curve. To fnd the equaton f the tangent lne to the cubc curve at the pont 1, ), we use mplct dfferentaton close to the pont 1, ) the equaton y = x 3 + 3 determnes y as a functon of x) : ydy = 3x dy dx and so dx = 3x y Hence Thus an equaton f that tangent lne s y 1) = 3 1 = 3 y = 3 x 1) To fnd the ponts of ntersecton between ths tangent lne and the cubc curve, we have to solve { y = x 3 + 3 1) Solvng ) f y, we get Substtutng ths nto 1), we fnd y = 3 x 1) ) y = 3 x + 5 3 x + 5 ) = x 3 + 3 16x 3 9x 30x + 3 = 0 Note that x = 1 s a double root of ths equaton. Snce the sum of the roots s 9, we get that the thrd root s 16 x = 9 16 1 1 = 3 16 y = 3 x + 5 = 3 3 ) + 5 16 = 11 6 3 16, 11 ) s a ratonal pont on the cubc curve y = x 3 + 3. 6

7. Let x, y, z) N 3 0 wth x + y = z and gcdx, y, z) = 1. a) Prove that gcdx, z) = 1. b) Prove that x and z are odd whle y s even. b) Mmc the proof of Theem 1.7 about prmtve Pythagean trples) to come up wth fmulas f x, y and z smlar to those n Theem 1.7). Note that there are two cases here! You don t need to prove all the detals, I m manly nterested n the fmulas and an explanaton of how you got them). Proof : a) Suppose that gcdx, z) > 1. there exsts a prme p wth p x and p z. So p x and p z. Hence p z x ). So p y ). If p = then p y and so p y; f p then p y and agan p y. But ths s a contradcton snce gcdx, y, z) = 1. Hence gcdx, z) = 1. b) Suppose that x s even. z = x + y s even and so z s even, a contradcton snce gcdx, z) = 1 by a). So x s odd. z = x + y s odd. Hence z s odd. Suppose that y s odd. Consderng modulo, we get a contradcton. Hence y s even. 3 1 + 1 x + y z 1 mod c) Snce x + y = z, we get that z x)z + x) = z x = y. From b), we see that z x, z + x and y are even. So ) ) z x z + x y ) = z x By a), gcdx, z) = 1. So gcd, z + x ) = 1. Smlarly as n Exercse 1, we can prove : If a, b, c N such that gcda, b) = 1 and ab = c, then there exst m, n N such that a, b) {m, n ), m, n )}. Hence there exst m, n N such that Solvng f z, x and y, we fnd z x = n z + x = m x = m n y = mn z = m + n z x = n z + x = m x = m n y = mn z = m + n Note that we have condtons on m and n. In the frst case, m, n N 0 wth gcdm, n) = 1, m > n and n s odd; n the second case, m, n N 0 wth gcdm, n) = 1, m > n and m s odd. 5